gokuf

12-09-2021 13:43:45

Module/submodel: Linear Programming

Problem title: (untitled)
Objective: Maximize

Problem and Results ----------

X1 X2 RHS Dual
---------------------------------------------------------------------
Maximize 3 2
Constraint 1 1 2 <= 40 .3333
Constraint 2 2 1 <= 50 1.3333
---------------------------------------------------------------------
Solution 20 10 80

The optimal solution value is = 80

Ranging ----------

Reduced Original Lower Upper

Variable Value Cost Value Bound Bound
-------------------------------------------------------------------------------------------------------
X1 20 0 3 1 4
X2 10 0 2 1.5 6

Dual Slack/ Original Lower Upper

Constraint Value Surplus Value Bound Bound
-------------------------------------------------------------------------------------------------------
Constraint 1 .3333 0 40 25 100
Constraint 2 1.3333 0 50 20 80

Solution list ----------

Iterations ----------

Iteration 1

Cj--> 3 2 0 0
Basic X1 X2 Profit Quantity
-----------------------------------------------------------------
slack 1 1 2 1 0 40
slack 2 2 1 0 1 50
zj 0 0 0 0 0
cj-zj 3 2 0 0

Iteration 2

Cj--> 3 2 0 0
Basic X1 X2 Profit Quantity
-----------------------------------------------------------------
slack 1 0 1.5 1 -0.5 15
X1 1 0.5 0 0.5 25
zj 3 1.5 0 1.5 75
cj-zj 0 0.5 0 -1.5

Iteration 3

Cj--> 3 2 0 0
Basic X1 X2 Profit Quantity
-----------------------------------------------------------------
X2 0 1 0.6667 -0.3333 10
X1 1 0 -0.3333 0.6667 20
zj 3 2 .3333 1.3333 80
cj-zj 0 0 -0.3333 -1.3333
Dual ----------

y1 y2
---------------------------------------------------------
Minimize 40 50
X1 1 2 >= 3
X2 2 1 >= 2

(untitled)

X2
50

Constraints

Isoprofit Line
20

20.,10.

25 40
X1