Задача линейного программирования:

При подстановке конкретных значений коэффициентов задача прямая и двойственная примут следующий вид:

ПРЯМАЯ ДВОЙСТВЕННАЯ

qwe SOLUTION IS OPTIMAL DATE 12-01-2000 TIME 14:28:29

MAXIMUM ENTERS: BASIS X: 3 VARIABLES: 3

PIVOTS: 3 LEAVES: BASIS S: 4 SLACKS: 7

LAST INV: 0 DELTA 0 RETURN 855.167 CONSTRAINTS: 7

BASIS S.1 S.2 X.3 X.1 X.2 S.6 S.7

PRIMAL 17.17 17 1.833 3.833 .5 7.5 1.333

DUAL 0 0 10.08 21.17 41.25 0 0

qwe SOLUTION IS MAXIMUM RETURN 855.1667 DATE 12-01-2000

PRIMAL PROBLEM SOLUTION TIME 14:28:34

VARIABLE STATUS VALUE LOWER UPPER RETURN VALUE NET

X.1 BASIS 3.833333 NONE NONE 134 134 0

X.2 BASIS .5 NONE NONE 155 155 0

X.3 BASIS 1.833333 NONE NONE 144 144 0

S.1 BASIS 17.16667 NONE NONE 0 0 0

S.2 BASIS 17 NONE NONE 0 0 0

S.3 NONBASIS 0 NONE NONE 0 10.08333 -10.08333

S.4 NONBASIS 0 NONE NONE 0 21.16667 -21.16667

S.5 NONBASIS 0 NONE NONE 0 41.25 -41.25

S.6 BASIS 7.5 NONE NONE 0 0 0

S.7 BASIS 1.333333 NONE NONE 0 0 0

qwe SOLUTION IS MAXIMUM RETURN 855.1667 DATE 12-01-2000

DUAL PROBLEM SOLUTION TIME 14:28:35

ROW ID STATUS DUAL VALUE RHS VALUE USAGE SLACK

Y.1 NONBINDING 0 30 12.83333 17.16667

Y.2 NONBINDING 0 25 8 17

Y.3 BINDING 10.08333 27 27 0

Y.4 BINDING 21.16667 10 10 0

Y.5 BINDING 41.25 9 9 0

Y.6 NONBINDING 0 25 17.5 7.5

Y.7 NONBINDING 0 37 35.66667 1.333333

qwe SOLUTION IS MAXIMUM RETURN 855.1667 DATE 12-01-2000

OBJECTIVE ROW RANGES TIME 14:28:35

VARIABLE STATUS VALUE RETURN/UNIT MINIMUM MAXIMUM

X.1 BASIS 3.833333 134 108.6 255

X.2 BASIS .5 155 112.6667 195.3333

X.3 BASIS 1.833333 144 119.8 162.1429

qwe SOLUTION IS MAXIMUM RETURN 855.1667 DATE 12-01-2000

RIGHT HAND SIDE RANGES TIME 14:28:36

ROW ID STATUS DUAL VALUE RHS VALUE MINIMUM MAXIMUM

Y.1 NONBINDING 0 30 12.83333 NONE

Y.2 NONBINDING 0 25 8 NONE

Y.3 BINDING 10.08333 27 22.6 29

Y.4 BINDING 21.16667 10 9 10.5

Y.5 BINDING 41.25 9 7 13.28571

Y.6 NONBINDING 0 25 17.5 NONE

Y.7 NONBINDING 0 37 35.66667 NONE