{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

BusMgt 331 Sample Exam 1A With Answers

# BusMgt 331 Sample Exam 1A With Answers - Firsl5 letterof...

This preview shows pages 1–5. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
1. [60 points total -.20 poinb for each probten.l Solve the following linear programming problems graphically (each line in the graphs is one unit). List the comer points of the leasible region, determine the objective function value at the corner points, and indicate the optimal solution. lf the problem is infeasiblo, unbounded, or has multiple optimal solutions. indicate in the space below the tiable. Minimize Subject to -xl 2Xt 2xt Z;, + Zy. =/E +2Xz118 4Xz 1 0 3X, : 18 hlxa ;G- el; All decision variables U 0 z\, - \+ xa :o Zn, = V)L- '/. F, = Xr- 3x. -- tF x2 X.:G (*-.o"-*- L,-") 2 Corner Points Obisclivo Function Value Optimal? (", ") {o,o) (" (r,o.) 3 (6,2) -3 K lnfeasible / Multiole Ootimal/ Unbounded Do not write below this
-Zy, + X. --V 2v - ?l L + x, z Xz x-. X,-zx.=Y Z=2Xt-2Xz -2Xt+Xa14 3Xr + 3X2 121 \ - 2x2 1 4 All decision variables Z 0 Minimize Subject to Comet Points Obiectiv. Funclion Value Optimal? Co,ol (0,.1) -8 (r q) -lo X (4,o) x (s, r\ to Infeasible / lvultiple Optimal/ Unbounded Do not write below this line

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Minimize Subject to = |00x1 - x' XrSo 2Xz >_ 4 x1 - Xzt 0 All decision variables :0 Comer Points Objective Function Value Optimal? (o,
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 13

BusMgt 331 Sample Exam 1A With Answers - Firsl5 letterof...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online