Scribd
Upload
90 views15 pages

X X X X: Minimize Subject To The Constraints

The document describes solving a linear programming problem using the two-phase method. In phase I, artificial variables are added to convert inequalities to equations. The optimal solution to phase I is used as the starting point for phase II, which directly solves the original problem. The process is demonstrated on two examples, finding the optimal values are 102 for the first example and 50 for the second.

Uploaded by

Potnuru Vinay
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 PPT, PDF, TXT or read online on Scribd
90 views15 pages

X X X X: Minimize Subject To The Constraints

The document describes solving a linear programming problem using the two-phase method. In phase I, artificial variables are added to convert inequalities to equations. The optimal solution to phase I is used as the starting point for phase II, which directly solves the original problem. The process is demonstrated on two examples, finding the optimal values are 102 for the first example and 50 for the second.

Uploaded by

Potnuru Vinay
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 PPT, PDF, TXT or read online on Scribd
You are on page 1/ 15

Minimize

z 5 x1 7 x2

Subject to the constraints

2 x1 3 x2 42
3 x1 4 x2 60
x1 x2 18
x1 , x2 0
We shall solve this problem by two phase
method.

Phase I:
Minimize

r R1 R2 R3

Subject to the constraints


2 x1 3 x2 s1
3 x1 4 x2
x1

x2

R1
s2
s3

42
R2

60

R3 18

x1 , x2 , s1 , s2 , s3 , R1 , R2 , R3 0

Here s1,s2,s3 are surplus variables; R1,R2,R3


are artificial variables.

Basic r
r

x1
6
0

x2
8
0

s1
-1
0

s2
-1
0

s3
-1
0

R1
0
-1

R2
0
-1

R3
0
-1

Sol
120
0

R1

-1

42

R2

-1

60

R3

-1

18

2/3

5/3

-1

-1

-8/3

x2

2/3

-1/3

1/3

14

R2

1/3

4/3

-1

-4/3

R3

1/3

1/3

-1

-1/3

Basic r

x1

x2

s1

s2

s3

R1

R2

2/3

5/3

-1

-1 -8/3

x2

2/3

-1/3

1/3

14

R2

1/3

4/3

-1

-4/3

R3

1/3

1/3

-1 -1/3

1/4

1/4

-1

-1

-5/4

x2

-1/4

1/4

15

s1

1/4

-3/4

-1

3/4

R3

1/4

1/4

-1

-1/4

3/4

R3

Sol

Basic r

x1

x2

s1

s2

s3

R1

R2

R3

Sol

1/4

1/4

-1

-1

-5/4

x2

3/4

-1/4

1/4

15

s1

1/4

-3/4

-1

3/4

R3

1/4

1/4

-1

-1/4

-1

-1

-1

x2

-1

-3

s1

-1

-1

-1

x1

-4

-1

12

This is optimal tableau. Thus Phase I has


ended and we now start Phase II with the
starting BFS as the optimal solution of
Phase I.
Phase II:
Minimize z 5 x1 7 x2
subject to the same constraints as given
in the original problem.

Basic z
z

x1
0
-5

x2
0
-7

s1
0
0

s2
-2
0

s3
1
0

R1

R2

R3

Sol
102
0

x2

-1

s1

-1

x1

-4

12

-1

-1

102

x2

-3

s3

-1

x1

-3

12

This is the optimal tableau.


Optimal solution: x1 = 12, x2 = 6
Optimal value : z = 102

Consider the LPP:


Minimize

z 2 x1 5 x2 3 x3

Subject to the constraints

x1 2 x2 x3 20
2 x1 4 x2 x3 50
x1 , x2 , x3 0

Phase I:
Minimize

r R1 R2

Subject to the constraints

x1 2 x2 x3 s1 R1
2 x1 4 x2 x3

20
R2 50

x1 , x2 , x3 , s1 , R1 , R2 0
Here s1 is a surplus variable; R1,R2 are
artificial variables.

Basic r

x1

x2

x3

s1

R1

R2

Sol

2
0

2
0

-1
0

0
-1

0
-1

70
0

3
0

R1

-2

-1

20

R2

50

-1

-3

10

x1

-2

-1

20

R2

-1

-2

10

Basic r

x1

x2

x3

s1

R1

R2

Sol

-1

-3

10

x1

-2

-1

20

R2

-1

-2

10

-1

-1

x1

3/4

-1/2

1/2

1/4

45/2

x2

-1/8

1/4

-1/4

1/8

5/4

This is optimal tableau. Thus Phase I has


ended and we now start Phase II with the
starting BFS as the optimal solution of
Phase I.
Phase II:
Minimize

z 2 x1 5 x2 3 x3

subject to the same constraints as given


in the original problem.

Basic z

x1

x2

x3

s1

R1

R2

Sol

0
-2

0
-5

-17/8
-3

1/4
0

205/4
0

x1

3/4

-1/2

45/2

x2

-1/8

1/4

5/4

-1

-2

50

x1

1/2

25

s1

-1/2

Thus the optimal solution is : x1 = 25, x2 = 0, x3 = 0

And the optimal z = Min z = 50.

Minimize

z 2 x1 3x2 x3

Subject to the constraints

x1 4 x2 2 x3 8
3 x1 2 x2

x1 , x2 , x3 0
Ans: Optimal Solution: x1 = 4/5, x2 = 9/5, x3 = 0
Optimal value: z = 7

You might also like