Question: Consider the following linear program: Min 2A + 2B s.t. 1A + 3B 12 3A + 1B 13 1A - 1B = 3
Min 2A + 2B
s.t.
1A + 3B ≤ 12
3A + 1B ≥ 13
1A - 1B = 3
A, B ≥ 0
a. Show the feasible region.
b. What are the extreme points of the feasible region?
c. Find the optimal solution using the graphical solution procedure.
Step by Step Solution
3.52 Rating (159 Votes )
There are 3 Steps involved in it
a b There are two extreme poin... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
148-M-O-G-L-P (47).docx
120 KBs Word File
