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
MINIMIZE: Z = 2 X1 + 1 X2 |
50 X1 + 20 X2 ≥ 2400 30 X1 + 20 X2 ≥ 1800 10 X1 + 40 X2 ≥ 1200 |
X1, X2 ≥ 0 |
The problem is unbounded but since it is a minimizing problem can find a solution.
Point | X coordinate (X1) | Y coordinate (X2) | Value of the objetive function (Z) |
O | 0 | 0 | 0 |
A | 0 | 120 | 120 |
B | 48 | 0 | 96 |
C | 30 | 45 | 105 |
D | 40 | 20 | 100 |
E | 0 | 90 | 90 |
F | 60 | 0 | 120 |
G | 48 | 18 | 114 |
H | 0 | 30 | 30 |
I | 120 | 0 | 240 |
NOTE:
In green the points where the solution is located.
In red the points that not belong to the feasible region.
Solve using the Simplex method