Scribd
Upload
60 views3 pages

Continuing The Problem: Homework 6

This document summarizes the simplex method solution to a linear programming problem over multiple iterations. It finds an optimal solution of (16,72) but notes that this is a degenerate solution, meaning it lies at the intersection of more constraints (3 in this 2-dimensional problem) than is required for a unique optimal solution. It also shows the graphical solution involving finding the optimal point at the intersection of the objective function and the feasible region boundaries.

Uploaded by

Özlem Yurtsever
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 DOCX, PDF, TXT or read online on Scribd
60 views3 pages

Continuing The Problem: Homework 6

This document summarizes the simplex method solution to a linear programming problem over multiple iterations. It finds an optimal solution of (16,72) but notes that this is a degenerate solution, meaning it lies at the intersection of more constraints (3 in this 2-dimensional problem) than is required for a unique optimal solution. It also shows the graphical solution involving finding the optimal point at the intersection of the objective function and the feasible region boundaries.

Uploaded by

Özlem Yurtsever
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 DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

HOMEWORK 6

Continuing the problem

Simplex Solution

iteration 0

x1

x2

s1

s2

s3

s4

RHS

Z
s1
s2
s3
s4

-7
3
1
1
1 3/4

-6
1
2
0
1

0
1
0
0
0

0
0
1
0
0

0
0
0
1
0

0
0
0
0
1

0
120
160
35
100

min ratio
test
40
160
35
57 1/7

iteration 1
Z
s1
s2
x1
s4

x1
0
0
0
1
0

x2
-6
1
2
0
1

s1
0
1
0
0
0

s2
0
0
1
0
0

s3
7
-3
-1
1
-1 3/4

s4
0
0
0
0
1

RHS
245
15
125
35
38 3/4

min ratio test


15
62 1/2
38 3/4

iteration 2
Z

x1
0

x2
0

s1
6

s2
0

s3
-11

s4
0

RHS
335

min ratio test

x2
s2
x1
s4

0
0
1
0

1
0
0
0

1
-2
0
-1

0
1
0
0

-3
5
1
1 1/4

0
0
0
1

15
95
35
23 3/4

19
35
19

HOMEWORK 6
iteration 3
Z

x1
0

x2
0

s1
-2 4/5

s2
0

s3
0

s4
8 4/5

RHS
544

min ratio test

x2
s2
x1
s3

0
0
1
0

1
0
0
0

-1 2/5
2
4/5
- 4/5

0
1
0
0

0
0
0
1

2 2/5
-4
- 4/5
4/5

72
0
16
19

0
20
-

iteration 4
Z

x1
0

x2
0

s1
0

s2
1 2/5

s3
0

s4
3 1/5

RHS
544

x2
s1
x1
s3

0
0
1
0

1
0
0
0

0
1
0
0

5/7
1/2
- 2/5
2/5

0
0
0
1

- 2/5
-2
4/5
- 4/5

72
0
16
19

There is a degenerate solution.


We found the optimal solution as;

And other optimal solution is;

HOMEWORK 6

Graphical Solution

1)
2)
3)
4)

(0,120) and (40,0)


(0, 80) and (160, 0)
(0,100) and (57,1 , 0)

In an n dimensional space, if number of constraints defining an extreme point


then the
solution is degenerate. By definition of degeneracy, the optimal point (16,72) is degenerate.
Because in R2, 3 constraints define this point.

You might also like