Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

e cor 5. What is the opetimal solutioa for this LP problem? faximize:x+ 2Y Subje

ID: 3326627 • Letter: E

Question

e cor 5. What is the opetimal solutioa for this LP problem? faximize:x+ 2Y Subject to22xYs6 3 M be the number of units to make and B be the number of units to buy. If it costs $2 to make a unit and $3 to b 6. Let 00 units are needed, the objective function of minimizing total cost is a. Max 2M+3B b. Min 4000M +4000B c. Min 8000M+ 12000B d. Min 2M+3B 7. To specify that Xi must be no more than 75% of the blend ofXu X, and X, the constraint should be: d 0.25%2 0.75 (X2%) 8. In using Excel Solver to solve linear programming problems, the target cell represents: a. b c. d. the value of the objective function the constraints the decision variables total cost of the model 9. In using Excel Solver to solve a linear programming problem, the changing cells represent: a the value of the objective function b. the constraints c. the decision variables d. total cost of the model 10. In LP sensitivity analysis, a zero shadow price for a resource ordinarily means that the resource has not been used up. a. b- the resource is scarce. the resource constraint was redundant. something is wrong with the problem formulation. c. d. 11. A constraint in an LP problem has a slack of 5 units. This implies that a. b. c. d. this constraint has exceeded its minimal requirement by 5 units this constraint has consumed 5 units of its resource this constraint is binding this constraint has 5 units of its resource unconsumed 12. The region which satisfies all of the constraints in graphical linear programming is called the a. profit maximization region b. cost minimization region c. optimal solution regiorn d. feasible solution region

Explanation / Answer

5)

from equations

extreme points in fesiable resion are (0,0) , (3,0), (0,6)

For maximum

5x+2y @ (0,0) =0

5x+2y @(3,0) = 15

5x+2y @(0,6) = 12

5x+2y is maximum at (3,0) Option B

6) Option D Min 2M + 3B

7) Option B

As X1 must be less than of 75% of blend of x1, x2 and x3

8) Option A

the value of obejective function