Scribd
Upload
293 views

2 Simplex Exercises

The document contains a series of exercises involving linear programming models. It begins by asking the reader to write four linear models in maximization standard form. It then provides two linear programming models and asks the reader to solve them graphically and using the simplex method. The remaining exercises involve applying the simplex method to solve additional linear programming models of varying sizes, including providing the optimal solutions and extreme points on graphical representations where applicable.

Uploaded by

Herin Zetiara
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
293 views

2 Simplex Exercises

The document contains a series of exercises involving linear programming models. It begins by asking the reader to write four linear models in maximization standard form. It then provides two linear programming models and asks the reader to solve them graphically and using the simplex method. The remaining exercises involve applying the simplex method to solve additional linear programming models of varying sizes, including providing the optimal solutions and extreme points on graphical representations where applicable.

Uploaded by

Herin Zetiara
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/ 5

The Simplex Method.

Exercises
1. Write the following linear models in maximization standard form:

1.1 max z = 2x1 + 4x2 − 4x3 1.2 min z = 2x1 − 3x2 + x3


subject to subject to
3x1 + 2x2 + 4x3 ≥ 1 x1 − 5x2 + 6x3 ≥ 8
4x1 − 3x2 = 2 x1 − 4x2 ≤ −12
2x1 + x2 + 6x3 ≤ 3 2x1 − x2 + 4x3 = 5
x1 , x2 ≥ 0, x3 : unrestricted x1 , x 2 , x 3 ≥ 0

1.3 min z = 2x1 + 2x2 − 4x3 1.4 max z = 3x1 − 7x2 + 5x3
subject to subject to
2x1 + 2x2 + 2x3 = 10 x2 − x3 ≤ −9
−2x1 + 6x2 − x3 ≤ −10 −x1 − 2x3 ≥ 5
−x1 + 3x2 ≥ 3 4x1 − x2 = 6
x1 ≤ 0, x2 , x3 ≥ 0 x1 ≤ 0, x2 ≥ 0, x3 : unrestricted

2. Consider the following linear model:

max z = x1 + x2
subject to
−x1 + x2 ≤ 4
2x1 + 5x2 ≤ 20
2x1 − x2 ≤ 2
x1 , x 2 ≥ 0

2.1 Solve the model using the graphical solution.


2.2 Compute all the basic solutions. Which of them are feasible? Which of them
are degenerate?
2.3 Associate each of the basic solutions computed in 2.2 to their corresponding
point in the graphical representation.

OpenCourseWare, UPV/EHU, Operations Research. Linear Programming 1


3. Consider the following linear model:

max z = 4x1 + 3x2 + 2x3


subject to
x1 + 2x2 + 3x3 ≤ 6
2x1 + x2 + x3 ≤ 3
x1 + x2 + x3 ≤ 2
x1 , x 2 , x3 ≥ 0

Write the model in maximization standard form, compute the basic feasible solution
associated with the basis B = (a4 a1 a6 ), and apply the improvement theorem to
find the optimal solution.

4. Consider the following linear model:

max z = 2x1 + 2x2 + 5x3


subject to
x1 + x3 ≤ 2
x2 + x3 ≤ 4
x1 + 2x3 ≤ 3
x1 , x 2 , x3 ≥ 0

Given that the inverse of the following matrix is known,


 −1  
 1 0 1   2 0 −1 
   
 0

 1 1 


=

 1 1 −1 


   
1 0 2 −1 0 1

prove that the basic solution that corresponds to the basis B = (a1 a2 a3 ) is optimal.
Compute the optimal solution and the optimal objective value.

5. Consider the following linear model:

max z = x1 + 4x2 + 3x3


subject to
3x1 + 4x2 + 6x3 ≤ 10
x1 + 2x2 + x3 ≤ 4
2x1 + 2x2 + 3x3 ≤ 8
x1 , x 2 , x3 ≥ 0

OpenCourseWare, UPV/EHU, Operations Research. Linear Programming 2


Let us suppose that applying the simplex algorithm we obtain the following tableau:

x1 x2 x3 x4 x5 x6
1 0 0 2 0
a4 2 0 1 −2 0
1
a2 2 1 0 2
0
a6 1 0 0 −1 1

5.1 Prove that the column y1 has not been correctly computed.
5.2 Prove that the column y5 is correct.
5.3 Use the information in the model and in the tableau to compute the missing
values.

6. Apply the simplex algorithm to solve the following linear models. If the model is
feasible, show in the graphical representation the extreme points that correspond to
the basic feasible solutions computed in the simplex tableaux.

6.1 max z = x1 − x2 6.2 max z = x1 + x2


subject to subject to
x1 − 2x2 ≤ 2 x1 + 6x2 ≥ 6
4x1 − 3x2 ≤ 12 2x1 − 3x2 ≥ −6
x1 , x 2 ≥ 0 x1 + 2x2 ≤ 6
x1 , x 2 ≥ 0

6.3 max z = 4x1 − 4x2 6.4 max z = x1 + 2x2


subject to subject to
−2x1 + 2x2 ≤ 4 x1 + 2x2 ≤ 5
2x1 − 2x2 ≤ 6 x1 + x2 ≥ 2
−x1 + 4x2 ≥ −2 x 1 − x2 ≤ 4
x1 , x2 ≥ 0 x1 , x 2 ≥ 0

OpenCourseWare, UPV/EHU, Operations Research. Linear Programming 3


6.5 max z = 2x1 + 2x2 6.6 max z = 2x1 − 2x2
subject to subject to
x 1 − x2 ≤ 2 x1 + 3x2 ≥ 3
2x1 + 2x2 ≤ 6 x1 − 3x2 ≥ 2
x1 + 2x2 ≤ 5 x1 , x 2 ≥ 0
x1 , x 2 ≥ 0

6.7 max z = x1 + 4x2 6.8 max z = 3x1 + 4x2


subject to subject to
x1 − x2 ≥ −4 x1 − 2x2 ≤ 4
3x1 − x2 ≥ −3 x1 + x 2 ≥ 6
x1 − 2x2 ≤ 2 2x1 + 3x2 ≤ 2
x1 , x2 ≥ 0 x1 , x 2 ≥ 0

7. Apply the simplex algorithm to solve the following linear models:

7.1 max z = 3x1 + 2x2 + x3 7.2 min z = 5x1 − x2 − 2x3


subject to subject to
x 1 − x2 + x 3 ≤ 4 x1 + x2 − x3 = 6
2x1 + x2 + 4x3 ≤ 8 x1 + 2x2 − x3 ≥ 4
x1 , x 2 , x 3 ≥ 0 −x1 + x2 + 2x3 ≤ 8
x1 ≤ 0, x2 , x3 ≥ 0

7.3 min z = x1 − 3x2 + 2x3 7.4 min z = 10x1 + 8x2 + 6x3 + 4x4
subject to subject to
3x1 − x2 + 2x3 ≤ 9 2x1 + 4x2 + 2x3 + x4 ≥ 10
−2x1 + 4x2 + x3 ≤ 14 −4x1 + 4x2 − x3 + 2x4 ≥ 12
−4x1 + 4x2 + 8x3 ≤ 10 x 1 , x2 , x3 , x4 ≥ 0
x1 , x 2 , x 3 ≥ 0

OpenCourseWare, UPV/EHU, Operations Research. Linear Programming 4


7.5 min z = −16x1 + 2x2 + x3 − 2x4 − 3x5 7.6 max z = 9x1 + 5x2 + 4x3 + x4
subject to subject to
3x1 + x2 + 3x3 − 3x4 + 9x5 ≤ 12 2x1 + x2 + x3 + 2x4 ≤ 2
2x1 + 8x2 + 4x3 + 2x4 − 4x5 ≤ 10 8x1 + 4x2 − 2x3 − x4 ≥ 10
x1 , x 2 , x 3 , x 4 , x 5 ≥ 0 4x1 + 7x2 + 2x3 + x4 ≤ 4
x1 , x 2 , x 3 , x 4 ≥ 0

7.7 min z = −4x1 + 2x2 − x3 7.8 min z = 3x1 + x2 − 2x3 − 2x4 + x5


subject to subject to
x1 − x2 + 2x3 ≥ −8 x1 + 2x2 + 2x3 + x4 + x5 ≤ 2
2x1 − 3x2 + 4x3 ≤ 5 2x1 + x2 + 3x3 + 2x4 + 2x5 ≥ 12
x1 , x2 ≥ 0, x3 : unrestricted x 1 , x2 , x3 , x4 , x5 ≥ 0

OpenCourseWare, UPV/EHU, Operations Research. Linear Programming 5

You might also like