PHPSimplex
Version 0.81
Copyright ©2006-2024. All rights reserved.
Developed by:
Daniel Izquierdo Granja
Juan José Ruiz Ruiz
English translation by:
Luciano Miguel Tobaria
French translation by:
Ester Rute Ruiz
Portuguese translation by:
Rosane Bujes
The problem is converted to canonical form by adding slack, surplus and artificial variables as appropiate (show/hide details)
MINIMIZE: Z = 1 X1 + 2 X2 + 4 X3 + 3 X4 + 2 X5 + 1 X6 | MAXIMIZE: Z = -1 X1 -2 X2 -4 X3 -3 X4 -2 X5 -1 X6 + 0 X7 + 0 X8 + 0 X9 + 0 X10 + 0 X11 | |
subject to 1 X1 + 1 X2 + 1 X3 0 X4 0 X5 0 X6 = 50 X1 0 X2 0 X3 + 1 X4 + 1 X5 + 1 X6 = 10 1 X1 0 X2 0 X3 + 1 X4 0 X5 0 X6 = 8 0 X1 + 1 X2 0 X3 0 X4 + 1 X5 0 X6 = 5 0 X1 0 X2 + 1 X3 0 X4 0 X5 + 1 X6 = 2 | subject to 1 X1 + 1 X2 + 1 X3 + 1 X11 = 50 X1 + 1 X4 + 1 X5 + 1 X6 + 1 X10 = 10 1 X1 + 1 X4 + 1 X9 = 8 0 X1 + 1 X2 + 1 X5 + 1 X8 = 5 0 X1 + 1 X3 + 1 X6 + 1 X7 = 2 | |
X1, X2, X3, X4, X5, X6 ≥ 0 | X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11 ≥ 0 |
We'll build the first tableau of Phase I from Two Phase Simplex method.