Question: The following LP problem admits two extreme-point optimal solutions. Given the following LP problem a) Solve the above problem using the appropriate algorithm and exhibit

The following LP problem admits two extreme-point optimal solutions.

Given the following LP problem

71 max Z=3x1+2+5x3-24 sub ect to 3x1 +22 423 +34 12 -2x1+2+4x3

a) Solve the above problem using the appropriate algorithm and exhibit the first extreme-point optimal solution.

b) How do you identify the activity which is a candidate for another optimal production plan? Use economic reasoning. Compute the second extreme-point optimal solution.

c) Exhibit the two extreme-point primal optimal solutions.

d) Exhibit the two optimal primal bases.

e) What happens to the optimal dual solution in the two optimal tableaux?

f) What is the necessary condition for multiple primal optimal solutions?
g) Can there be, in this problem, a production plan that exhibits three positive components (in spite of the fact that there are only two constraints)?
Explain and compute at least one such a production plan.

71 max Z=3x1+2+5x3-24 sub ect to 3x1 +22 423 +34 12 -2x1+2+4x3 + x416 x; 0, j=1,...,4.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Implementing Programming Languages Questions!