Scribd
Upload
46 views21 pages

In This Presentation We Illustrate The Ideas Developed in The Previous Presentation With Two More Problems

The document describes solving two linear programming problems (LPPs) using the simplex method. For the first LPP, the starting simplex tableau is provided along with a partial final tableau. Missing entries in the final tableau are filled in by using the basic matrix and its inverse. For the second LPP, the problem is modified using the big M method by introducing artificial variables. The simplex tableau is constructed by using the basic matrix and its inverse to derive the constraint columns and RHS column. Entries in the objective function row are also derived. The final optimal tableau is presented.

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
46 views21 pages

In This Presentation We Illustrate The Ideas Developed in The Previous Presentation With Two More Problems

The document describes solving two linear programming problems (LPPs) using the simplex method. For the first LPP, the starting simplex tableau is provided along with a partial final tableau. Missing entries in the final tableau are filled in by using the basic matrix and its inverse. For the second LPP, the problem is modified using the big M method by introducing artificial variables. The simplex tableau is constructed by using the basic matrix and its inverse to derive the constraint columns and RHS column. Entries in the objective function row are also derived. The final optimal tableau is presented.

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/ 21

Consider the following LPP:

Maximize
1 2 3
6 2 z x x x = + +
Subject to
1 2 3
1 2 3
1 2 3
1 2 3
1
2 2 2
2
3
4 2 3
2
1
2 1
2
, , 0
x x x
x x x
x x x
x x x
+ + s
s
+ + s
>
Let x
4
, x
5
, x
6
denote the slack variables for the
respective constraints. So the starting simplex
tableau is
Basic z x1 x2 x3 x4 x5 x6 Sol
z
x4
x5
x6

1
0
0
0
-6
2
-4
1
-1
2
-2
2
-2
1/2
-3/2
1/2
0
1
0
0

0
0
1
0
0
0
0
1

0
2
3
1
After we apply the Simplex method a portion
of the final tableau is as follows:
Basic z x1 x2 x3 x4 x5 x6 Sol
z
x5
x3
x1

1
0
0
0
2
1
-2
1

0
1
0
0
2
2
4
-1


Identify the missing numbers.
We first observe that as x
1
is the 3rd
basic variable, the x
1
column in the
final tableau (including the objective
function row) will be

0
0
0
1
(
(
(
(
(

Similarly as x
3
is the 2nd basic
variable, the x
3
column in the final
tableau (including the objective
function row) will be
0
0
1
0
(
(
(
(
(

Basic Matrix is
0 1/ 2 2
1 3/ 2 4
0 1/ 2 1
B
(
(
=
(
(

Its inverse is
1
1 1 2
2 0 4
1 0 1
B

(
(
=
(
(


found below x
4
, x
5
, x
6
in the final tableau.
Hence the new x
2
column (in the constraint
equations) in the final tableau is
1
2
B A

=
1 1 2 2
2 0 4 2
1 0 1 2
( (
( (
=
( (
( (


4
4
0
(
(
(
(

Hence the new RHS column (in the
constraint equations) in the final tableau is
1
B b

=
1 1 2 2
2 0 4 3
1 0 1 1
( (
( (
=
( (
( (


7
0
1
(
(
(
(

The entry below x
2
in the z-row in the final
tableau is
2 2
z c =
1
2 2 B
c B A c

| |
2
4
0 2 6 4
0
c
(
(
= =
(
(

8 1 = 7
The new z-value in the final tableau is
1
B
c B b

=
| |
7
0 2 6 0
1
(
(
=
(
(

6
Thus the final tableau with all the missing
entries filled is:
Basic z x1 x2 x3 x4 x5 x6 Sol
z
x5
x3
x1

1
0
0
0
2
1
-2
1

0
1
0
0
2
2
4
-1

0
0
0
1
0
0
1
0
4
4
0
7
0
1
7 6
Consider the following LPP:
Maximize
1 2 3
2 4 3 z x x x = + +
Subject to
1 2 3
1 2
1 2 3
3 2 20
5 10
, , 0
x x x
x x
x x x
+ + =
+ >
>
We shall apply the big M method. Thus the
modified problem is:
Modified LPP:
Maximize
1 2 3 1 2
2 4 3 z x x x M R M R = + +
Subject to
1 2 3 1
1 2 2 2
1 2 3 2 1 2
3 2 20
5 10
, , , , , 0
x x x R
x x s R
x x x s R R
+ + + =
+ + =
>
s
2
is a surplus variable. R
1
, R
2
are artificial
variables.
Taking x
1
, s
2
as basic variables, find the Simplex
tableau and verify it is the optimal tableau.
Basic z x1 x2 x3 R1 s2 R2 Sol
z
x1
s2

1
0
0

Thus we shall fill the entries in the tableau below
Since x
1
, s
2
are the basic variables in that
order, the basic matrix is
1 0
1 1
B
(
=
(


And its inverse is
1
B

=
1 0
1 1
(
(


Hence the new constraint columns are:
1
1
B A

=
1 0 1
1 1 1
( (
=
( (


1
,
0
(
(

1
2
B A

=
1 0 3
1 1 5
( (
=
( (


3
,
2
(
(


1
3
B A

=
1 0 2
1 1 0
( (
=
( (


2
,
2
(
(

1
4
B A

=
1 0 1
1 1 0
( (
=
( (


1
,
1
(
(

1
5
B A

=
1 0 0
1 1 1
( (
=
( (


0
,
1
(
(

1
6
B A

=
1 0 0
1 1 1
( (
=
( (


0
1
(
(


The (new) RHS = Solution column is
1
B b

=
1 0 20
1 1 10
( (
=
( (


20
10
(
(

The entries below x
1
, x
2
, x
3
, x
4
, x
5
, x
6
in the
objective function row in the final tableau
will be
1 1
z c =
1
1 1 B
c B A c

=
| |
1
2 0 2
0
(
=
(

0
2 2
z c =
1
2 2 B
c B A c

=
| |
3
2 0 4
2
(
=
(


2
3 3
z c =
1
3 3 B
c B A c

=
| |
2
2 0 3
2
(
=
(

1
4 4
z c =
1
4 4 B
c B A c

=
| |
1
2 0 ( )
1
M
(

(

2 M = +
5 5
z c =
1
5 5 B
c B A c

=
| |
0
2 0 0
1
(
=
(

0
6 6
z c =
1
6 6 B
c B A c

=
| |
0
2 0 ( )
1
M
(

(


M =
1
B
c B b

= | |
20
2 0
10
(
=
(

40
Finally the new z-value is
Basic z x1 x2 x3 R1 s2 R2 Sol
z
x1
s2

1
0
0



Thus the final tableau is shown below:
1
0
3
-2
2
2
1
1
0
1
0
-1
20
10
0 2
1 M+2 0 M 40
This is clearly the optimal tableau.

You might also like