Scribd
Upload
10 views

Lecture 3

Uploaded by

b5252cshdq
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
10 views

Lecture 3

Uploaded by

b5252cshdq
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 18

SIMPLEX METHOD EXAMPLES Dr. Öğr.

Üyesi Ayça Maden


EXAMPLE 1.
Consider the following LP:
Maximize Z = 2 𝑥1 + 3 𝑥2
subject to
𝑥1 + 3 𝑥2 ≤ 6
3 𝑥1 + 2 𝑥2 ≤ 6
𝑥1 , 𝑥2 ≥ 0
a. Express the problem in equation form.
b. Determine all the basic solutions of the problem, and classify them as feasible and infeasible.
c. Use direct substitution in the objective function to determine the optimum basi feasible solution.
d. Verify graphically that the solution in (c) is the optimum LP solution-hence, conclude that the optimum
solution can be determined algebraically by considering the basic feasible solutions only.
e. Show how the infeasible basic solutions are represented on the graphical solution space.
EXAMPLE 1.
Consider the following LP:
Maximize Z = 2 𝑥1 + 3 𝑥2
subject to
𝑥1 + 3 𝑥2 ≤ 6
3 𝑥1 + 2 𝑥2 ≤ 6
𝑥1 , 𝑥2 ≥ 0

a. Express the problem in equation form.

Maximize Z = 2 𝑥1 + 3 𝑥2

𝑥1 + 3 𝑥2 + 𝑥3 = 6
3 𝑥1 + 2 𝑥2 𝑥4 = 6
𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 ≥ 0
EXAMPLE 1.
Consider the following LP:
Maximize Z = 2 𝑥1 + 3 𝑥2
subject to
𝑥1 + 3 𝑥2 ≤ 6
3 𝑥1 + 2 𝑥2 ≤ 6
𝑥1 , 𝑥2 ≥ 0
b. Determine all the basic solutions of the problem, and classify them as feasible and
infeasible.
1. Basic (𝒙𝟏 , 𝒙𝟐 ) (Point B):
𝑥1 + 3 𝑥2 = 6
6 12 48
3𝑥1 + 2 𝑥2 = 6 Solution : (𝑥1 , 𝑥2 ) = ( 7 , 7
); Z= 7
EXAMPLE 1.

2. Basic (𝒙𝟏 , 𝒙𝟑 ) (Point E):


𝑥1 + 𝑥3 = 6
3𝑥1 = 6 Solution : (𝑥1 , 𝑥3 ) = (2, 4) ; Z = 4
3. Basic (𝒙𝟏 , 𝒙𝟒 ) (Point C):
𝑥1 = 6
3𝑥1 + 𝑥4 = 6 Solution : (𝑥1 , 𝑥4 ) = (6, -12) ; Infeasible
4. Basic (𝒙𝟐 , 𝒙𝟑 ) (Point A):
3𝑥2 + 𝑥3 = 6
2𝑥2 = 6 Solution : (𝑥2 , 𝑥3 ) = (3, -3) ; Infeasible
EXAMPLE 1.
5. Basic (𝒙𝟐 , 𝒙𝟒 ) (Point D):
3𝑥2 = 6
2𝑥2 + 𝑥4 = 6 Solution : (𝑥2 , 𝑥4 ) = (2, 2) ; Z = 6
6. Basic (𝒙𝟑 , 𝒙𝟒 ) (Point F):
𝑥3 = 6
𝑥4 = 6 Solution : (𝑥3 , 𝑥4 ) = (6, 6) ; Z = 0
c. Optimum solution occurs at B:
6 12 48
(𝑥1 , 𝑥2 ) = ( 7 , 7
); Z= 7
EXAMPLE 1.
d.

*Optimum solution occurs at B:


6 12 48
(𝑥1 , 𝑥2 ) = ( , ); Z=
7 7 7

e. A and C points are infeasible from the graph in the d option.


EXAMPLE 2.(PROBLEM SET 3.3B)
EXAMPLE 2.
*For option (a), Simplex method solution:
EXAMPLE 2.
*For option (b), Simplex method solution:
EXAMPLE 2. *For option (c), Simplex method solution:
EXAMPLE 2.
*For option (d), Simplex method solution:
EXAMPLE 3:
The following tableau represents a specific simplex iteration. All variables are non-negative. The tableau is not
optimal for either a maximization or a minimization problem. Thus, when a nonbasic variable enters the solution,
it can either increase or decrease Z or leave it unchanged, depending on the paramaters of the entering variable.

a. Categorize the variables as basic and nonbasic and provide the current values of all the variables.
b. Assuming that the problem is of maximixation type, identify the nonbasic variable that have the potentail to
improve the value of Z. If each such variable enters the basic solution, determine the associated leaving
variable.
c. Repeat part (b) assuming that the problem is of the minimization type.
EXAMPLE 3.

a. Basic: (𝑥8, 𝑥3, 𝑥1) = (12, 6, 0), Z = 620


Non-basic : (𝑥2, 𝑥4, 𝑥5, 𝑥6, 𝑥7) = (0, 0, 0, 0, 0)
b. 𝑥2, 𝑥5, 𝑥6 will improve solution.
12 6
If 𝑥2 enters : 𝑥2 = min ( 3 , 1 , -) = 4. Thus, 𝑥8 leaves.
6 0
If 𝑥5 enters : 𝑥5 = min (-, , ) = 0. Thus, 𝑥1 leaves.
1 1
If 𝑥6 enters : 𝑥6 = min (-, - , -); No leaving variable, and 𝑥6 can be increased to .
EXAMPLE 3.

c. 𝑥4 can impove the solution.


6
If 𝑥4 enters : 𝑥4 = min (-, 3, -) = 2. Thus, 𝑥3 leaves.
EXAMPLE 4.

𝑥1 = number of purses per day


𝑥2 = number of bags per day
𝑥3 = number of backpacks per day
Optimum solution is: 𝑥1 = 0, 𝑥2 = 36, 𝑥3 = 2, Z = 882 $,
determine the status of the resources.
EXAMPLE 4.
*Optimum solution:
𝑥1 = 0, 𝑥2 = 36, 𝑥3 = 2, Z = 882 $
Status of the resources:

Resource Slack Status


Leather 0 Scarce
Sewing 0 Scarce
Finishing 25 Abundant
REFERENCES

Operations Research; an Introduction; Tenth Edition, Global Edition, Hamdy A. Taha

You might also like