Question: Consider the following problem. Maximize Z = 2x1 + x2 4x3 + 3x4, Subject to and x2 0, x3 0, x4

Consider the following problem.
Maximize Z = €“ 2x1 + x2 €“ 4x3 + 3x4,
Subject to
Consider the following problem.Maximize Z = €“ 2x1 + x2

and
x2 ‰¥ 0, x3  0, x4 ‰¥ 0
(no nonnegativity constraint for x1).
(a) Reformulate this problem to fit our standard form for a linear programming model presented in Sec. 3.2.

(b) Using the Big M method, construct the complete first simplex tableau for the simplex method and identify the corresponding initial (artificial) BF solution. Also identify the initial entering basic variable and the leaving basic variable.

(c) Using the two-phase method, construct row 0 of the first simplex tableau for phase 1.

(d) Use a computer package based on the simplex method to solve the problem.

x1t 3x3 2x4 x1 + 2x2 + x3 + 2x4 = 2

Step by Step Solution

3.31 Rating (177 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a b c d maximize Z 2x 2x2 x... 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 (369).docx

120 KBs Word File

Students Have Also Explored These Related Statistics Questions!