Scribd
Upload
33 views3 pages

Dual

The document presents the formulation of several linear programming problems involving variables X1, X2, X3, S1, S2, and S3. The problems involve both maximizing and minimizing objective functions Z subject to various given linear constraints on the variables. The problems are solved by forming the simplex tableau and performing simplex algorithm iterations to arrive at an optimal solution.

Uploaded by

Pauu Calderon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
33 views3 pages

Dual

The document presents the formulation of several linear programming problems involving variables X1, X2, X3, S1, S2, and S3. The problems involve both maximizing and minimizing objective functions Z subject to various given linear constraints on the variables. The problems are solved by forming the simplex tableau and performing simplex algorithm iterations to arrive at an optimal solution.

Uploaded by

Pauu Calderon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Min Z = 4X1 + 6X2 + 18X3

S.a

X1 + 3X3
X2 + 2X3
Xj

3
5
0

Min Z= 4X1 6X2 18X3


S.a.
X1 3X3 + S1
= 3
X2 2X3
+ S2 = 5

Xj
X0
S1
S2

X0
1
0
0

X0
S1
S2

X0
1
0
0

X0
S1
S2

X0
1
0
0

X1

X2

X3

4
1

18
3
2

X1

X2

X3

4
1

6
3
2

X1

X2

X3

2
1/3
2/3

0
1
0

S1
0
1
0

S2
0
0
1

Sol
0

S1
0
1
0

S2

Sol
30

0
1

3
5

S1

S2

2
1/3

Sol
36

0
1

1
5

2/3

3
5

Min Z = 5X1 + 12X2 + 4X3


S.a.
X1 + 2X2 + X3 5
2X1 X2 + 3X3 = 2

Xj

Min Z = 5X1 12X2 4X3


s.a.
1x1 + 2x2 + x3 = 5
2x1 x2 + 3x3 = 2
2x1 + x2 3x3 = 2

X0
S1
S2
S3

X0
1
0
0
0

X1
5
1
2
2

X2
12
2
1
1

X3
4
1
3
3

S1
0
1
0
0

S2
0
0
1
0

S3
0
0
0
1

Sol
0
5
2
2

X0
S1
S2
X3

X0
1
0
0
0

X1
23/3
1/3
0
2/3

X2
32/3
7/3
0
1/3

X3
0
0
0
1

S1
0
1
0
0

S2
0
0
1
0

S3
4/3
1/3
1
1/3

Sol
8/3
13/3
0
2/3

Max Z = 2X1 + X2
s.a.
X1 + 5X2 19
X1 + 3X2 6
2X1 + 2X2 8
0
Xj
Max Z= 2X1 X2
s.a.
X1 + 5X2 = 10
X1 + 3X2 = 6
2X1 2X2 = 8
X0
S1
S2
S3

X0
1
0
0
0

X1
2
1
1
2

X2
1
5
3
2

S1
0
1
0
0

S2
0
0
1
0

S3
0
0
0
1

Sol
0
10
6
8

X0
S1
S2
S3

X0
1
0
0
0

X1
0
0
0
1

X2
1
4
2
1

S1
0
1
0
0

S2
0
0
1
0

S3
1

1/2

Sol
8
6
2
4

X0
S1
S2
S3

X0
1
0
0
0

X1
0
0
0
1

X2
5
2
4
5

S1
0
1
0
0

S2
2
1
2
1

S3
0
0
1
0

Sol
12
4
4
6

Max Z = 5X1 + 12X2 + 4X3


s.a.
X1 + 2X2 + X3 = 5
2X1 + X2 3X3 = 2
2X1 X2 + 3X3 = 2

Max Z = 5X1 12X2 4X3


s.a.
X1 + 2X2 + X3 = 5
2X1 + X2 3X3 = 2
2X1 X2 + 3X3 = 2
X0
S1
S2
S3

X0
1
0
0
0

X1
5
1
2
2

X2
12
2
1
1

X3
4
1
3
3

S1
0
1
0
0

S2
0
0
1
0

S3
0
0
0
1

Sol
0
5
2
2

X0
S1
X3
S3

X0
1
0
0
0

X1
7/3
1/3
2/3
0

X2
37/3
7/3
1/3
0

X3
0
0
1
0

S1
0
1
0
0

S2
4/3
1/3
1/3
1

S3
0
0
0
1

Sol
8/3
13/3
2/3
0

X0
X2
X3
S1

X0
1
0
0
0

X1
4/7
1/7
5/7
0

X2
0
1
0
0

X3
0
0
1
0

S1
37/7
3/7
1/7
0

S2
3/7
1/7
2/7
1

S3
0
0
0
1

Sol
179/7
13/7
9/7
0

X0
X2
X1
S3

X0
1
0
0
0

X1
0
0
1
0

X2
0
1
0
0

X3
4/5
1/5
7/5
0

S1
4/35
2/5
1/5
0

S2
1/5
1/5
2/5
1

S3
0
0
0
1

Sol
28.2
8/5
9/5
0

You might also like