Maximize (x + 3y)
Subject to
x + y ≤ 4
x + y ≤ 1
x - y ≥ 2
x, y ≥ 0
Subject to
x + y ≤ 4
x + y ≤ 1
x - y ≥ 2
x, y ≥ 0
Linear Programming Samples
Uncompatible constraints Sample
Lets consider a linnear programming as follows
The feasible region has the form
That is, the set of feasible set is the empty set. There are not any point satisfying all restrictions, so we have an incompatibility restrictions problem.
That is, the set of feasible set is the empty set. There are not any point satisfying all restrictions, so we have an incompatibility restrictions problem.
Ejecuta aquí este ejemploExecute here this example
