1 .		Consider the feasible set (FS) consisting of the following points: A(2,5), B(4,5), C(2,3), D(3,2), E(4,2). Where is the objective function maximized?
2 .		Consider the feasible set: and and. Which of the following is not in the feasible set?
3 .		The feasible set of a certain linear programming problem is given by the following system of linear inequalities. Without graphing this set, determine which of the following points is not in the feasible set.
4 .		There is exactly $30,000 in a trust fund which is to be invested among three types of bonds, A, B, and C, which yield 4%, 5% and 6%, respectively, on the investment. The total yield must be at least $500, no less than $2000 may be invested in B bonds, and no more than $3000 may be invested in A bonds. If x and y represent the amounts invested in A and B bonds, then the amount invested in C bonds is:
5 .		Consider the feasible set defined by the points (0,7), (1,5), (5,1), (7,0) Find an objective function of the form which has its least value at the point (7,0).
6 .		Consider the feasible set bounded by the points: A: (0,5) B: (3,4) C: (4,3) D: (5,0) O: (0,0). The point where the objective function is a maximum is:
7 .		Consider the following linear programming problem. A small company produces three kinds of guitars, traditional, electric and bass, in two factories. Factory A produces 8 traditional, 5 electric and 10 bass guitars in one day, while factory B produces 7 traditional, 9 electric and 8 bass guitars in one day. An order is received for 10 traditional, 15 electric and 18 bass guitars. It costs $900 a day to operate factory A and $1000 a day to operate factory B. The manufacturer chooses the number of days to operate each factory in order to minimize cost. The variables are:
8 .		A business entrepreneur sells two mixtures of nuts. Each pound mixture A contains 70% cashews and 30% walnuts and sells for $3 a pound. Each pound of mixture B contains 45% cashews and 55% walnuts and sells for $2.75 a pound. The entrepreneur has available 900 pounds of cashews and 500 pounds of walnuts. The entrepreneur will try to sell the amount of each mixture that maximizes income. Let x be the number of pounds of mixture A and y be the number of pounds of mixture B. Since the merchant has available 900 pounds of cashews, one inequality which must be satisfied is:
9 .		Consider the following linear programming problem. A small manufacturing plant produces three kinds of bicycles, 3-speed, 5-speed and 10-speed, in two factories. Factory A produces 16 3-speeds, 12 5-speeds and 30 10-speeds in one day, while factory B produces 15 3-speeds, 18 5-speeds and 20 10-speeds in one day. An order is received for 30 3-speeds, 40 5-speeds and 50 10-speeds. It costs $1500 a day to operate factory A and $3000 a day to operate factory B. The manufacturer chooses the number of days to operate each factory in order to minimize cost. The objective function for this problem is:
10 .		Consider the following linear programming problem. A small manufacturing plant produces three kinds of bicycles, 3-speed, 5-speed and 10-speed, in two factories. Factory A produces 16 3-speeds, 12 5-speeds and 30 10-speeds in one day, while factory B produces 15 3-speeds, 18 5-speeds and 20 10-speeds in one day. An order is received for 30 3-speeds, 40 5-speeds and 50 10-speeds. It costs $1200 a day to operate factory A and $3000 a day to operate factory B. The manufacturer chooses the number of days to operate each factory in order to minimize cost. Which of the following inequalities must be satisfied?
Answer choices in this exercise are randomized and will appear in a different order each time the page is loaded.