Ignacio Morales Dominguez

OSWALDO REYES 4ºU

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

Linear Programming Results

X1 X2 RHS Dual

Minimize 4 2

Constraint 1 5 15 <= 50 0

Constraint 2 20 5 <= 40 0

Constraint 3 15 2 <= 60 0

Solution-> 0 0 0

Ranging

Variable Value Reduced Cost Original Val Lower Bound Upper Bound
X1 0 4 4 0 Infinity
X2 0 2 2 0 Infinity
Dual Value Slack/Surplus Original Val Lower Bound Upper Bound
Constraint 1 0 50 50 0 Infinity
Constraint 2 0 40 40 0 Infinity
Constraint 3 0 60 60 0 Infinity

Solution list
Variable Status Value

X1 NONBasic 0

X2 NONBasic 0

slack 1 Basic 50

slack 2 Basic 40

slack 3 Basic 60

Optimal Value (Z) 0

Iterations
Basic
Cj Quantity 4X1 2X2 0slack 1 0slack 2 0slack 3
Variables
Iteration 1

0 slack 1 50 5 15 1 0 0

0 slack 2 40 20 5 0 1 0

0 slack 3 60 15 2 0 0 1

zj 0 8 4 0 0 0

cj-zj -4 -2 0 0 0

Dual

Original Problem
Minimize X1 X2
Constraint 1 5 15 <= 50
Constraint 2 20 5 <= 40
Constraint 3 15 2 <= 60

Dual Problem
Constraint 1 Constraint 2 Constraint 3
martes, 23 de abril de 2024 15:48 1 of 1
 Ignacio Morales Dominguez
OSWALDO REYES 4ºU
Dual

Maximize -50 -40 -60

X1 -5 -20 -15 <= 4
X2 -15 -5 -2 <= 2

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