Scribd
Upload
7 views2 pages

Linear Programming Solution Steps

This document presents three forms - original, standard, and superstandard - for modeling a linear programming problem. The standard form problem involves 3 decision variables (x, y, s1), 2 constraints, and an objective to minimize 3x+2y. The superstandard form adds slack variables and artificial variables to transform inequality constraints into equations. It provides the optimal solution as x=0.5, y=1, s1=1.5, s2=0, s3=0, A1=0, A2=0, A3=0, with a minimum objective value of 3.5.

Uploaded by

J Ångel Arvizu Aguilar
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 XLSX, PDF, TXT or read online on Scribd
7 views2 pages

Linear Programming Solution Steps

This document presents three forms - original, standard, and superstandard - for modeling a linear programming problem. The standard form problem involves 3 decision variables (x, y, s1), 2 constraints, and an objective to minimize 3x+2y. The superstandard form adds slack variables and artificial variables to transform inequality constraints into equations. It provides the optimal solution as x=0.5, y=1, s1=1.5, s2=0, s3=0, A1=0, A2=0, A3=0, with a minimum objective value of 3.5.

Uploaded by

J Ångel Arvizu Aguilar
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 XLSX, PDF, TXT or read online on Scribd

Forma original

Forma estandar

forma superestandar

Zmin=

Zmin=

Zmin=

3x+2y

Restricciones
x+2y>= 1
2x+y>=2
5x+4y<=10
y=1

3x+2y+0s1+0s2+0s3

x+2y-s1= 1
2x+y-s2=2
5x+4y+s3=10
y=1

cb
100
100
0
100

cj
bj

xb
A1
A2
s3
A3
ZJ

3x+2y+0s1+0s2+0s3+MA1+MA2+MA3

x+2y-s1+A1= 1
2x+y-s2+A2=2
5x+4y+s3=10
y+A3=1

3
x
1
2
10
1
400

2
y

1
2
5
0
300
-297

CJ-ZJ

0
s1

2
1
4
1
400
-398

0
s2

-1
0
0
0
-100
100

0
s3

0
-1
0
0
-100
100

100
A1

0
0
1
0
0
0

100
A2

1
0
0
0
100
0

100
A3

0
1
0
0
100
0

0
0
0
1
100
0

0.5
2
2.5
1

CP

cb
2
100
0
100

cj
bj

xb
Y
A2
s3
A3
ZJ

3
x
0.5
1.5
8
0.5
201

CJ-ZJ

2
y

0
s1

0.5
1.5
3
-0.5
101
-98

1
0
0
0
2
0

0
s2

-0.5
0.5
2
0.5
99
-99

0
s3

0
-1
0
0
-100
100

100
A1

0
0
1
0
0
0

100
A2

0.5
-0.5
-2
-0.5
-99
199

100
A3

0
1
0
0
100
0

0
0
0
1
100
0

-1
3
4
1

CP

cb
2
100
0
0

cj
bj

xb
Y
A2
s3
s1
ZJ

x
1
1
6
1
102

y
0
2
5
-1
200
-197

CJ-ZJ

0
s1

1
0
0
0
2
0

0
s2

0
0
0
1
0
0

0
s3

0
-1
0
0
-100
100

100
A1

0
0
1
0
0
0

100
A2

0
0
0
-1
0
100

100
A3

0
1
0
0
100
0

1
-1
-4
2
-98
198

#DIV/0!
0.5
1.2
-1

CP

cb
2
3
0
0

cj
bj

xb
Y
x
s3
s1
ZJ

1
0.5
3.5
1.5
3.5
CJ-ZJ

Solucin nica
x
y
S1
S2
S3
A1
A2
A3
Z

3
x

0.5
1
1.5
0
3.5
0
0
0
3.5

2
y

0
1
0
0
3
0

0
s1

1
0
0
0
2
0

0
s2

0
0
0
1
0
0

0
s3

0
-0.5
2.5
-0.5
-1.5
1.5

100
A1

0
0
1
0
0
0

100
A2

0
0
0
-1
0
100

100
A3

0
0.5
-2.5
0.5
1.5
98.5

1
-0.5
-1.5
1.5
0.5
99.5

RP

RP

RP

You might also like