KEMBAR78
Solution | PDF | Mathematics | Computational Science
Scribd
Upload
3 views3 pages

Solution

The document outlines the application of the simplex method to solve a linear programming problem with a minimization objective function. It details the conversion of the minimization problem into a maximization format, the formulation of constraints with slack variables, and the iterative process of finding the optimal solution. The final optimal solution is presented as Min Z = -11 with specific values for the variables x1, x2, and x3.

Uploaded by

sahusubr622
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
3 views3 pages

Solution

The document outlines the application of the simplex method to solve a linear programming problem with a minimization objective function. It details the conversion of the minimization problem into a maximization format, the formulation of constraints with slack variables, and the iterative process of finding the optimal solution. The final optimal solution is presented as Min Z = -11 with specific values for the variables x1, x2, and x3.

Uploaded by

sahusubr622
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

10, X, =0,x, = 1, Max Z=3.

Example 4.4 Use simplex method to solve the LPP.


Min Z =x,-3x, +2r,
Subject to, 3x,-x +2r, s7
-2r, +4x, s12
SIMPLEN METHOD 41

4x, +3r, t &r, s 10

Solution Since the given objcctive function is of minimization, we shall convert it into maximization
using Min Z =-Max(-Z) = -Max Z

Max Z*= -X, +3x- 2r,


Subject to, 3x, -x t 2r, s7
-2:, +4x, s12
-4x, + 3x, + &x, s 10
We rewrite the inequality of theconstraints into an equation by adding slack variables S,, S,. S, and the
standard form of LPP becomes.

Max Z=-x, + 3x -2x, + 0S +0S, + 0S,


Subject to, 3x, -x,t 2x, +S, =7
-2r, + 4x, + S, = 12
-4r, + 3x, + &x, + S, = 10

The initial basic feasible solution is given by S, =7, S, =12, S, =10. (1,=X}=x,=0)
Initial table
-1 3 2 0
C
Min8
S S,
Basis

3 -1 2
0 S, 12/4 = 3
0
12 4
+0 S 10/3 = 3.33
S. 10
0 0

0
-3 2

not optimum.
Since Z,-C, =-3<0, the solution is outgoing variable (key row) is given by,
is x, (key column)and the
The incoming variable
12 10 =3.
= Min
Min B 4'3

Hence, S, leaves the basis.


42 OPERATONS RESEARCH
S

First iteration
3 -2
C,
S, S, Min
B
10
2 1 1/4 =4
10 (S/2) 5/2
+0 S,
1/4 0
3 -1/2 1

0 -3/4 1 2/5
5/2 8
S,
-3/2 3 0 0 3/4
9
0 3/4 0
-1/2 0 2
Z-G

by allowing the variable x, to enter


Since Z, -C,<0, the solution is not optimum. Improve the solution
into the basis and the variable S, to leave the basis.
Second iteration 0
-1 3 -2

B S
Cg 4/5 2/5 1/10
4 1 0
-1
0 1 2/5 1/5 3/10
3
10 - 1/2
0 11

-1 3 2/5 I/5 8/10


Zj 11

0 12/5 1/5 8/10

Since all Z, - C,2 0, the solution is optimum.


The optimal solution is given by Max Z = 1I
X =4, , = 5, x, =0
Min Z -Max()=-11
Min Z =-11, x, = 4, x, = 5, x =0.
simplex method.

You might also like