Scribd
Upload
30 views

APM3A10 / APM03A3: Assignment 4

The document describes a linear programming problem with objective function f(x) = c1x1 + c2x2 + c3x3 and constraints x1 > 0, x2 > 0, x3 > 0, a11x1 + a12x2 + a13x3 ≤ b1, and a21x1 + a22x2 + a23x3 ≤ b2, where b1, b2 > 0. The tableau shown is after one iteration of the simplex method; the parameters and solution of the original linear program must be determined from the information given.

Uploaded by

Dikgetho Makola
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
30 views

APM3A10 / APM03A3: Assignment 4

The document describes a linear programming problem with objective function f(x) = c1x1 + c2x2 + c3x3 and constraints x1 > 0, x2 > 0, x3 > 0, a11x1 + a12x2 + a13x3 ≤ b1, and a21x1 + a22x2 + a23x3 ≤ b2, where b1, b2 > 0. The tableau shown is after one iteration of the simplex method; the parameters and solution of the original linear program must be determined from the information given.

Uploaded by

Dikgetho Makola
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

APM3A10 / APM03A3

Assignment 4

If the LP
maximize f (x) = c1 x1 + c2 x2 + c3 x3
subject to
x1 > 0; x2 > 0; x3 > 0
and

a11 x1 + a12 x2 + a13 x3 6 b1


a21 x1 + a22 x2 + a23 x3 6 b2 ;

where b1 ; b2 > 0; has the tableau

x1 x2 x3 s 1 s2 b
1 1
0 3
2 1 3
3 s1
1 1
1 3
1 0 3
3 x1
2 4
0 3
7 0 3
f 12

after one iteration of the Simplex Method, determine the various parameters
in the LP. Hence, solve the LP.

You might also like