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)
MAXIMIZE: Z = 0.20 X1 + 0.10 X2 + 0.09 X3 + 0.11 X4 | MAXIMIZE: Z = 0.2 X1 + 0.1 X2 + 0.09 X3 + 0.11 X4 + 0 X5 + 0 X6 + 0 X7 + 0 X8 + 0 X9 + 0 X10 | |
subject to 1 X1 + 1 X2 + 1 X3 + 1 X4 ≤ 500001 X1 0 X2 0 X3 0 X4 ≤ 12500 0 X1 0 X2 + 1 X3 0 X4 ≤ 10500 0 X1 0 X2 0 X3 + 1 X4 ≤ 10000 3 X1 -1 X2 0 X3 0 X4 ≤ 0 0.5 X1 + 0.5 X2 -1 X3 -1 X4 ≤ 0 | subject to 1 X1 + 1 X2 + 1 X3 + 1 X4 + 1 X5 = 500001 X1 + 1 X6 = 12500 0 X1 + 1 X3 + 1 X7 = 10500 0 X1 + 1 X4 + 1 X8 = 10000 3 X1 -1 X2 + 1 X9 = 0 0.5 X1 + 0.5 X2 -1 X3 -1 X4 + 1 X10 = 0 | |
X1, X2, X3, X4 ≥ 0 | X1, X2, X3, X4, X5, X6, X7, X8, X9, X10 ≥ 0 |
We'll build the first tableau of the Simplex method.