QUESTION 1
The dual linear program of
maximize -9x1-5x29x3-4x4
subject to 3x1-5x2
+ 2x4 = 4
= 3
5x1 + x27x3 + 4x4
-6x15x29x3 - 4X4 S-1
-9x18x23x3 -3X4 S-5
X2 X4 20
is
minimize
4X1+ 3X2 X3 -5x4
subject to 3y+ 5y2-6у3-9Y4
✓ -9
-5y1 + Y2-5y3-8Y4
✓ -5
-7y2 +9y3 - 3Y4
v-9
2y1+ 4у2-4у3 - 3Y4
v-4
QUESTION 2 For the linear program maximize - -4x2 X3 + 4x4 subject to 2x12x2 - 8X3 +7x4 ≤-2 -2x2+7x3-3X4 S-7 3x1+5x24x3 - 7x4 ≤ 3 X1 +5x3 + 5x4 ≤ 16 X1, X2, X3, X4 20 and feasible solution x = (0, 4, 1, 2), which of the following statements is correct? There does not exist any dual solution satisfying the complementary slackness conditions with x. There exist infinitely many dual solutions satisfying the complementary slackness conditions with x'. There exists a unique dual solution y satisfying the complementary slackness conditions with x, and y is feasible for the dual linear program. There exists a unique dual solution y satisfying the complementary slackness conditions with x, but y is not feasible for the dual linear program.
DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma
Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t
Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th
1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of
1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
---|---|---|---|---|---|---|
29 | 30 | 31 | 1 | 2 | 3 | 4 |
5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 | 1 |