Maximization using simplex method and payoff table


Question 1:

Given the following linear programming problem:

Maximize: Z =    8x1 + 12x2 + 10x3
Subject to : 2x1 + 4x2 + 2x3 <= 60
9x1 + 4x2 + 16x3 <= 242
5x1 + 4x2 + 6x3 <= 125
x1, x2, x3 >= 0

a. Solve the problem using the simplex method.

b. Does the problem have an alternate optimum? If so, compute it.

Question 2: The East End Technology Company specializes in Ergonomic wrist supports. This Ergonomic wrist supports is sold at a price of $3.50 and costs $2.00 to process. Any wrist supports not sold that day may be sold later to an after-market supplier for only $1.25. Your intuition tells you that sales of 0, 10, 20, 30, or 40 cases of Wrist supports are possible.

a. Compute the payoff table

b. Which alternative would you use using the optimist's decision model?

c. Which alternative would you use using the pessimist's decision model?

d. Which alternative would you use using the minimization of regret decision model?

Solution Preview :

Prepared by a verified Expert
Operation Research: Maximization using simplex method and payoff table
Reference No:- TGS01845984

Now Priced at $25 (50% Discount)

Recommended (92%)

Rated (4.4/5)