Module/submodel: Linear Programming

Problem title: 7-40 Objective:

Maximize

Linear Programming Results

X1 X2 X3 X4 RHS Dual

Maximize 9 12 15 11

Constraint 1 .5 1.5 1.5 1 <= 15000 6

Constraint 2 .3 1 2 3 <= 17000 0

Constraint 3 .2 4 1 2 <= 26000 0

Constraint 4 .5 1 .5 .5 <= 12000 12

Constraint 5 1 0 0 0 >= 150 0

Constraint 6 0 1 0 0 >= 100 -9

Constraint 7 0 0 1 0 >= 300 0

Constraint 8 0 0 0 1 >= 400 -1

Constraint 9 1 0 0 0 >= 0 0

Constraint 10 0 1 0 0 >= 0 0

Constraint 11 0 0 1 0 >= 0 0

Constraint 12 0 0 0 1 >= 0 0

Solution 20650 100 2750 400 232700