Scribd
Upload
77 views14 pages

Linear Programming Optimization Techniques

The document provides information on several linear programming problems and their solutions using different methods like the simplex method, two-phase method, and Big M method. It gives the objective functions and constraints for each problem and displays the optimal solutions found including the values of the variables and the maximum/minimum objective function value. The problems cover topics like transportation, assignment, and integer programming.

Uploaded by

Maitri Patel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
77 views14 pages

Linear Programming Optimization Techniques

The document provides information on several linear programming problems and their solutions using different methods like the simplex method, two-phase method, and Big M method. It gives the objective functions and constraints for each problem and displays the optimal solutions found including the values of the variables and the maximum/minimum objective function value. The problems cover topics like transportation, assignment, and integer programming.

Uploaded by

Maitri Patel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd

Simple Simplex Method

max z=12x1+16x2
subjected to
10x1+20x2<=120
8x1+8x2<=80
x1>=0
x2>=0

variables
x1 8
x2 2

MAX Z 128

constraints
1 120 <= 120
2 80 <= 80
3 0 >= 0
4 0 >= 0
Two Phase Method Big M Method

max z=3x1-x2 max z=-2x1-x2


subjected to subjected to
2x1+x2>=2 3x1+x2=3
x1+3x2<=2 4x1+3x2>=6
x2<=4 x1+2x2<=4
x1>=0 x1>=0
x2>=0 x2>=0

variables variables
x1 2 x1 0.6
x2 0 x2 1.2

MAX Z 6 MAX Z -2.4

constraints constraints
1 4 >= 2 1 3
2 2 <= 2 2 6
3 0 <= 4 3 3
4 0 >= 0 4 0
5 0 >= 0 5 0
Simplex method(formulation)

max z=50x1+40x2
subjected to
1.5x1+2.5x2<=300
2.5x1+1.5x2<=240
x1>=0
x2>=0

Variables
x1 37.5
x2 97.5

MAX Z 5775

constraints
1 300 <= 300
= 3 2 240 <= 240
>= 6 3 0 >= 0
<= 4 4 0 >= 0
>= 0
>= 0
MIN Z=20X+10Y
SUBJECT TO
X+2Y<=40
3X+Y>=30
4X+3Y>=60
X,Y>=0
X Y
Z 20 10
C1 1 2 <= 40
C2 3 1 >= 30
C3 4 3 >= 60

C1
X Y
0 20
40 0

C2
X Y
0 30
10 0

C3
X Y
0 20
15 0

MIN Z=160X1+240X2
SUBJECT TO
X1+X2<=18
60X1+60X2<=720
X1>=0
X2>=0

X Y
Z 160 240
C1 1 1 <= 18
C2 60 60 <= 720

C1
X Y
18 0
0 18

C2
X Y
12 0
0 12

MAX Z=2X1+5X2
SUBJECT TO
X1+4X2<=24
3X1+X2<=21
X1+X2<=9
X1>=0
X2>=0
X Y
Z 2 5
C1 1 4 <= 24 C1 1
C2 3 1 <= 21 C2 3
C3 1 1 <= 9

C1 C2 3
X Y C3 1
0 6
24 0
C1 1
C2 C3 1
X Y
0 21
7 0

C3
X Y
0 9
9 0
POINT A
C1 1 2 <= 40
C2 3 1 >= 30

POINT C
C3 4 3 >= 60
C2 3 1 >= 30

C3 4 3 >= 60
C1 1 2 <= 40

C1 1 1 <= 18
C2 60 60 <= 720
4 <= 24 X 5.454545
1 <= 21 Y 4.636364
Z 34.09091

1 <= 21 X 6
1 <= 9Y 3
Z 27

4 <= 24 X 4
1 <= 9Y 5
Z 33
X 4
Y 18
Z 260

X 6
Y 12
Z 240

X 0
Y 20
Z 200

X Err:502
Y
Z 1920

Z 2880
Integer programing method

MAX Z=3X1+8X2
SUBJECTED TO
X1+2X2<=9
2X2<=5
X1>=0
X2>=0

VARIABLES
X1 4
X2 2.5

MAX Z 32

CONSTRAINTS
1 9 <= 9
2 5 <= 5
3 0 >= 0
4 0 >= 0
M1 M2 M3 M4 M5
J1 65 40 90 80 90
J2 60 35 100 85 85
J3 60 38 105 90 95
J4 70 45 120 90 100
J5 65 40 105 87 90

M1 M2 M3 M4 M5
J1 0 0 1 0 0 1
J2 0 1 0 0 0 1
J3 1 0 0 0 0 1
J4 0 0 0 1 0 1
J5 0 0 0 0 1 1
1 1 1 1 1

COST 365
A B C D
A - 4 9 5
B 6 - 4 8
C 9 4 - 9
D 5 8 9 -

1 2 3 4 1
4 4 9 5

COST 22
A B C D E
A 100 3 1 100 100
B 100 100 7 5 1
C 100 100 100 2 100
D 100 100 100 100 7
E 100 100 100 100 100

A B C D E
A 0 0 1 0 0
B 0 0 0 0 0
C 0 0 0 1 0
D 0 0 0 0 1
E 0 0 0 0 0

10 <<<<<< final solution


SUBJECTED TO
NODE 1 1 1
NODE 2 0 0
NODE 3 0 0
NODE 4 0 0
NODE 5 -1 -1
D1 D2 D3 D4 SUPPLY Supply 950
S1 11 13 17 14 250 Demand 950
S2 16 18 14 10 300
S3 21 24 13 10 400
DEMAND 200 225 275 250

D1 D2 D3 D4 SUPPLY
S1 25 225 0 0 250 250
S2 175 0 0 125 300 300
S3 0 0 275 125 400 400
DEMAND 200 225 275 250
200 225 275 250

cost 12075

You might also like