Nerolac produces both interior and exterior paints from two raw materials Pigments and Binder.

The following
table provides the basic data of the problem:

Tons of raw material per ton of Maximum daily

Exterior paint Interior paint availability ( tons)
Raw material, 6 4 24
Pigment
Raw material, 1 2 6
Binder
Profit per ton ( Rs 5 4
1000)

A market survey indicates that the daily demand for interior paint cannot exceed that for
exterior paint by more than 1 ton. Also, the maximum daily demand for the interior paint is 2
tons.
Nerolac wants to determine the optimum(best) product mix of interior and exterior paints
that maximizes the total daily profit
Decision Variables- x, y

Let x be the no. of units of exterior paint to be produced

Let y be the no. of units of interior paint to be produced

Objective Function – Maximising total profit

max z= 5x+4y
Constraints
6x+ 4y ≤ 24 ( based on raw material - pigment)
x+2y≤ 6 (based on raw material - binder)
-x +y ≤ 1 (based on market survey)
y≤2 (based on market survey)
x, y≥ 0 ( Non-negativity constraint)
max z= 5x+4y
Constraints
6x+ 4y ≤ 24
x+2y≤ 6
-x +y ≤ 1
y≤2
x, y≥ 0
1. Food X contains 6units of vitamin A per gram and 7units of
vitamin B per gram and costs 12 Rupees per gram. Food Y
contains 8 units of vitamin A and 12 units of vitamin B and
costs 20 Rupees per gram. The daily minimum requirement
of vitamin A and vitamin B is 100 units and 120 units
respectively. Find minimum cost of product mix by simplex
method?
 Food X Food Y Daily minimum
requirement
vitamin A 6 8 100
vitamin B 7 12 120
cost 12 20
Decision Variables- x, y

Let x be the no. of unit of food X to be purchased

Let y be the no. of unit of food Y to be purchased

Objective Function – Minimizing total cost

Min z= 12x+20y
Constraints
6x+8y ≥ 100 ( based on vitamin A requirement)
7x+12y ≥ 120 ( based on vitamin B requirement)
x,y ≥ 0 ( Non-negativity constraint)
Min z= 12x+20y
Subject to the Constraints
6x+8y ≥ 100
7x+12y ≥ 120
x,y ≥ 0
2. M/S ABC have two different mines which produce the same ore. After crushing,
the ores are graded as A grade, B grade & C grade. There is some demand of all
grades. The company has contracted for supplying 48tons of A grade, 32 tons of
B grade & 96 tons of C grade ore per month to a smelting plant. The company
spends Rs 2000 per day to run the first mine and Rs1600 per day to run the
second. The capacities of the mines are as shown below:
Production per day
Mine 1 Mine 2
A Grade 6 tons 2 tons
B Grade 2 tons 2 tons
C Grade 4 tons 12 tons

How many days per month the mines should operate to fulfill the company’s
commitment most economically?
Decision Variables- x, y

Let x be the no. of days per month the mine 1 should operate
Let y be the no. of days per month the mine 2 should operate

Objective Function – Minimizing total cost

Min z= 2000x+1600y
Constraints
6x+2y ≥ 48 ( based on A grade ore requirement)
2x+2y ≥ 32 (based on B grade ore requirement)
4x+12y ≥ 96 (based on C grade ore requirement)
x,y ≥ 0 ( Non-negativity constraint)
Min z= 2000x+1600y
Subject to Constraints
6x+2y ≥ 48
2x+2y ≥ 32
4x+12y ≥ 96
x,y ≥ 0
3. A person requires 10, 12 and 12 units of chemicals A,
B and C respectively for his garden. A liquid product contains
5, 2 and 1 units of A, B & C respectively per jar. A dry product
contains 1, 2 and 4 per units of A, B & C per unit. If the liquid
product sells for Rs 3/- per jar and dry products for Rs2/- per
carton, how many of each should be purchased in order to
minimize the cost and meet the requirement
Decision Variables- x1, x2

Let x1be the no. of units of liquid product to be purchased

Let x2 be the no. of units of dry product to be purchased

Objective Function – Minimizing total cost

Min z= 3x1+2x2
Constraints
5 x1 +x2 ≥ 10 ( based on chemical A requirement)
2 x1 +2x2 ≥ 12 (based on chemical B requirement)
x1 +4x2 ≥ 12 (based on chemical C requirement)
x 1, x 2≥ 0 ( Non-negativity constraint)
Min z= 3x1+2x2
Subject to Constraints
5 x1 +x2 ≥ 10
2 x1 +2x2 ≥ 12
x1 +4x2 ≥ 12
x1, x2≥ 0
4. A firm makes two types of furniture chairs and tables. The
contribution for each product as calculated by the
accounting department is Rs 20 per chair and Rs 30 per
table. Both the products are processed on three machines
M1, M2 and M3. The time required in hours by each product
and the total time available in hours per week on each
machine are as follows
Machine Chair Table Available time
M1 3 3 36
M2 5 2 50
M3 2 6 60
How should the manufacturer schedule his production order
to maximize contribution?
Decision Variables- x1, x2

Let x1be the no. of chairs to be made

Let x2 be the no. of tables to be made

Objective Function – Maximising total contribution

max z= 20x1+30x2
Constraints
3 x1 + 3x2 ≤ 36 ( based on Machine M1 availability)
5 x1 +2x2 ≤ 50 (based on Machine M2 availability)
2x1 +6x2 ≤ 60 (based on Machine M3 availability)
x 1, x 2≥ 0 ( Non-negativity constraint)
max z= 20x1+30x2
Subject to Constraints
3 x1 + 3x2 ≤ 36
5 x1 +2x2 ≤ 50
2x1 +6x2 ≤ 60
x1, x2≥ 0
 Graphical Method
Nerolac produces both interior and exterior paints from two raw materials Pigments and Binder. The following
table provides the basic data of the problem:

Tons of raw material per ton of Maximum

Exterior paint Interior paint daily
availability
( tons) A market survey indicates that the daily
Raw 6 4 24 demand for interior paint cannot exceed that
material, for exterior paint by more than 1 ton. Also,
Pigment the maximum daily demand for the interior
paint is 2 tons.
Raw 1 2 6
Nerolac wants to determine the
material,
optimum(best) product mix of interior and
Binder
exterior paints that maximizes the total daily
Profit per 5 4 profit
ton ( Rs
1000)
 Graphical Method
max z= 5x+4y
Constraints
6x+ 4y ≤ 24 ---------------(1) (4,0) (0,6)
x+2y≤ 6 -----------------(2) (6,0) (0,3)
-x +y ≤ 1 ----------(3) (-1,0) (0,1)
y ≤ 2----------------(4)
x, y≥ 0
 x≥ 0

y 3

4 y≥ 0

1
2 x
 Z=15 Increasing direction of Z

Z=5
Z=0
 B C
A D
E
O
 OABCDEO- Bounded feasible region

Corner points Value of Z at the corner point

0 (0,0) Z(O)= 5 x 0 + 4 x 0= 0

A( 0,1) Z(A)= 5 x 0 + 4 x 1= 4

B(1,2) Z(B)= 5 x 1 + 4 x 2=13

C(2,2) Z(C)= 5 x 2 + 4 x 2=18

D(3,1.5) Z(D) = 5 x 3 + 4 x 1.5=21( Optimum)

E( 4,0) Z(E) = 5 x 4 + 4 x 0=20

The maximum is at point D( 3,1.5)

The optimum solution is

Max Z = 21
x=3 y= 1.5
Solve the following LPP by graphical method
Minimize Z = 20X1 + 40X2
Subject to constraints
36X1 + 6X2 ≥ 108

3X1 + 12X2 ≥ 36
20X1 + 10X2 ≥ 100
X1 , X2 ≥ 0
The first constraint 36X1 + 6X2 ≥ 108 can be
represented as follows.
We set 36X1 + 6X2 = 108
When X1 = 0 in the above constraint, we get,
36 x 0 + 6X2 = 108

X2 = 108/6 = 18
Similarly when X2 = 0 in the above constraint, we
get,
36X1 + 6 x 0 = 108
X1 = 108/36 = 3

The second constraint 3X1 + 12X2 ≥ 36 can be

represented as follows,
We set 3X1 + 12X2 = 36
When X1 = 0 in the above constraint, we get,
3 x 0 + 12X2 = 36

X2 = 36/12 = 3
Similarly when X2 = 0 in the above constraint, we
get,
3X1 + 12 x 0 = 36
X1 = 36/3 = 12
The third constraint20X1 + 10X2 ≥ 100 can be
represented as follows,
We set 20X1 + 10X2 = 100
When X1 = 0 in the above constraint, we get,
20 x 0 + 10X2 = 100; X2 = 100/10 = 10
Similarly when X2 = 0 in the above constraint,
we get,
20X1 + 10 x 0 = 100
X1 = 100/20 = 5
Point X1 X2 Z = 20X1 + 40X2
0 0 0 0
A 0 18 Z = 20 x 0 + 40 x 18 = 720
B 2 6 Z = 20 x2 + 40 x 6 = 280
Z = 20 x 4 + 40 x 2 = 160*
C 4 2
Minimum
D 12 0 Z = 20 x 12 + 40 x 0 = 240

The Minimum cost is at point C When X1 = 4 and X2 = 2; Z = 160

Min Z=160
X1=4
X2=2
A manufacturer has three machines I, II and III installed in his factory. Machines I
and II are capable of being operated for at most 12 hours whereas machine III
must be operated for atleast 5 hours a day. She produces only two items M and N
each requiring the use of all the three machines. The number of hours required
for producing 1 unit of each of M and N on the three machines are given in the
following table:
Items No. of hours required on machines
I II III
M 1 2 1
N 2 1 1.25
She makes a profit of Rs 600 and Rs 400 on items M and N respectively. How many
of each item should she produce so as to maximise her profit assuming that she
can sell all the items that she produced? What will be the maximum profit?
Let x and y be the number of items M and N respectively.
Total profit on the production =(600 x + 400 y)

Maximise Z = 600 x + 400 y

subject to the constraints:
x + 2y ≤ 12 (constraint on Machine I) ... (1)
2x + y ≤ 12 (constraint on Machine II) ... (2)
x + 1.25y ≥ 5 (constraint on Machine III) ... (3)
x ≥ 0, y ≥ 0 ... (4)
x + 2y = 12
 Let us evaluate Z = 600 x + 400 y at these corner points.

Corner point Z = 600 x + 400 y

(5, 0) 3000
(6, 0) 3600
(4, 4) 4000 ← Maximum
(0, 6) 2400
(0, 4) 1600

We see that the point (4, 4) is giving the maximum value of Z.

Hence, the manufacturer has to produce 4 units of each item to
get the maximum profit of Rs 4000
A dietician has to develop a special diet using two foods P and Q.
Each packet (containing 30 g) of food P contains 12 units of calcium, 4
units of iron, 6 units of cholesterol and 6 units of vitamin A. Each
packet of the same quantity of food Q contains 3 units of calcium, 20
units of iron, 4 units of cholesterol and 3 units of vitamin A. The diet
requires atleast 240 units of calcium, atleast 460 units of iron and at
most 300 units of cholesterol. How many packets of each food should
be used to minimise the amount of vitamin A in the diet? What is the
minimum amount of vitamin A?
Let x and y be the number of packets of food P and Q
respectively. Obviously x ≥ 0, y ≥ 0. Mathematical formulation of
the given problem is as follows:
Minimise Z = 6x + 3y (vitamin A)
subject to the constraints 1
2x + 3y ≥ 240 (constraint on calcium), i.e. 4x + y ≥ 80 ... (1)
4x + 20y ≥ 460 (constraint on iron), i.e. x + 5y ≥ 115 ... (2)
6x + 4y ≤ 300 (constraint on cholesterol), i.e. 3x + 2y ≤ 150 ... (3)
x ≥ 0, y ≥ 0 ... (4)
The coordinates of the corner points L, M and N are (2, 72), (15, 20) and (40,
15) respectively. Let us evaluate Z at these points:
Corner Point Z=6x+3y
(2, 72) 228
(15, 20) 150 ← Minimum
(40, 15) 285

From the table, we find that Z is minimum at the point (15, 20).
Hence, the amount of vitamin A under the constraints given in the problem
will be minimum, if 15 packets of food P and 20 packets of food Q are used in
the special diet. The minimum amount of vitamin A will be 150 units.
 max z= 20a-20b+30x2
max z= 20x1+30x2
Subject to Constraints
Subject to Constraints
3 a-3b + 3x2 ≤ 36
3 x1 + 3x2 ≤ 36
5 a-5b+2x2 ≤ 50
5 x1 +2x2 ≤ 50
a,b, x2≥ 0
x1 -unrestricted
x2 ≥ 0
Standard Form

Let x1= a-b

max z= 20a-20b+30x2
Where a,b ≥ 0
Subject to Constraints
3 a-3b + 3x2 +s1 = 36
5 a-5b+2x2 + s2 = 50
a,b, x2,s1,s2≥ 0
max z= 5x+4y
Constraints
6x+ 4y ≤ 24
x+2y≤ 6
-x +y ≤ 1
y≤2
x,y ≥ 0
Standard form or canonical Form
The problem is expressed in equation form as

max z= 5x+4y+0S1+0S2+0S3+0S4
Subject to Constraints
6x+ 4y +S1=24
x+2y+S2= 6
-x +y +S3= 1
y +S4= 2
x,y, S1,S2,S3,S4 ≥ 0
Basic x y s1 s2 s3 s4 Solution
Z -5 -4 0 0 0 0 0 Z-row
S1 6 4 1 0 0 0 24 S1-row
S2 1 2 0 1 0 0 6 S2-row
S3 -1 1 0 0 1 0 1 S3-row
S4 0 1 0 0 0 1 2 S4-row
 y

y
Optimality Condition
Determines the entering variable

The entering variable is the non basic variable with most

negative Z-co efficient in a Maximization problem

The entering variable is the non basic variable with most

Positive Z-co efficient in a Minimization problem
Feasibility Condition
Determines the leaving variable

The leaving variable is the basic variable with minimum

Ratio for Maximization and Minimization problem

Ratio= Solution Column/ Entering column Coefficient

Note: Denominator should always be positive( i.e ., ignore

–ve and zero )
Basic x y s1 s2 s3 s4 Solution
Z -5 -4 0 0 0 0 0 Z-row
S1 6 4 1 0 0 0 24 S1-row
S2 1 2 0 1 0 0 6 S2-row
S3 -1 1 0 0 1 0 1 S3-row
S4 0 1 0 0 0 1 2 S4-row
Basic Entering variable Solution Ratio
Variable X ( or intercept)

S1 6 24 24/6=4

S2 1 6 6/1=6

S3 -1 1 1/(-1)=-1(Ignore)

S4 0 2
1/0=∞ (ignore)
Basic x y s1 s2 s3 s4 Solution Ratio
Z -5 -4 0 0 0 0 0 -
S1 6 4 1 0 0 0 24 24/6= 4
S2 1 2 0 1 0 0 6 6/1=6
S3 -1 1 0 0 1 0 1 (Ignore)
S4 0 1 0 0 0 1 2 (Ignore)
y
Basic x y s1 s2 s3 s4 Solution Ratio
Z -5 -4 0 0 0 0 0 -
S1 6 4 1 0 0 0 24 24/6= 4
S2 1 2 0 1 0 0 6 6/1=6
S3 -1 1 0 0 1 0 1 (Ignore)
S4 0 1 0 0 0 1 2 (Ignore)
 Entering
variable

Basic x y s1 s2 s3 s4 Solution
Z -5 -4 0 0 0 0 0
Pivot row S1 6 4 1 0 0 0 24 Leaving
variable
S2 1 2 0 1 0 0 6
S3 -1 1 0 0 1 0 1
S4 0 1 0 0 0 1 2
Pivot
Column
Basic x y s1 s2 s3 s4 Solution
Z 0 -2/3 5/6 0 0 0 20
x 1 2/3 1/6 0 0 0 4
S2 0 4/3 -1/6 1 0 0 2
S3 0 5/3 1/6 0 1 0 5
S4 0 0 1 0 0 1 2
 Entering
variable

Basic x y s1 s2 s3 s4 Solution Ratio

Z 0 -2/3 5/6 0 0 0 20 -
4
x 1 2/3 1/6 0 0 0 4 2/3
=6
S2 0 4/3 -1/6 1 0 0 2 2
=1.5 Leaving
4/3 variable
5
S3 0 5/3 1/6 0 1 0 5 5/3 =3

S4 0 0 1 0 0 1 2 ---
Basic x y s1 s2 s3 s4 Solution
Z 0 0 ¾ ½ 0 0 21
x 1 0 1/4 -1/2 0 0 3
Y 0 1 -1/8 3/4 0 0 3/2
S3 0 0 3/8 -5/4 1 0 5
S4 0 0 1/8 -3/4 0 1 2
max z= 5x+4y
Constraints
6x+ 4y ≤ 24
x+2y≤ 6
-x +y ≤ 1
y≤2
x,y ≥ 0
Standard form or canonical Form
The problem is expressed in equation form as

max z= 5x+4y+0S1+0S2+0S3+0S4
Subject to Constraints
6x+ 4y +S1=24
x+2y+S2= 6
-x +y +S3= 1
y +S4= 2
x,y, S1,S2,S3,S4 ≥ 0
Basic x y s1 s2 s3 s4 Solution
Z -5 -4 0 0 0 0 0 Z-row
S1 6 4 1 0 0 0 24 S1-row
S2 1 2 0 1 0 0 6 S2-row
S3 -1 1 0 0 1 0 1 S3-row
S4 0 1 0 0 0 1 2 S4-row
 Entering
variable

Basic x y s1 s2 s3 s4 Solution Ratio

Leaving
Z -5 -4 0 0 0 0 0 - variable
Pivot row S1 6 4 1 0 0 0 24 24/6= 4
S2 1 2 0 1 0 0 6 6/1=6
S3 -1 1 0 0 1 0 1 (Ignore)
S4 0 1 0 0 0 1 2 (Ignore)
Pivot
Column
 Iteration 0

Basic x y s1 s2 s3 s4 Solution
Z -5 -4 0 0 0 0 0
S1 6 4 1 0 0 0 24
S2 1 2 0 1 0 0 6
S3 -1 1 0 0 1 0 1
S4 0 1 0 0 0 1 2
Iteration 1 Z 0 -2/3 5/6 0 0 0 20
x 1 2/3 1/6 0 0 0 4
S2 0 4/3 -1/6 1 0 0 2
S3 0 5/3 1/6 0 1 0 5
S4 0 0 1 0 0 1 2
 Entering
variable

Basic x y s1 s2 s3 s4 Solution Ratio

Z 0 -2/3 5/6 0 0 0 20 -
4
x 1 2/3 1/6 0 0 0 4 2/3
=6
S2 0 4/3 -1/6 1 0 0 2 2
=1.5 Leaving
4/3 variable
5
S3 0 5/3 1/6 0 1 0 5 5/3 =3

S4 0 0 1 0 0 1 2 ---
 Basic x y s1 s2 s3 s4 Solution
Z 0 0 ¾ ½ 0 0 21
x 1 0 1/4 -1/2 0 0 3
Y 0 1 -1/8 3/4 0 0 3/2
S3 0 0 3/8 -5/4 1 0 5
S4 0 0 1/8 -3/4 0 1 2
Since all the Z Coefficients are Zero or Positive the solution is optimal
The Optimal Solution is
Max Z= 21
X=3
Y= 3/2
Basic X1 X2 X3 s1 s2 s3 Solution
Z -1 3 -3 0 0 0 0
s1 3 -1 2 1 0 0 7
s2 -2 -4 0 0 1 0 12
S3 -4 3 8 0 0 1 10
 Entering
variable

Basic X1 X2 X3 s1 s2 s3 Solution Ratio

Z -1 3 -3 0 0 0 0 -
s1 3 -1 2 1 0 0 7 -
s2 -2 -4 0 0 1 0 12 -
Leaving
S3 -4 3 8 0 0 1 10 10/3 variable
Basic X1 X2 X3 s1 s2 s3 Solution
Z 3 0 -11 0 0 -1 -10
s1 5/3 0 14/3 1 0 1/3 31/3
s2 -22/3 0 32/3 0 1 4/3 76/3
X2 -4/3 1 8/3 0 0 1/3 10/3
Basic X1 X2 X3 s1 s2 s3 Solutio Ratio
n
Z 3 0 -11 0 0 -1 -10 -
31/3
s1 5/3 0 14/3 1 0 1/3 31/3 5/3
= 31/5
s2 -22/3 0 32/3 0 1 4/3 76/3 -
X2 -4/3 1 8/3 0 0 1/3 10/3 -
 Basic X1 X2 X3 s1 s2 s3 Solution
Z 0 0 -97/5 -9/5 0 -8/5 -143/5
X1 1 0 14/5 3/5 0 1/5 31/5
s2 0 0 156/5 22/5 1 14/5 354/5
X2 0 1 32/5 4/5 0 3/5 58/5

Since all the Z Coefficients are Zero or Negative the solution is optimal
The Optimal Solution is
Min Z= -143/5
X1=31/5
X2= 58/5
X3=0
Max Z= 2X1 + 3 X2 + 4X3
Subject to
3X1 + X2 + 4X3≤ 600
2X1 + 4 X2 + 2X3≥480
2X1 + 3 X2 + 3X3=540
X1 ,X2 ,X3≥0

Standard Form
Max Z= 2X1 + 3 X2 + 4X3
Subject to
3X1 + X2 + 4X3+S1= 600
2X1 + 4 X2 + 2X3-S2=480
2X1 + 3 X2 + 3X3=540
X1 ,X2 ,X3, S1, S2≥0
Basic X1 X2 X3 s1 s2 Solution
Z -2 -3 -4 0 0 0
s1 3 1 4 1 0 600
2 4 2 0 -1 480
2 3 3 540
Artificial Variables

Standard Form
Max Z= 2X1 + 3 X2 + 4X3
Subject to
3X1 + X2 + 4X3+S1= 600
2X1 + 4 X2 + 2X3-S2+A1=480
2X1 + 3 X2 + 3X3+A2=540
X1 ,X2 ,X3, S1, S2, A1, A2≥0
Big M Method

Standard Form
Max Z= 2X1 + 3 X2 + 4X3-MA1-MA2
Subject to
3X1 + X2 + 4X3+S1= 600
2X1 + 4 X2 + 2X3-S2+A1=480
2X1 + 3 X2 + 3X3+A2=540
X1 ,X2 ,X3, S1, S2, A1, A2≥0
Basic X1 X2 X3 s1 s2 A1 A2 Solution

Z -2 -3 -4 0 0 M M 0
s1 3 1 4 1 0 0 0 600
A1 2 4 2 0 -1 1 0 480
A2 2 3 3 0 0 0 1 540
Standard Form
Max Z= 2X1 + 3 X2 + 4X3-MA1-MA2
Subject to
3X1 + X2 + 4X3+S1= 600
2X1 + 4 X2 + 2X3-S2+A1=480  A1= -2X1 - 4 X2 - 2X3+S2+480
2X1 + 3 X2 + 3X3+A2=540 A2= -2X1 - 3 X2 - 3X3+540
X1 ,X2 ,X3, S1, S2, A1, A2≥0

Z= 2X1 + 3 X2 + 4X3-MA1-MA2
= 2X1 + 3 X2 + 4X3-M(-2X1 - 4 X2 - 2X3+S2+480 )-M(-2X1 - 3 X2 - 3X3+540)
= X1 ( 2+2M+2M) + X2(3+4M+3M)+X3(4+2M+3M)-MS2+(-480M-540M)
= X1 ( 2+4M) + X2(3+7M)+X3(4+5M)-MS2-1020M
Z - ( 2+4M) X1 - (3+7M) X2 - (4+5M) X3+MS2=-1020M
Basic X1 X2 X3 s1 s2 A1 A2 Solution Ratio

Z -(2+4M) - (3+7M) - (4+5M)

0 M 0 0 -1020M

s1 3 1 4 1 0 0 0 600
A1 2 4 2 0 -1 1 0 480
A2 2 3 3 0 0 0 1 540
Max Z= 2X1 + 3 X2 + 4X3
Subject to
3X1 + X2 + 4X3≤ 600
2X1 + 4 X2 + 2X3≥480
2X1 + 3 X2 + 3X3=540
X1 ,X2 ,X3≥0

Standard Form
Max Z= 2X1 + 3 X2 + 4X3
Subject to
3X1 + X2 + 4X3+S1= 600
2X1 + 4 X2 + 2X3-S2=480
2X1 + 3 X2 + 3X3=540
X1 ,X2 ,X3, S1, S2≥0
Standard Form
Max Z= 2X1 + 3 X2 + 4X3-MA1-MA2
Subject to
3X1 + X2 + 4X3+S1= 600
2X1 + 4 X2 + 2X3-S2+A1=480  A1= -2X1 - 4 X2 - 2X3+S2+480
2X1 + 3 X2 + 3X3+A2=540 A2= -2X1 - 3 X2 - 3X3+540
X1 ,X2 ,X3, S1, S2, A1, A2≥0

Z= 2X1 + 3 X2 + 4X3-MA1-MA2
= 2X1 + 3 X2 + 4X3-M(-2X1 - 4 X2 - 2X3+S2+480 )-M(-2X1 - 3 X2 - 3X3+540)
= X1 ( 2+2M+2M) + X2(3+4M+3M)+X3(4+2M+3M)-MS2+(-480M-540M)
= X1 ( 2+4M) + X2(3+7M)+X3(4+5M)-MS2-1020M
Z - ( 2+4M) X1 - (3+7M) X2 - (4+5M) X3+MS2=-1020M
Basic X1 X2 X3 s1 s2 A1 A2 Solution Ratio

Z -(2+4M) - (3+7M) - (4+5M)

0 M 0 0 -1020M

s1 3 1 4 1 0 0 0 600
A1 2 4 2 0 -1 1 0 480
A2 2 3 3 0 0 0 1 540
Basic X1 X2 X3 s1 s2 A1 A2 Solution Ratio

Z -(2+4M) - (3+7M) - (4+5M)

0 M 0 0 -1020M

s1 3 1 4 1 0 0 0 600 600/1=600
A1 2 4 2 0 -1 1 0 480 480/4=120
A2 2 3 3 0 0 0 1 540 540/3=180
Basic X1 X2 X3 s1 s2 A1 A2 Solution Ratio

Z -(1+M)/2 0 - (5+3M)/2
0 - (3+3M)/4
0 360-
(3+7M)/4

180M

s1 5/2 0 7/2 1 ¼ -¼ 0 480

X2 ½ 1 ½ 0 -¼ ¼ 0 120
A2 ½ 0 3/2 0 ¾ -¾ 1 180
Basic X1 X2 X3 s1 s2 A1 A2 Soluti Ratio
on
Z -(1+M)/2 0 - (5+3M)/2
0 - (3+3M)/4 (3+7M)/4
0 360-
180M
s1 5/2 0 7/2 1 ¼ -¼ 0 480 480/(7/2)=137
X2 ½ 1 ½ 0 -¼ ¼ 0 120 120/(1/2)=240
A2 ½ 0 3/2 0 ¾ -¾ 1 180 180/(3/2)=120
Basic X1 X2 X3 s1 s2 A1 A2 Soluti Ratio
on
Z 1/3 0 0 0 ½ 660
(-2+4M)/4 (5+3M)/
3

s1 4/3 0 0 1 -3/2 3/2 7/3 60

X2 1/3 1 0 0 -½ ½ - 1/3 60
x3 1/3 0 1 0 ½ -½ 2/3 120
Since all the Z coefficients are positive the solution is optimal
The Optimal Solution is
Max Z= 660
X1=0
X2= 60
X3=120
 Basic X1 X2 X3 s1 s2 A1 A2 Solution Ratio

Z -(2+4M) - - (4+5M) 0 M 0 0 -1020M --

(3+7M)

s1 3 1 4 1 0 0 0 600 600/1=600
A1 2 4 2 0 -1 1 0 480 480/4=120(min)
A2 2 3 3 0 0 0 1 540 540/3=180
Z -(1+M)/2 0 - (5+3M)/2
0 - (3+3M)/4 (3+7M)/
4
0 360- --
180M
s1 5/2 0 7/2 1 ¼ -¼ 0 480 480/(7/2)=137
X2 ½ 1 ½ 0 -¼ ¼ 0 120 120/(1/2)=240
A2 ½ 0 3/2 0 ¾ -¾ 1 180 180/(3/2)=120(min)

Z 1/3 0 0 0 ½ (- (5+3M)/ 660

2+4M)/ 3
4

s1 4/3 0 0 1 -3/2 3/2 7/3 60

X2 1/3 1 0 0 -½ ½ - 1/3 60

x3 1/3 0 1 0 ½ -½ 2/3 120

Min Z= 4X1 + X2
Subject to
3X1 + X2 = 3
4X1 + 3 X2 ≥6
X1 + 2 X2 ≤ 4
X1 ,X2 ≥0

Standard Form
Min Z= 4X1 + X2
Subject to
3X1 + X2 = 3
4X1 + 3 X2 –S1=6
X1 + 2 X2 +S2=4
X1 ,X2 ,X3, S1, S2≥0
Big M Method
Min Z= 4X1 + X2 +M A1+ MA2
Subject to
3X1 + X2 +A1 = 3
4X1 + 3 X2 –S1+A2=6
X1 + 2 X2 +S2=4
X1 ,X2 ,X3, S1, S2 , A1 , A2 ≥0

Min Z= 4X1 + X2 +M A1+ MA2

Subject to
3X1 + X2 +A1 = 3  A1 = 3- 3X1- X2
4X1 + 3 X2 –S1+A2=6  A2= 6 -4X1 - 3 X2 +S1
X1 + 2 X2 +S2=4
X1 ,X2 ,X3, S1, S2 , A1 , A2 ≥0
Min Z= 4X1 + X2 +M A1+ MA2
Z= 4X1 + X2 +M (3- 3X1- X2)+M(6 -4X1 - 3 X2 +S1)
Z=X1(-7M+4) + X2(-4M+1)+MS1+9M
Z+ X1 (7M-4) + X2(4M-1)-MS1 = 9M
Basic X1 X2 s1 s2 A1 A2 Solution Ratio

Z (7M-4) (4M-1) -M 0 0 0 9M
A1 3 1 0 0 1 0 3
A2 4 3 -1 0 0 1 6
S2 1 2 0 1 0 0 4
Basi X1 X2 s1 s2 A1 A2 Solution Ratio
c
Z (7M-4) (4M-1) -M 0 0 0 9M -
A1 3 1 0 0 1 0 3 3/3=1
(min)
A2 4 3 -1 0 0 1 6 6/4=1.5
S2 1 2 0 1 0 0 4 4/1=4
Basic X1 X2 s1 s2 A1 A2 Solution Ratio

Z 0 (5M+1)/3 -M 0 (-7M+4)/3 0 2M+4

X1 1 1/3 0 0 1/3 0 1
A2 0 5/3 -1 0 -4/3 1 2
S2 0 5/3 0 1 -1/3 0 3
Basic X1 X2 s1 s2 A1 A2 Solution Ratio

Z 0 (5M+1)/3 -M 0 (-7M+4)/3 0 2M+4 --

X1 1 1/3 0 0 1/3 0 1 1/(1/3)=3

A2 0 5/3 -1 0 -4/3 1 2 2/(5/3)=6/5
S2 0 5/3 0 1 -1/3 0 3 3/(5/3)=9/5
Basic X1 X2 s1 s2 A1 A2 Solution Ratio

Z 0 0 1/5 0 (-5M+8)/5 -(5M+1)/5 18/5

X1 1 0 1/5 0 3/5 -1/5 3/5
X2 0 1 -3/5 0 -4/5 3/5 6/5
S2 0 0 1 1 1 -1 1
Basic X1 X2 s1 s2 A1 A2 Solution Ratio

Z 0 0 1/5 0 (-5M+8)/5 -(5M+1)/5 18/5 ---

X1 1 0 1/5 0 3/5 -1/5 3/5 (3/5)/(1/5)=3
X2 0 1 -3/5 0 -4/5 3/5 6/5 ---
S2 0 0 1 1 1 -1 1 1/1=1 (min)
 Basic X1 X2 s1 s2 A1 A2 Solution Ratio

Z 0 0 0 -1/5 (-5M+7)/5 -M 17/5

X1 1 0 0 -1/5 2/5 0 2/5
X2 0 1 0 3/5 -1/5 0 9/5
S1 0 0 1 1 1 -1 1

Since all the Z coefficients are negative the solution is optimal

The Optimal Solution is
Min Z= 17/5
X1=2/5
X2= 9/5
Max Z= 2X1 + 3 X2 + 4X3
Subject to
3X1 + X2 + 4X3≤ 600
2X1 + 4 X2 + 2X3≥480
2X1 + 3 X2 + 3X3=540
X1 ,X2 ,X3≥0

Max Z= 2X1 + 3 X2 + 4X3

Subject to
3X1 + X2 + 4X3+S1= 600
2X1 + 4 X2 + 2X3-S2+A1=480
2X1 + 3 X2 + 3X3+A2=540
X1 ,X2 ,X3, S1, S2, A1, A2≥0
Two Phase Method
Phase I
New objective function Min P=(Sum of artificial variables)
Subject to

Given Constraints
Max Z= 2X1 + 3 X2 + 4X3
Subject to
3X1 + X2 + 4X3+S1= 600
2X1 + 4 X2 + 2X3-S2+A1=480
2X1 + 3 X2 + 3X3+A2=540
X1 ,X2 ,X3, S1, S2, A1, A2≥0
Two Phase Method
Phase 1
Min p= A1+A2
3X1 + X2 + 4X3+S1= 600
2X1 + 4 X2 + 2X3-S2+A1=480  A1= -2X1 - 4 X2 - 2X3+S2+480
2X1 + 3 X2 + 3X3+A2=540 A2= -2X1 - 3 X2 - 3X3+540
X1 ,X2 ,X3, S1, S2, A1, A2≥0
P =A1+A2
P = (-2X1 - 4 X2 - 2X3+S2+480 ) +(-2X1 - 3 X2 - 3X3+540)
P =- 4X1 - 7 X2 - 5X3+S2+1020
P+ 4X1 + 7 X2 + 5X3-S2 =1020
Subject to
3X1 + X2 + 4X3+S1= 600
2X1 + 4 X2 + 2X3-S2+A1=480
2X1 + 3 X2 + 3X3+A2=540
X1 ,X2 ,X3, S1, S2, A1, A2≥0
Basic X1 X2 X3 s1 s2 A1 A2 Solution Ratio

P 4 7 5 0 -1 0 0 1020

s1 3 1 4 1 0 0 0 600
A1 2 4 2 0 -1 1 0 480
A2 2 3 3 0 0 0 1 540
Basic X1 X2 X3 s1 s2 A1 A2 Solution Ratio

P 4 7 5 0 -1 0 0 1020

s1 3 1 4 1 0 0 0 600 600/1=600
A1 2 4 2 0 -1 1 0 480 480/4=120(min)
A2 2 3 3 0 0 0 1 540 540/3=180
Basic X1 X2 X3 s1 s2 A1 A2 Solution Ratio

P 1/2 0 3/2 0 3/4 -7/4 0 180

s1 5/2 0 7/2 1 ¼ -¼ 0 480

X2 ½ 1 ½ 0 -¼ ¼ 0 120
A2 ½ 0 3/2 0 ¾ -¾ 1 180
Basic X1 X2 X3 s1 s2 A1 A2 Solution Ratio

P 1/2 0 3/2 0 3/4 -7/4 0 180 --

s1 5/2 0 7/2 1 ¼ -¼ 0 480 480/(7/2)=137
X2 ½ 1 ½ 0 -¼ ¼ 0 120 120/(1/2)=240
A2 ½ 0 3/2 0 ¾ -¾ 1 180 180/(3/2)=120(min)
Basic X1 X2 X3 s1 s2 A1 A2 Solution Ratio

P 0 0 0 0 0 -1 -1 0

s1 4/3 0 0 1 -3/2 3/2 7/3 60

X2 1/3 1 0 0 -½ ½ - 1/3 60
X3 1/3 0 1 0 ½ - ½ 2/3 120

Since, at the optimal Iteration the min p=0 , the given problem
has a solution goto Phase-II
Phase II

Given Objective Function

Subject to

New Constraint from the optimal iteration of Phase I by

eliminating the Artificial Variables.
Phase II

Basic X1 X2 X3 s1 s2 A1 A2 Solution

P 0 0 0 0 0 -1 -1 0

s1 4/3 0 0 1 -3/2 3/2 7/3 60

X2 1/3 1 0 0 -½ ½ - 1/3 60
X3 1/3 0 1 0 ½ - ½ 2/3 120
New Constraints
4/3 X1 +S1 -3/2S2=60
1/3 X1 + X2 -1/2 S2=60
1/3 X1 +X3 +1/2S2=120
Max Z= 2X1 + 3 X2 + 4X3
Subject to Constraints
4/3 X1 +S1 -3/2S2=60
1/3 X1 + X2 -1/2 S2=60
1/3 X1 +X3 +1/2S2=120
X1 ,X2 ,X3, S1, S2≥0
Max Z= 2X1 + 3 X2 + 4X3
Subject to Constraints
4/3 X1 +S1 -3/2S2=60
1/3 X1 + X2 -1/2 S2=60
1/3 X1 +X3 +1/2S2=120
X1 ,X2 ,X3, S1, S2≥0
Basic X1 X2 X3 s1 s2 Solution

Z -2 -3 -4 0 0 0

s1 4/3 0 0 1 -3/2 60
X2 1/3 1 0 0 -½ 60
X3 1/3 0 1 0 ½ 120
Max Z= 2X1 + 3 X2 + 4X3
Subject to Constraints
4/3 X1 +S1 -3/2S2=60
1/3 X1 + X2 -1/2 S2=60  X2 = 60 -1/3 X1 +1/2 S2
1/3 X1 +X3 +1/2S2=120  X3 = 120 -1/3 X1 -1/2S2
X1 ,X2 ,X3, S1, S2≥0
Max Z= 2X1 + 3 X2 + 4X3
=2X1+3(60 -1/3 X1 +1/2 S2 )+4(120 -1/3 X1 -1/2S2 )
=X1(2+ {3*-1/3} +{4*-1/3}) + S2(3*1/2-4*1/2)+(3*60+4*120)
Z=-1/3X1 -1/2 S2+ 660

Z+1/3X1 +1/2 S2= 660

 Z+1/3X1 +1/2 S2= 660

Basic X1 X2 X3 s1 s2 Solution

Z 1/3 0 0 0 ½ 660

s1 4/3 0 0 1 -3/2 60
X2 1/3 1 0 0 -½ 60
X3 1/3 0 1 0 ½ 120
Since all the Z coefficients are positive the solution is optimal
The Optimal Solution is
Max Z= 660
X1=0
X2= 60
X3=120
Solve Min Z= 4X1 + X2
Subject to
3X1 + X2 = 3
4X1 + 3 X2 ≥6
X1 + 2 X2 ≤ 4
X1 ,X2 ≥0

Standard Form
Min Z= 4X1 + X2
Subject to
3X1 + X2 +A1 = 3
4X1 + 3 X2 –S1+A2=6
X1 + 2 X2 +S2=4
X1 ,X2 ,X3, S1, S2 , A1 , A2 ≥0
Two Phase Method
Phase I
Min P= A1+ A2
Subject to
3X1 + X2 +A1 = 3
4X1 + 3 X2 –S1+A2=6
X1 + 2 X2 +S2=4
X1 ,X2 ,X3, S1, S2 , A1 , A2 ≥0
Min P= A1+ A2
Subject to
3X1 + X2 +A1 = 3  A1 = 3- 3X1- X2
4X1 + 3 X2 –S1+A2=6  A2= 6 -4X1 - 3 X2 +S1
X1 + 2 X2 +S2=4
X1 ,X2 ,X3, S1, S2 , A1 , A2 ≥0

P= (3- 3X1- X2)+ (6 -4X1 - 3 X2 +S1)

P=X1(-3-4) + X2(-1-3)+S1+9
P+7 X1 + 4 X2-S1 = 9
Basic X1 X2 s1 s2 A1 A2 Solution Ratio

P 7 4 -1 0 0 0 9
A1 3 1 0 0 1 0 3
A2 4 3 -1 0 0 1 6
S2 1 2 0 1 0 0 4
Basic X1 X2 s1 s2 A1 A2 Solution Ratio

P 7 4 -1 0 0 0 9 -
A1 3 1 0 0 1 0 3 3/3=1(min)
A2 4 3 -1 0 0 1 6 6/4=1.5
S2 1 2 0 1 0 0 4 4/1=4
Basic X1 X2 s1 s2 A1 A2 Solution Ratio

P 0 5/3 -1 0 -7/3 0 2
X1 1 1/3 0 0 1/3 0 1
A2 0 5/3 -1 0 -4/3 1 2
S2 0 5/3 0 1 -1/3 0 3
Basic X1 X2 s1 s2 A1 A2 Solution Ratio

P 0 5/3 -1 0 -7/3 0 2 --
X1 1 1/3 0 0 1/3 0 1 1/(1/3)=3
A2 0 5/3 -1 0 -4/3 1 2 2/(5/3)=6/5(m
S2 0 5/3 0 1 -1/3 0 3 3/(5/3)=9/5
Basic X1 X2 s1 s2 A1 A2 Solution Ratio

P 0 0 0 0 -1 -1 0
X1 1 0 1/5 0 3/5 -1/5 3/5
X2 0 1 -3/5 0 -4/5 3/5 6/5
S2 0 0 1 1 1 -1 1

Since, at the optimal Iteration the min p=0 , the given problem
has a solution goto Phase-II
 Basic X1 X2 s1 s2 A1 A2 Solution Ratio

P 0 0 0 0 -1 -1 0
X1 1 0 1/5 0 3/5 -1/5 3/5
X2 0 1 -3/5 0 -4/5 3/5 6/5
S2 0 0 1 1 1 -1 1
Phase II
Min Z= 4X1 + X2
Subject To
X1+1/5 S1 = 3/5
X2-3/5 S1=6/5
S1+S2=1
X1,X2 ,S1,S2≥0
Phase II
Min Z= 4X1 + X2
Subject To
X1+1/5 S1 = 3/5  X1 = 3/5 - 1/5 S1
X2-3/5 S1=6/5  X2 = 6/5 +3/5 S1
S1+S2=1
X1,X2 ,S1,S2≥0

Min Z= 4X1 + X2
Z = 4( 3/5 - 1/5 S1 ) + (6/5 +3/5 S1 )
Z= S1(-4/5+3/5) + (12/5+6/5)
Z= -1/5 S1 + 18/5
Z+1/5 S1 = 18/5
Basic X1 X2 s1 s2 Solution Ratio
Z 0 0 1/5 0 18/5
X1 1 0 1/5 0 3/5
X2 0 1 -3/5 0 6/5
S2 0 0 1 1 1
Basic X1 X2 s1 s2 Solution Ratio
Z 0 0 1/5 0 18/5 ---
X1 1 0 1/5 0 3/5 (3/5)/(1/5)=3
X2 0 1 -3/5 0 6/5 ---
S2 0 0 1 1 1 1/1=1 (min)
Basic X1 X2 s1 s2 Solution Ratio
Z 0 0 0 -1/5 17/5
X1 1 0 0 -1/5 2/5
X2 0 1 0 3/5 9/5
S1 0 0 1 1 1
Since all the Z coefficients are negative the solution is optimal
The Optimal Solution is
Min Z= 17/5
X1=2/5
X2= 9/5
Degenerate Optimal Solution
Max Z=3 X1 +9 X2
Subject to
X1 +4 X2 ≤ 8
X1 + 2 X2 ≤ 4
X1 ,X2 ≥0
Basic X1 X2 s1 s2 Solution Ratio
Z -3 -9 0 0 0 -
S1 1 4 1 0 8 8/4=2
S2 1 2 0 1 4 4/2=2
Z -3/4 0 9/4 0 18
X2 ¼ 1 ¼ 0 2
S2 ½ 0 -1/2 1 0
Z 0 0 3/2 3/2 18
X2 0 1 ½ -1/2 2
X1 1 0 -1 2 0