A graph the feasible region for the problem b is the


Consider the following linear program:

Max. 1A-2B

s.t. -4A+3B<=3

1A-1B<=3

A,B>=0

a. Graph the feasible region for the problem.

b. Is the feasible region unbounded? Explain.

c. Find the optimal solution.

d. Does an unbounded feasible region imply that the optimal solution to the linear program will be unbounded?

Solution Preview :

Prepared by a verified Expert
Business Management: A graph the feasible region for the problem b is the
Reference No:- TGS01651550

Now Priced at $15 (50% Discount)

Recommended (98%)

Rated (4.3/5)