Scribd
Upload
14 views

Decision Modelling Simplex Method

The document describes solving a linear programming problem to maximize an objective function subject to constraints. It provides the original objective function and constraints, then shows the simplex method used to solve it. The optimal solution is found to be Z = 190/3, X1 = 0, X2 = 10/3, X3 = 40/3. Sensitivity analysis is then performed by changing one constraint coefficient from X1 to 2X1. The revised optimal solution is the same.

Uploaded by

Sajidur Rahman
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
14 views

Decision Modelling Simplex Method

The document describes solving a linear programming problem to maximize an objective function subject to constraints. It provides the original objective function and constraints, then shows the simplex method used to solve it. The optimal solution is found to be Z = 190/3, X1 = 0, X2 = 10/3, X3 = 40/3. Sensitivity analysis is then performed by changing one constraint coefficient from X1 to 2X1. The revised optimal solution is the same.

Uploaded by

Sajidur Rahman
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

15e) 2nd constraint coefficient x1 is changed to 2x1.

Objective Function:
Maximize: Z = 2X1 + X2 + 4X3
Subject to
2X1 + X2 + X3 30
X1 + 2X2 + X3 20
X1 + X2 + 2X3 30
And X1, X2, X3 0;
Solution:
Writing in Equation form;
Maximize, Z - 2X1 - X2 - 4X3--------------------------------------- (0)
Subject to:
2X1 + X2 + X3 + S1 = 30-------------------------------------------- (1)
X1 + 2X2 + X3 + S2 = 20-------------------------------------------- (2)
X1 + X2 + 2X3 + S3 = 30-------------------------------------------- (3)
IBFS Solution is written as:
Table 1:

Eqn.
Basic
No. Variable

X1

X2

X3

S1

S2

S3

RHS

Ratio

-2

-3

-4

S1

30

30

S2

20

20

S3

30

15

Table 2:

Eqn. Basic
No. Variable

X1

X2

X3

S1

S2

S3

RHS

Ratio

-1

60

S1

3/2

1/2

-1/2

15

30

S2

1/2

3/2

-1/2

10/3

X3

1/2

1/2

1/2

15

30

X1

X2

X3

S1

S2

S3

RHS

Ratio

Table 3:

Eqn. Basic
No. Variable
0

1/3

2/3

5/3

190/3

S1

4/3

-1/3

-1/3

40/3

X2

1/3

2/3

-1/3

10/3

X3

1/3

-1/3

2/3

40/3

So the Optimal Solution is:


Z = 190/3 at
X1 = 0, X2 = 10/3, X3 = 40/3 and S1 = 40/3;
And S2 = S3 = 0;

When the 2nd constraint is changed X1 to 2X2 then using Sensitivity


analysis we get
i.e. X1 + 2X2 + X3 20 2X1 + 2X2 + X3 20
a21 = 1;
a21n = 2;
Change = a21n a21 = 2 -1 = 1;
In the final table (table 3) X1 is non-basic so no other columns are
affected.
Slack variable for 2nd Constraint is S2.
Comparing column of S2

Table 1
Basic

S2

S1

S2

S3

Last Table

Revised Table

Basic

S3

X1

Revised X1

5/3

1/3

1/3 + 5/3 (1) = 2

S1

-1/3

4/3

4/3 - 1/3 (1) = 1

S2

-1/3

1/3

1/3 1/3 (1) = 0

S3

2/3

1/3

1/3 + 2/3 (1) = 1

Eqn.
Basic
No. Variable

X1

X2

X3

S1

S2

S3

RHS

Ratio

2/3

5/3

190/3

S1

-1/3

-1/3

40/3

X2

2/3

-1/3

10/3

X3

-1/3

2/3

40/3

The Solution is Basic and feasible:


So maximum Z = 190/3 at X1 = 0, X2 = 10/3, X3 = 40/3 and S1 = 40/3
And S2 = S3 = 0;

You might also like