Scribd
Upload
13 views

Simplex model

The document presents a linear programming problem (LPP) aimed at maximizing the objective function Z = 7X1 + 6X2 under specific constraints. It outlines the constraints and non-negativity conditions, and demonstrates the application of the Simplex method to solve the LPP. The final solution indicates that the maximum value of Z is 26 when X1 and X2 are both equal to 2.

Uploaded by

deviprasadlutta8
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
13 views

Simplex model

The document presents a linear programming problem (LPP) aimed at maximizing the objective function Z = 7X1 + 6X2 under specific constraints. It outlines the constraints and non-negativity conditions, and demonstrates the application of the Simplex method to solve the LPP. The final solution indicates that the maximum value of Z is 26 when X1 and X2 are both equal to 2.

Uploaded by

deviprasadlutta8
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/ 8

LINEAR PROGRAMMING PROBLEM (LPP)

Example 1: Solve following LPP using Simplex method

Maximize Z= 7X,+6X,
Subject to, X,+X,< 4;

2X, +X, s6;

Where; X,,X, >0


LINEAR PROGRAMMINGPROBLEM (LPP)
Example 1:Solve following LPP using Simplex method

Maximize Z=7X, +6X, Objective Function

Subject to, X, +X, 4;


Constraints

2X, +X,s6;

Where; X,, X, >0 Non negativity constraints


Maximize Z= 7X, +6X, Maximize Z= 7X, +6X, +0S,t 0S,
Subject to, X, + X,s4; Subject to, X,+ X, + S, =4;
2X, +X, s6; Standard
2X, +X+ S, =6,
form:
Where; X,, X, >0 Where; X, X,, S, S,20.

Simplex Table:

C 7 6 0 0
X, X, S, S,
Maximize Z=7X, +6X, Maximize Z= 7X, +6X, +0S,+ 0S,
Subject to, X, +X,s 4; Subject to, X, +X, +S,=4;
2X, + X,s6; Standard
2X, +X,+ S,=6,
form:
Where; X,, X, >0 Where; X, X,, S,S,20.

Simplex Table:

7 6 0 0
b
Ca B.V X X, S, S,
0 S, 1 1 1 0 4
S, 2 1 0 1 6
Z-C4
0 0 0 0
G-Z 7 6 0 0 S,=4
IBFS
S,=6
Zmax =0
Key element

C 7 6
b
CBBVXL S S, =b/key col.

R10 S,1 1 0 4 =4
R2 =R2 /2
1 4/1

R20 S Te 1 6 6/2=3 Key row

G-Z 7 6 0
Key column

C 7 6 0 0
B.V. X, X, S, S,
S
X,
Key element

CBB.V.X
7 60 S;
0
S,
b
=b/key col.

0 S,1 1 1 1 0 4 4/1 =4
0 s.
0 16 6/2 =3 |Keyrow

Z 0 0 0

G-Z 7 6 0 0

Key column
Key element

C 7 6
b
CBBVLX S =b/key col.

R10 S,11 1 0 4 4/1 =4

| R2=R212
R20 sTO 1 0 6 6/2 =3 Key row R2new
0

G-Z 7 6 0 R1 = R1- R2
T Key column Key element

7 6 0
b
CpB.V.X S, S, =b/key col. Key row
S -4-0.5--11/0.5 =2..
7 X 1 0.5 0 0.5 3 3/0.5 =6
N 7 3.5 0 3.5

G-Z 0 2.5 -3.5

Key column
Key element

7 6 0
b
callByX
CBBV =bkey col.
05)10.5
L

|
S

R1 o 11/0.5=2 Key row R1new


R1 =2xR1
S

R27 X1 0.5 0.5 3 3/0.5 =6


7 3.5 0
2.5 0
3.5

-3.5
R2 = R2 -0.5xR1
Key column

C 7 6 0 0
b
GBB.V. X X, S, S,
6 X, 1 2 -1 2 X =2
Z,-ECa, 7 X, 1 0 -1 1 2 Xy =2

N 7 6 5 1

Z=7X, + 6X,+ 0S,+ 0S,


G;-Z 0 0 -5 -1
Zmax= 7x2 + 6x2+0= 26

You might also like