Scribd
Upload
707 views10 pages

Simplex Method in Tabular Form: Construct The Initial Simplex Tableau

This document discusses the simplex method for solving linear programming problems. It provides an example problem to maximize Z=3X1+5X2 subject to constraints on X1 and X2. The problem is converted to standard form and an initial simplex tableau is constructed. Iterations of the simplex method are then shown, determining leaving and entering variables to arrive at an optimal solution. Key steps include ratio tests to choose leaving variables and row operations to solve for new basic feasible solutions at each iteration until reaching an optimal solution where all values in the last row are non-negative.

Uploaded by

Sachin Mailare
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
707 views10 pages

Simplex Method in Tabular Form: Construct The Initial Simplex Tableau

This document discusses the simplex method for solving linear programming problems. It provides an example problem to maximize Z=3X1+5X2 subject to constraints on X1 and X2. The problem is converted to standard form and an initial simplex tableau is constructed. Iterations of the simplex method are then shown, determining leaving and entering variables to arrive at an optimal solution. Key steps include ratio tests to choose leaving variables and row operations to solve for new basic feasible solutions at each iteration until reaching an optimal solution where all values in the last row are non-negative.

Uploaded by

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

Simplex method in tabular form

Construct the initial simplex tableau

Basic X1 … Xn S1 …... Sn A1 …. An RHS


variable
S b1
Coefficient of the constraints

A bm
Z Objective function coefficient Z
In different signs value
Simplex method example
 Solve the following problem using the simplex method
• Maximize
Z = 3X1+ 5X2
Subject to
X1  4
2 X2  12
3X1 +2X2  18
X1 , X2  0
Simplex method example

Standard form
Maximize Z,
Subject to
Z - 3X1- 5X2 =0
X1 + S1 = 4
2 X2 + S2 = 12
3X1 +2X2 + S3 = 18
X1 , X2, S1, S2, S3  0
Initial tableau
Entering
Initial tableau variable

Basic X1 X2 S1 S2 S3 RHS
variable
S1 1 0 1 0 0 4
S2 0 2 0 1 0 12
S3 3 2 0 0 1 18
Z -3 -5 0 0 0 0

Leaving Pivot row


Pivot column
variable Pivot
number
Simplex tableau
Notes:
• The basic feasible solution at the initial tableau
is (0, 0, 4, 12, 18) where:
X1 = 0, X2 = 0, S1 = 4, S2 = 12, S3 = 18, and Z = 0
Where S1, S2, and S3 are basic variables
X1 and X2 are non-basic variables
• The solution at the initial tableau is associated
to the origin point at which all the decision
variables are zero.
Iterations
• Determining the leaving variable by using the minimum
ratio test as following:

Basic Entering RHS Ratio


variable variable X2
(1) (2) (2)(1)
S1 0 4 None
S2 2 12 6
Leaving Smallest ratio
S3 2 18 9
IterationS
• Solving for the new BF solution by using the
eliminatory row operations as following:
New pivot row = old pivot row  pivot number
Basic X1 X2 S1 S2 S3 RHS
variable
S1
X2 0 1 0 1/2 0 6
S3
Z
Note that X2 becomes in the basic variables
list instead of S2
Iteration
This solution is not optimal, since there is a negative numbers in the last row

Basic X1 X2 S1 S2 S3 RHS
variable
S1 1 0 1 0 0 4
X2 0 1 0 1/2 0 6
S3 3 0 0 -1 1 6
Z -3 0 0 5/2 0 30

The smallest ratio is 6/3


The most negative value;
=2; therefore, S3 is the
therefore, X1 is the
leaving variable
entering variable
Iteration
• Apply the same rules we will obtain this solution:

Basic X1 X2 S1 S2 S3 RHS
variable
S1 0 0 1 1/3 -1/3 2
X2 0 1 0 1/2 0 6
X1 1 0 0 -1/3 1/3 2
Z 0 0 0 3/2 1 36
This solution is optimal; since there is no negative solution in the last row:
basic variables are X1 = 2, X2 = 6 and S1 = 2; the non-basic variables are S2 =
S3 = 0
Z = 36
• Artificial Variables – in case of equality and
greater than and equality type constraints
• In case of greater than and equality type
constraints, first to covert it to equation by
subtracting SURPLUS VARIABLES from left
hand side expression.
• Method of solutions – M- method Simplex OR
Two –phase Simplex method

You might also like