Scribd
Upload
11 views1 page

td3 Bop

Uploaded by

rymachayeb
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
11 views1 page

td3 Bop

Uploaded by

rymachayeb
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

Tunis Business School Spring 2019

Linear programming

Tutorial 5

Question 1
Solve the following LP using the graphical method.
Max Z = 3X1 - X2
X1+X2 ≤ 10
X1 - X2 ≤2
X1, X2 ≥0
Solve-it again using the simplex method and determine all the corner points considered till
optimality is reached.

Question 2
Consider the following LP
Max Z = 5X1 + 2X2 - X3
-2X1 + X2 - X3 ≤1
X1 + X2 ≤ 3
X1, X2, X3 ≥ 0
1. Before solving the problem, could you expect a large number of simplex iterations?
Justify your answer.
2. Find the optimal solution using the simplex method.
3. For each constraint say if it is binding or not. Justify your answer.

Question 3
Solve the following LP using the simplex method and determine all the corner points
considered until optimality is reached.
Max Z = 5X1 + 2X2 + X3
X1 + 3X2 - X3 + S1 = 6,
X2 + X3 + S2 = 4,
3X1 + X2 + S3 = 7,
X1, X2, X3, S1, S2, S3 ≥ 0

Question 4
Solve the following LP
Max Z= 2X1 + 4X2 + X3
X1 + 3X2 - X3 + S1 = 6,
X2 + S2 = 4,
3X1 + X2 + S3 = 7,
X1, X2, X3 ≥ 0
Was the obtained result predictable? Why?

You might also like