Scribd
Upload
41 views

B.V. X1 x2 S1 S2 A1 A2 RHS MRT Z S1 A1

The document describes solving a linear programming problem using the simplex method. It provides the original minimization problem, converts it to standard form by introducing slack and surplus variables and converting it to a maximization problem. The simplex algorithm is then applied, showing the initial basic feasible solution and pivot steps to arrive at the optimal solution. It also describes solving the dual problem and finding the dual optimal solution to verify strong duality.

Uploaded by

dheerajgulati_31
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
41 views

B.V. X1 x2 S1 S2 A1 A2 RHS MRT Z S1 A1

The document describes solving a linear programming problem using the simplex method. It provides the original minimization problem, converts it to standard form by introducing slack and surplus variables and converting it to a maximization problem. The simplex algorithm is then applied, showing the initial basic feasible solution and pivot steps to arrive at the optimal solution. It also describes solving the dual problem and finding the dual optimal solution to verify strong duality.

Uploaded by

dheerajgulati_31
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

SOL 1:- Min Z= 2x1 + 3x2

S.t. 2x1 +3x2 <=4


x1 + 3x2 >=36
x1 +3x2=10
x1, x2>=0
Convert them into standard equations. We introduce slack, surplus as well as artificial variables.
And convert the problem of minimization into maximization.
Max Z +2x1 +3x2 + MA1 +MA2
S.t. 2x1 + 3x2 +s1=4
x1 + 3x2 s2 + A1 = 36
x1 +3x2 + A2 = 10
x1, x2, s1, s2, A1, A2>=0
Now,
B.V.

x1

x2

S1

S2

A1

A2

RHS

S1

-2

-3

-1

A1

-1

36

A2

10

To find Z row
( 2 3 0 0 M M 0)
-M( 1 3 0 -1 1 0 36)
-M(1 3 0 0 0 1 10)
(2-2M 3-6M 0 M 0 0 -46M)

MRT

Iteration Table 1
BASIS
Z
S1
A1
A2

X1
2-2M
2
1
1

X2
3-6M
3
3
3

S1
0
1
0
0

S2
M
0
-1
0

A1
0
0
1
0

A2
0
0
0
1

RHS
-46M
4
36
10

MRT

BASIS
Z
X2
A1
A2

X1
2M
2/3
-1
-1

X2
0
1
0
0

S1
2M-1
1/3
-1
-1

S2
M
0
-1
0

A1
0
0
1
0

A2
0
0
0
1

RHS
26M-36
4/3
32
6

MRT

1.3
12
3.3

Solu.2 The dual of the equation is given by:

Min. Z =36y1+7y2+10y3

s.t :- y1+y2+y324
3y1+y2+3y360
Y1,y20
Basis
S1
S2
Z

Y1
1
3
-36

Minimizing ratio :24/1=24


60/3=20

Y2
1
1
-7

Y3
1
3
-10

S1
1
0
0

S2
0
1
0

RHS
24
60
0

BASIS
S1
Y1
Z

Y1
0
1
0

Solution , Y1=20
Y2=0
Y3=0
Max. Z=720
DUAL:- X1=0
X2=12
MIM. Z=720

Y2
2/3
1/3
5

Y3
0
1
26

S1
1
0
0

S2
-1/3
1/3
12

RHS
4
20
720

You might also like