Question: This chapter has described the simplex method as applied to linear programming problems where the objective function is to be maximized. Section 4.6 then described

This chapter has described the simplex method as applied to linear programming problems where the objective function is to be maximized. Section 4.6 then described how to convert a minimization problem to an equivalent maximization problem for applying the simplex method. Another option with minimization problems is to make a few modifications in the instructions for the simplex method given in the chapter in order to apply the algorithm directly.
(a) Describe what these modifications would need to be.
(b) Using the Big M method, apply the modified algorithm developed in part (a) to solve the following problem directly by hand. (Do not use your OR Courseware.)
Minimize Z = 3x1 + 8x2 + 5x3,
Subject to
This chapter has described the simplex method as applied to

and
x1 ‰¥ 0, x2 ‰¥ 0, x3 ‰¥ 0.

312 4x70 3x1 + 5x2 + 2x3 70

Step by Step Solution

3.35 Rating (167 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a In order to decrease the objective function value ... View full answer

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

Document Format (1 attachment)

Word file Icon

545-M-S-L-P (368).docx

120 KBs Word File

Students Have Also Explored These Related Statistics Questions!