Scribd
Upload
78 views13 pages

Simplex Method (Maximization Example)

The document describes using the simplex method to solve a linear programming problem for a company that manufactures tiles. The objective is to maximize profit by determining the optimal number of plain and blue tiles to produce given constraints on production hours. After setting up the problem as a linear program and running it through the simplex method, the optimal solution is found to be 333 plain tiles and 250 blue tiles for a maximum profit of Rs. 12660.

Uploaded by

Darya Memon
Copyright
© Attribution Non-Commercial (BY-NC)
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
78 views13 pages

Simplex Method (Maximization Example)

The document describes using the simplex method to solve a linear programming problem for a company that manufactures tiles. The objective is to maximize profit by determining the optimal number of plain and blue tiles to produce given constraints on production hours. After setting up the problem as a linear program and running it through the simplex method, the optimal solution is found to be 333 plain tiles and 250 blue tiles for a maximum profit of Rs. 12660.

Uploaded by

Darya Memon
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 13

Simplex Method (Maximization Example)

A private company manufactures tiles. They Produce Plain tiles and blue tiles. The profit contribution of each tile has been estimated as Rs. 20 for Plain and Rs. 24 for Blue tile. Each tile passes through three plants. The time required for each and total time available are as follows.

Hours required Plant Plain Blue Monthly Tile Tile available hrs. Burni 2 3 1500 ng 3 2 1499 Glazin g 1 1 600 The company has a contract to supply at most 250 blue tiles per

8/2/12 1 month. Formulate the problem to maximize the profit as a linear 1

Formulation
Decision Variables: Number of Plain tiles = x1 Number of Blue tiles = x2 Object Function: Max. z= 20x1 + 24 x2 Constraints: 2x1 + 3x2 1500 (burning) 3x1 + 2x2 1499 (glazing) x1 + x2 600 (molding) x2 250 (contract) x1 , x2 0 (non-negative) Now change the above 8/2/12 constraints into standard form equation. 2
2

Standard Form
Max. z - 20x1 - 24 x2 =0 ( to bring the objective function in eq. form) Constraints: 2x1 + 3x2 + s1 3x1 + 2x2 + s2 x1 + x2 x2 = 1500 = 1499 + s3 + s4 = 250

= 600

8/2/12

3 3

Trial and Error


no. of variables = n=6, and no. of equations = m=4 Therefore non-basic variables (of zero value) = n-m = 2 basic variables =m=4 Possible basic solutions = n!/m!(n-m)! = 6!/4! 2! = 15

S. Non Basic Variable Z No. basic value variabl e 1 x1 , x2 s1 =1500, s2 =1499, s3 0 =600, s4 = 250 2 x1 , s1 x2 8/2/12 s2 =499, s3 I.S =500,

4 4

S. Non Basic Variable No. basic variabl e 4 x1 , s3 x2 =600, s1 =-300, s2 =299, s4 =-350 5 x1 , s4 x2 =250, s2 =999, s1 =750, s3 = 350 6 x2 , s1 x1 =750, s2 =-751, s3 S. Non =-150, s4 =250 Basic Variable No. basic Variabl e 7 x2 , s2 x1 =500, s1 =500, s3 =100, s4 = 250 8 x2 , s3 x1 =600, s1 =300, s2 8/2/12 =-301, s4 = 250

Z value

I.S 6000 I.S Z value

10,00 0 I.S

5 5

S. Non Basic Variable Z No. basic value variabl e 10 s1 , s2 x1 =299, x2 =300, s3 I.S =0.2, s4 =-50 11 s1 , s3 x1=300, x2 =300, s2 =- I.S S. Non Basic Variable Z 1, s4 = -50 No. basic value 12 s1 , s4 x1=375, x2 =250, s2 =- I.S Variabl 126, s4 =-25 e 13 s2 , s3 x1 =299, x2 =301, s1 I.S =-1, s4 = -51 8/2/12 14 s2 , s4 x1 =333, x2 =250, s1 1266

6 6

Optimality and feasibility condition (A procedure of selecting the entering and leaving variable)
Optimality condition: The entering variable in maximization (minimization) is the nonbasic variable with the most negative (positive) coefficient in the objective z-equztion. Feasibility condition: For both maximization and minimization problems, the leaving variable is the current basic variable having the smallest intercept (minimum ratio with strictly positive denominator in the direction of entering variable)

8/2/12

7 7

Standard Form
Max. z - 20x1 - 24 x2 =0 ( to bring the objective function in eq. form) Constraints: 2x1 + 3x2 + s1 3x1 + 2x2 + s2 x1 + x2 x2 = 1500 = 1499 + s3 + s4 = 250

= 600

8/2/12

8 8

Simplex Tableau 1 Basi x1 x2 s1 s2 s3 s4 c z -20 -24 0 0 0 0 b 0 b/a 0 z-eq. K e y r o w

s1 2 3 1 0 0 0 150 500s1 Pi 0 -eq. v o s2 3 2 0 1 0 0 149 749s2 ey t K e Key 9 eq. l e col 0 E e 1 0 600 600s3 s3 1 1 0m q um nt eq. . Choose the most negative value from z-equation n s4 0 1 0 0 0 1 250 250s4 (i.e. -24). So column containing that value is the eq. key column. Now find out the minimum positive value in the 8/2/12 column (b/a). Minimum value is 250.

9 9

Having identified the entering and the leaving variables, we need to determine the new basic solution. This is achieved by applying Gauss Jordian elimination method, as follows.
1.

New Pivot eq.= Old pivot eq. key element All other equations including z:

1.

new eq. = old eq. (its entering column coefficient) * new pivot eq.

8/2/12

10 10

Simplex Tableau 2 Basi x1 x2 s1 c z -20 -24 0 s1 2 3 1 s2 Basi s3 c z s4 3 x1 1 2 x2 1 0 s1 0 0 0 1 0


8/2/12

s2 0 0 1 s2 0 0 0 0 1

s3 0 0 0 s3 1 0 0 0 0

s4

b/a

0 0 0 150 0 0 149 9 s4 b b/a 0 600 24 600 1 250 0 -3 750 375 -2 999 333 K e y r o w 11
11

-20 0 Pi 0 1 v o s1 2 0 t e Key s2 3 Key 0 q Ele col m

Simplex Tableau 3 Basi x1 x2 c z -20 0 s1 2 0 s1 0 1 s2 0 0 s3 0 0 s4 b b/a

24 600 0 -3 750

s2 3 0 0 1 0 -2 999 Basi x1 x2 s1 s2 s3 s4 b b/a c s3 1 0 0 0 1 -1 350 z 0 0 0 20/3 0 32/31266 0 x2 0 1 0 0 0 1 250 s1 0 0 1 -2/3 0 -5/3 84 x1 1 0 0 1/3 0 -2/3 333
12 12

8/2/12

Solution:

Plain Tiles = 333

Blue tiles = 250

Z = Rs. 12660

8/2/12

13 13

You might also like