Maximize 6X+5y X+y<=5 3X+2Y<=12 X,Y>=0 Step 1: Remove Inequality by introducing Slack variables & Artificial Variables

Now, Maximize 6X+5Y+0S1+0S2

{ where equality of greater than e

X+Y+S1=5 3X+2Y+S2=12 X,Y>=0 Step 2: Basis S1 S2 Cj Zj Cj-Zj Form the Initial Table with the help of above equations Solution 0 0 X 1 3 6 0 6 Y 1 2 5 0 5 S1 1 0 0 0 0 S2 0 1 0 0 0 Bi 5 12 0 Bi/Aij 5 4

Key Column (Maximum of Cj-Zj will be considered as Key column and in case of minimization Minimum of Cj-Zj) Step3: Basis S1 X Cj Zj Cj-Zj Prepare New tableau for obtaining the Optimum Solution Solution 0 6 X Y S1 0 1/3 1 2/3 6 5 6 4 0 1 Key Column S2 1 -1/3 0 1/3 0 0 0 Bi 1 4 0 2 -2 24 Bi/Aij 3 Key row 6

For Calculating S1 row figures:

Old Row Figures - Key Element of Key column of Row * New key row figures Figures of New Key New S1 row row 1 0 2/3 1/3 0 1 1/3 -1/3 4 1

Old row Key element Variables Figures X 1 Y 1 S1 1 S2 0 Bi 5

1 1 1 1 1

Step 4 : Basis Y X Cj Zj Cj-Zj

Repeat Step 3 Solution 5 6 X 0 1 6 6 0 Y 1 0 5 5 0 S1 3 -2 0 3 -3 S2 -1 1 0 1 -1 Bi 3 2 27 Bi/Aij

Hence, All figures are negative o Solution where Profit will be ma

For Calculating X row figures: Old row Key element Variables Figures X 1 2/3 Y 2/3 2/3 S1 0 2/3 S2 1/3 2/3 Bi 4 2/3 New Key row 0 1 3 -1 3 Figures of New X row 1 0 -2 1 2

Maximization problem { where equality of greater than exists, artificial variables are introduced Minimization Problem

Basic Variables (also reflects the Product to be produced to obtain maximum profit)

Key Row (Minimum of Bi/Aij will be taken as key row

Key Element ( the figure by which whole row will be divided to obtain the new row figures)

minimization Minimum of Cj-Zj)

Hence, All figures are negative or zero, it can be said that optimum table is obtained Solution where Profit will be maximum is where X=2 units & Y=3 Units and Z=6*2+5*3 = 27

on problem

In objective function +MA1 is introduced because Maximum value of artificial value will make artificial variable to be get replaced by other variables i.e. X,Y,Z In objective function (-)MA1 is introduced

Minimize 1.5X+0.7Y 3X+5Y>=180 4X+6Y>=220 X,Y>=0 Step 1: Remove inequality by introducing Slack and Artificial Variables

Minimize 1.5X+0.7Y+0S1+0S2-MA1-MA2 3X+5Y-S1+A1=180 4X+6Y-S2+A2=220 X,Y,S1,S2,A1,A2>=0 Step 2: Basis A1 A2 Cj Zj Cj-Zj Formulate the above equation into a Tableau Solution M M X 3 4 1.5 7M 1.5-7M Y 5 6 0.7 11M 0.7-11M -M M S1 -1 0 0

Reason of (-)ve M is because this is a minimization problem a be the maximum figure so by deducting maximum figure fr function we can minimize the cost

S2

A1 0 -1 0M M 1 0

A2 0 1 M M 0 0

Bi 180 220

-M M

Key Column ( Most (-)ve figure in Cj-Zj is to be considered as key Column)

Step 3: Basis Y A2 Cj Zj Cj-Zj

Next Tableau will be prepared as in the initial table Cj-Zj has some (-) figures Solution X 0.7 3/5 M 2/5 1.5 2.1/5+2/5M 5.4/5-2/5M Y S1 S2 1 -1/5 0 6/5 0.7 0 0.7 -0.7/5+6/5M -M 0 0.7/5-6/5M M Key Column A1 A2 0 1/5 -1 -6/5 0M M -0.7/5-6/5M M 0.7/5+11/5M Bi 0 1 36 4

For Calculating A2 row figures: Old Row Figures - Key Element of Key column of Row * New key row figures

Old row Variables Figures

New Key Key element row

Figures of New A2 row

X Y S1 S2 A1 A2 Bi Step 4 Basis Y S1 Cj Zj Cj-Zj

4 6 0 -1 0 1 220

6 3/5 6 6 -1/5 6 6 1/5 6 6

2/5 1 6/5 0 -6/5 0 36 1 4 -1 0

Next Tableau for optimum Solution Solution X 0.7 2/3 0 1/3 1.5 1.4/3 3.1/3 Y 1 0 0.7 0.7 0 S1 S2 0 -1/6 1 -5/6 0 0 -0.7/6 0 0.7/6 A1 A2 0 1/6 -1 5/6 M 0 0.7/6 M-0.7/6 Bi 220/6 20/6

0M M

For Calculating Y row figures:

Old row Variables Figures X 3/5 Y 1 S1 -1/5 S2 0 A1 1/5 A2 0 Bi 36

New Key Key element row -1/5 1/3 -1/5 0 -1/5 1 -1/5 -5/6 -1/5 -1 -1/5 5/6 -1/5 20/6

Figures of New A2 row 2/3 1 0 -1/6 0 1/6 220/6

Dual of Problem Maximize 180X1+220Y1 3X1+4Y1<=1.5 5X1+6Y1<=0.7 X1,Y1>=0 After that solution will be done as a maximize problem

a minimization problem and M is assumed to ucting maximum figure from the objective can minimize the cost

Bi/Aij 36 36.7 Key Row (minimum of Bi/Aij)

Bi/Aij 180 3.3 Key Row 7/10

Bi/Aij

all Cj-Zj are positive or Zero, Hence optimum tableau is obtained Solution would be X=0 Units,Y=220/6 units, Z=0.7*220/6 = 25.67

Degeneracy Unbounded Multiple Optimal Solution Infeasible solution Optimum Solution

Degeneracy exists in those problem where Bi/Aij has a tie between two entries or t

In case Bi/Aij has all negative or Indefinite figure then the problem is called Unboun In case any non basic variable which does not comes under the head Basis has the

In case in the optimum Solution Table, artificial variable is coming under the head B Maximization problem

All Cj-Zj should have to be

Minimization Problem

All Cj-Zj should have to be

e between two entries or the optimum solution (Z) are same for two consequetive tables problem is called Unbounded problem

er the head Basis has the Cj-Zj value equal to Zero than the problem is said to have multiple optimal solution

s coming under the head Basis then it is said to be infeasible solution All Cj-Zj should have to be (-)ve or Zero

All Cj-Zj should have to be (+)ve or Zero