[go: up one dir, main page]
Scribd
Upload
107 views3 pages

Assignment 1 (Group Assignment)

The document describes an LP problem to maximize Z = 3/4x1 - 150x2 + 1/50x3 - 6x4, subject to 4 constraints. The problem is solved using the simplex method in 5 iterations to find the optimal solution of Z* = 0.05, with X1 = 0.04, X2 = 0, X3 = 1, X4 = 0. The summary shows the key steps and optimal values without all the intermediate simplex table details.

Uploaded by

Sudarshan Kumar
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
107 views3 pages

Assignment 1 (Group Assignment)

The document describes an LP problem to maximize Z = 3/4x1 - 150x2 + 1/50x3 - 6x4, subject to 4 constraints. The problem is solved using the simplex method in 5 iterations to find the optimal solution of Z* = 0.05, with X1 = 0.04, X2 = 0, X3 = 1, X4 = 0. The summary shows the key steps and optimal values without all the intermediate simplex table details.

Uploaded by

Sudarshan Kumar
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/ 3

Assignment 1 (Group assignment)

Group No. Roll No. Name


20BM6JP02 Abhinav Ranjan
3 20BM6JP23 Sudarshan Kumar
20BM6JP32 Saurav Rajput

1. Consider the following LP allocation model:


Maximize Z =3/4 x1 -150 x2 +1/50 x3 -6 x4
Subject to
1/4 x1 -60 x2 -1/25 x3 +9 x4≤ 0
1/2 x1 -90 x2 -1/50 x3 +3 x4≤ 0
x3≤ 1
x1, x2, x3, x4 ≥ 0

Solve the problem using simplex method. Show all the pertinent steps and tables.

Answer: Part 1
Objective: Maximize Z = 3/4 x1 -150 x2 +1/50 x3 -6 x4

Subject to:
1/4 x1 -60 x2 -1/25 x3 +9 x4≤ 0 (resource 1)
1/2 x1 -90 x2 -1/50 x3 +3 x4≤ 0 (resource 2)
4 x3 ≤1 (resource 3)
x1, x2, x3, x4 ≥ 0
Introducing slack variable x5, x6 and x7 to convert inequality constraints into equality.
1/4 x1 -60 x2 -1/25 x3 +9 x4 + 1X5 + 0X6 + 0X7 = 0
1/2 x1 -90 x2 -1/50 x3 +3 x4 + 0X5 + 1X6 + 0X7 = 0
X3 + 0X5 + 0X6 + 1X7 = 1

Initial Basic Feasible Solution: x1 = 0, x2 = 0, x3 = 12, x4 = 8, x5 = 8 , Z= 0

BV X1 X2 X3 X4 X5 X6 X7 Bi MRT
X5 0.25 -60 -.04 9 1 0 0 0 0
X6 0.5 -90 -.02 3 0 1 0 0 0
X7 0 0 1 0 0 0 1 1
Z -0.75 150 -0.02 6 0 0 0 0
(MRT = Minimum ratio test)
Entering basic variable = x1
Leaving basic variable = Tie between X5 and X6 and breaking the tie arbitrarily by choosing X5 as leaving
variable
The pivot element is 0.25
Iteration 1

BV X1 X2 X3 X4 X5 X6 X7 Bi MRT
X1 1 -240 -0.16 36 4 0 0 0 0
X6 0 30 0.06 -15 -2 1 0 0 0
X7 0 0 1 0 0 0 1 1
Z 0 -30 -0.14 33 3 0 0

Entering basic variable = x2


Leaving basic variable = Tie between X1 and X6 and breaking the tie arbitrarily by choosing X6 as leaving
variable.
The pivot element is 30
Iteration 2

BV X1 X2 X3 X4 X5 X6 X7 Bi MRT
X1 1 0 0.32 -84 -12 8 0 0 0
X2 0 1 0.002 -1/2 -1/15 1/30 0 0 0
X7 0 0 1 0 0 0 1 1
Z 0 0 -0.08 18 1 1 0 0

Entering basic variable = x3


Leaving basic variable = Tie between X1 and X2 and breaking the tie arbitrarily by choosing X2 as leaving
variable.
The pivot element is 0.002
Iteration 3

BV X1 X2 X3 X4 X5 X6 X7 Bi MRT
X1 1 -160 0 -4 -1.33 7.67 0 0
X3 0 500 1 -250 -33.33 16.67 0 0
X7 0 -500 0 250 33.33 -16.67 1 1 0.004
Z 0 40 0 -2 -1.67 2.33 0 0

Entering basic variable = x4


Leaving basic variable = X7
The pivot element is 250

Iteration 4
BV X1 X2 X3 X4 X5 X6 X7 Bi MRT
X1 1 -168 0 0 -0.8 2.4 0.016 0.016
X3 0 0 1 0 0 0 1 1
X4 0 -2 0 1 0.133 -0.067 0.004 0.004 0.03
Z 0 36 0 0 -1.4 2.2 0.008 0.008

Entering basic variable = x5


Leaving basic variable = X74
The pivot element is 0.133
Iteration 5

BV X1 X2 X3 X4 X5 X6 X7 Bi MRT
X1 1 -180 0 6 0 2 0.04 0.04 0
X3 0 0 1 0 0 0 1 1 0
X5 0 -15 0 7.5 1 -0.5 0.03 0.03
Z 0 15 0 10.5 0 1.5 0.05 0.05

Hence, the optimal solution is Z* =0.05


X1= 0.04, X2= 0, X3= 1, X4= 0

You might also like