Ignacio Morales Dominguez

OSWALDO REYES 4ºU

Module/submodel: Linear Programming
Problem title: (untitled)
Objective: Minimize

Linear Programming Results

X1 X2 RHS Dual

Minimize 40 50

Constraint 1 2 3 >= 30 -15

Constraint 2 1 1 >= 12 0

Constraint 3 2 1 >= 20 -5

Solution-> 7,5 5 550

Ranging

Variable Value Reduced Cost Original Val Lower Bound Upper Bound
X1 7,5 0 40 33,33 100
X2 5 0 50 20 60
Dual Value Slack/Surplus Original Val Lower Bound Upper Bound
Constraint 1 -15 0 30 28 60
Constraint 2 0 ,5 12 -Infinity 12,5
Constraint 3 -5 0 20 18 30

Solution list
Variable Status Value

X1 Basic 7,5

X2 Basic 5

surplus 1 NONBasic 0

surplus 2 Basic ,5

surplus 3 NONBasic 0

Optimal Value (Z) 550

Iterations
Basic
0surplus 0surplus 0surplus
Cj Variable Quantity 40X1 50X2 0artfcl 1 0artfcl 2 0artfcl 3
1 2 3
s
Phase 1 -
Iteration 1

1 artfcl 1 30 2 3 1 -1 0 0 0 0

1 artfcl 2 12 1 1 0 0 1 -1 0 0

1 artfcl 3 20 2 1 0 0 0 0 1 -1

zj 62 -5 -5 1 1 1 1 1 1

cj-zj 5 5 0 -1 0 -1 0 -1

Iteration 2

martes, 23 de abril de 2024 15:43 1 of 2

 Ignacio Morales Dominguez
OSWALDO REYES 4ºU
Iterations
Basic
0surplus 0surplus 0surplus
Cj Variable Quantity 40X1 50X2 0artfcl 1 0artfcl 2 0artfcl 3
1 2 3
s

1 artfcl 1 10 0 2 1 -1 0 0 -1 1

1 artfcl 2 2 0 0,5 0 0 1 -1 -0,5 0,5

0 X1 10 1 0,5 0 0 0 0 0,5 -0,5

zj 12 0 -2,5 1 1 1 1 3,5 -1,5

cj-zj 0 2,5 0 -1 0 -1 -2,5 1,5

Iteration 3

1 artfcl 1 2 0 0 1 -1 -4 4 1 -1

0 X2 4 0 1 0 0 2 -2 -1 1

0 X1 8 1 0 0 0 -1 1 1 -1

zj 2 0 0 1 1 6 -4 1 1

cj-zj 0 0 0 -1 -5 4 0 -1

Iteration 4

0 surplus 2 0,5 0 0 0,25 -0,25 -1 1 0,25 -0,25

0 X2 5 0 1 0,5 -0,5 0 0 -0,5 0,5

0 X1 7,5 1 0 -0,25 0,25 0 0 0,75 -0,75

zj 0 0 0 2 0 2 0 2 0

cj-zj 0 0 -1 0 -1 0 -1 0

Phase 2

0 surplus 2 0,5 0 0 0,25 -0,25 -1 1 0,25 -0,25

50 X2 5 0 1 0,5 -0,5 0 0 -0,5 0,5

40 X1 7,5 1 0 -0,25 0,25 0 0 0,75 -0,75

zj 550 40 50 -15 15 0 0 -5 5

cj-zjde 2024 15:43

martes, 23 de abril 0 0 215
of 2 -15 0 0 5 -5
 Ignacio Morales Dominguez
OSWALDO REYES 4ºU
Dual

Original Problem
Minimize X1 X2
Constraint 1 2 3 >= 30
Constraint 2 1 1 >= 12
Constraint 3 2 1 >= 20

Dual Problem
Constraint 1 Constraint 2 Constraint 3
Maximize 30 12 20
X1 2 1 2 <= 40
X2 3 1 1 <= 50

martes, 23 de abril de 2024 15:43 3 of 2