Scribd
Upload
2 views

Ch 3 Simplex Method Part1-1

Operation reasarch

Uploaded by

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

Ch 3 Simplex Method Part1-1

Operation reasarch

Uploaded by

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

Linear

Programming:
Simplex Method

Chapter 3
Step1: Convert
inequality to equation

Step2: Design and create


the initial Tableau

Step3
Yes
Stop Is this
solution
optimal?

No

Step4: Design and create a better solution


(A) (B)
(C)
Choice of Entering Choice of Leaving
Create New Tableau
Variable Variable
Example 1: Reddy Mikks model
• Reddy Mikks produces both interior and exterior paints from two raw materials, M1 and M2. The
following table provides the basic data of the problem:
o The daily demand for interior paint cannot exceed that for exterior paint by more than 1 ton.
o The maximum daily demand for interior paint is 2 tons.
• Reddy Mikks wants to determine the optimum (best) product mix of interior and exterior paints that
maximizes the total daily profit.
3. Structural Constraints Related to Resources
3. StructuralStep 1:
Constraints Related to Resources
Convert inequalities to equations
3. StructuralStep 1:
Constraints Related to Resources
Convert inequalities to equations
3. StructuralStep 1:
Constraints Related to Resources
Convert inequalities to equations
3. StructuralStep 1:
Constraints Related to Resources
Convert inequalities to equations
3. StructuralStep 1:
Constraints Related to Resources
Convert inequalities to equations
3. StructuralStep 1:
Constraints Related to Resources
Convert inequalities to equations
3. StructuralStep 2:
Constraints Related to Resources
Creating Initial Tableau
3. StructuralStep 2:
Constraints Related to Resources
Creating Initial Tableau
3. StructuralStep 2:
Constraints Related to Resources
Creating Initial Tableau
3. StructuralStep 2:
Constraints Related to Resources
Creating Initial Tableau
3. StructuralStep 2:
Constraints Related to Resources
Creating Initial Tableau
3. StructuralStep 2:
Constraints Related to Resources
Creating Initial Tableau
3. StructuralStep 2:
Constraints Related to Resources
Creating Initial Tableau Objective Function
Non-basic Variable Coefficients

Solution
Production Technical
X1=0 x2=0
Coefficients S1=24 s2=6
S3=1 S4=2
Objective Value Z=0
3. StructuralStep 3:
Constraints Related to Resources
Testing Solution Optimality

Maximization problem:
We get optima when all Objective function coefficients are zeros or positive numbers
Minimization problem:
We get optima when all Objective function coefficients are zeros or negative numbers
3. StructuralStep 3:
Constraints Related to Resources
Testing Solution Optimality

This starting solution is not Optimal


Step 4: Getting a better solution than previous one
A) Choosing Entering Variable
Entering Variable

Maximization problem:
We choose the variable has the greatest coefficient with (-) sign in Z row
Minimization problem:
We choose the variable has the greatest coefficient with (+) sign in Z row
Step 4: Getting a better solution than previous one
A) Choosing Entering Variable
Entering Variable

Pivot Column
Step 4: Getting a better solution than previous one
B) Choosing Leaving Variable

The mechanics for determining the leaving variable calls for computing the ratios of the right-hand side of
the equations (Solution column) to the corresponding (strictly) positive constraint coefficients under the
entering variable, 𝑥 , as the above table shows.
The following tableau is a restatement of the starting tableau with its pivot row and column
highlighted.

Pivot Element (Key)


Step 4: Getting a better solution than previous one
C) Designing New Tableau

The new solution is determined by “swapping” the entering variable 𝑥 and the

leaving variable 𝑆 in the simplex tableau to yield

Nonbasic (zero) variables: (𝑺𝟏 , 𝒙𝟐 )

Basic variables: (𝒙𝟏 , 𝑺𝟐 , 𝑺𝟑 , 𝑺𝟒 )


Step 4: Getting a better solution than previous one
C) Designing New Tableau

1. Pivot row
Replace the leaving variable in the Basic column with the entering variable.
New pivot row = Current pivot row / Pivot element

2. All other rows, including z


New row = (Current row) – (Pivot column coefficient) × (New pivot row)
The new basic solution is (𝒙𝟏 , 𝑺𝟐 , 𝑺𝟑 , 𝑺𝟒 ), and the new tableau
becomes

But this new solution is not Optimal


Then
Go To Step 3 and repeat steps
What this tableau tells us?

X1=4 X2=0
S1=0 S2=2 S3=5 S4=2
Z=20
X2 =Entering Variable
In the last tableau, the optimality condition shows that 𝒙𝟐 (with the most negative z-row
coefficient) is the entering variable. The feasibility condition produces the following
information:
Thus, 𝑺𝟐 leaves the basic solution, and the new value of 𝒙𝟐 is 1.5. The corresponding increase in z is
𝒙𝟐 = 2/3× 1.5 = 1, which yields new z = 20 + 1 = 21, as the tableau below confirms.
Replacing s2 in the Basic column with entering of 𝒙𝟐 , the following Gauss-Jordan row operations
are applied:
Based on the optimality condition, none of the z-row coefficients are negative.
Hence, the last tableau is optimal.
The optimum solution can be read from the simplex tableau in the
following manner. The optimal values of the variables in the Basic
column are given in the right-hand-side Solution column and can be
interpreted as
Otherwise, if the slack is positive, then the resource is abundant.
The following table classifies the constraints of the model:
Reddy Mikks using TORA APP
SELECT LINEAR PROGRAMMING
STEP 3: INPUT OF DATA

You might also like