Scribd
Upload
49 views18 pages

7-Simplex Method-04-01-2025

The document outlines the steps for solving Linear Programming Problems (LPP) using the Simplex Method, including converting to standard form, creating the initial simplex table, and performing optimality tests. It provides a detailed explanation of the process, including identifying key columns and rows, making adjustments to the simplex table, and checking for optimal solutions. Additionally, examples illustrate the application of the method to maximize profits in a manufacturing scenario.

Uploaded by

pavaneshwar04
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
49 views18 pages

7-Simplex Method-04-01-2025

The document outlines the steps for solving Linear Programming Problems (LPP) using the Simplex Method, including converting to standard form, creating the initial simplex table, and performing optimality tests. It provides a detailed explanation of the process, including identifying key columns and rows, making adjustments to the simplex table, and checking for optimal solutions. Additionally, examples illustrate the application of the method to maximize profits in a manufacturing scenario.

Uploaded by

pavaneshwar04
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/ 18

Solution of LPP using Simplex Method

Let us consider the general LPP having 𝑛 variables and 𝑚 constraints (𝑚 ≤ 𝑛)


Steps for Simplex method
Step 1: Convert the given problem in standard form by introducing the slack or
surplus variables. Slack and surplus variables represent the unutilized capacity or
resources. Since, these variables are idle resources, they contribute zero to the
objective function.

Step 2: Write the initial simplex table and obtain the initial basic feasible solution.

Step 3: (Optimality test) Calculate 𝑍𝑗 and 𝐶𝑗 − 𝑍𝑗 values.

If all the 𝐶𝑗 − 𝑍𝑗 values are ≤ 0, then the initial basic feasible solution is Optimal. We
can stop the procedure.

If at least one 𝐶𝑗 −𝑍𝑗 is > 0 then go to step 4.


Step 4: We have to mark the most positive 𝐶𝑗 − 𝑍𝑗 value and the corresponding
column as key column. The variable heading this column enters into the basic
solution.

Step 5: When the new variable enters into the basis column then one of the existed
variable has to leave. To decide the leaving variable, we have to find the ratios by
dividing the elements in the 𝑏 column by the key column elements found in the step
4. Out of all ratios the minimum non-negative (zero or positive) ratio row will
becomes the key row and the corresponding basic variable becomes the leaving
variable. (The element which is the intersection of key column and key row is called
key element or pivot element).

If all the ratios are negative or infinity then the solution of the problem is
unbounded. Otherwise, go to step 6.
Step 6: Now, We have to make the column vector corresponds to the new basic
variable to identity vector. By making the key element to 1 and other elements in
the key column to zeros with respect to key element.

Step 7: We have to check the optimality condition by repeating step 3. If all 𝐶𝑗 − 𝑍𝑗


values are ≤ 0 then the current solution is an optimal solution.

Otherwise, repeat the steps 4, 5, 6, and 7.


Example:

4 − 2 = 2 variables we have to make zeros


𝑍𝑗

𝐶𝑗 − 𝑍𝑗 ≰0
Most positive
𝐶𝑗 − 𝑍𝑗 ≰0
𝐶𝑗 − 𝑍𝑗 ≤0
Example:

A firm manufactures two products 𝐴 & 𝐵 on which the profits earned per unit are ₹3 and
₹4, respectively. Each product is processed on two machines 𝑀1 and 𝑀2 . Product 𝐴 requires one
minute of processing time on 𝑀1 and two minutes on 𝑀2 , while 𝐵 requires one minute on 𝑀1 and
one minute on 𝑀2 . Machine 𝑀1 is available for not more than 7 hr. 30 min. while machine 𝑀2 is
available for 10 hr. during any working day. Find the number of units of products 𝐴 and 𝐵 to be
manufactured to get maximum profit.
𝑪𝒋

𝐶𝐵 Basic variables Body of the problem 𝑏 𝜃


(𝑋𝐵 ) (Min ratio)

𝑍𝑗

𝐶𝐽 − 𝑍𝑗
Example:

Total two iterations, and


Ans: Max Z=33, 𝑥1 = 4, 𝑥2 = 5, 𝑠2 = 4,
𝑠1 = 𝑠3 = 0.
Example:

Solve the following LPP using Simplex Method

380 470 1970


Solution: 𝑥1 = 0, 𝑥2 = , 𝑥3 = , 𝑠1 = 0, 𝑠2 = 0, 𝑠3 = ;
9 3 3
1970
𝑍𝑚𝑎𝑥 =
9
Example:
Lets convert the above LPP into the standard form
𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 −𝑍 = −𝑥1 + 3𝑥2 − 3𝑥3 ,
Subjected to 3𝑥1 − 𝑥2 + 2𝑥3 + 𝑆1 = 7,
−2𝑥1 − 4𝑥2 + 𝑆2 = 12,
−4𝑥1 + 3𝑥2 + 8𝑥3 + 𝑆3 = 10,
𝑥1 , 𝑥2 , 𝑥3 , 𝑆1 , 𝑆2 , 𝑆3 ≥ 0.
Solution:
Lets write the following LPP as follows: 𝑚+𝑛 =6
And number of constraints 𝑚 = 3
𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 −𝑍 = −𝑥1 + 3𝑥2 − 3𝑥3 ,
6 − 3 = 3 variables we have to make zeros.
Subjected to 3𝑥1 − 𝑥2 + 2𝑥3 ≤ 7,
Let us consider 𝑥1 = 0, 𝑥2 = 0, 𝑥3 = 0 (Non basic )
−2𝑥1 − 4𝑥2 ≤ 12,
Then 𝑆1 = 7, 𝑆2 = 12, 𝑆3 = 10. (Basic variables)
−4𝑥1 + 3𝑥2 + 8𝑥3 ≤ 10,
Rest do yourself.
𝑥1 , 𝑥2 , 𝑥3 ≥ 0.
In the simplex table

𝑍𝑗 values represents the amounts by which the contributions (or profit) would be reduced if
one unit of the corresponding variables (𝑥1 , 𝑥2 etc.) was added to the product mix. In other
way, 𝑍𝑗 values represents the contribution lost per unit of the variables.

𝐶𝑗 − 𝑍𝑗 values (index row or net evaluation row) represents net profit (or net contribution or
net marginal improvement) in the value of the objective function 𝑍 for each unit of the
respective column variable introduced into the solution.

The values in replacement ratios (𝜃) column represents the units of the variable that can be
produced by trading all of the current level basic variables. This limits the number of units of
the incoming variable that can be produced from the exchange.
Note: If at least one of the 𝐶𝑗 − 𝑍𝑗 value corresponds to non-basic variable is zero then it is
an indication for the existence of multiple solutions.
Consider the following optimal simplex table for the maximization problem.
𝑪𝒋 It is clear from the table that, in
the 𝑐𝑗 − 𝑧𝑗 row along with the
𝐶𝐵 Basic Body of the problem 𝑏 𝜃 basic variables (𝑦3 , 𝑦2 , 𝑦5 ), the
variables non-basic variable having zero
value. This indicates that the
problem is having an alternative
solution.
To find the alternative solution,
consider that non-basic variable
having zero 𝐶𝑗 − 𝑍𝑗 value as
incoming variable and follow
𝑍𝑗
the general procedure for
𝐶𝑗 − 𝑍𝐽 ≤0 updating the solution in the
next iteration.
Once you update the table in the next iteration, you can observe that you reached optimal
solution with new set of basic variables.

Though we have different basic variables in two instances with different values, the optimal values
of the objective function will be same.
𝑪𝒋

𝐶𝐵 Basic Body of the problem 𝑏 𝜃


variables
150
8
50
Minimum
15 ratio
4
𝑍𝑗

𝐶𝑗 − 𝑍𝐽 ≤0

Update the solution accordingly. You will get alternate solution in the next table.

You might also like