Linear Programming examples

Uncompatible constraints example

Lets consider a linnear programming as follows
Maximize (x + 3y)
Subject to
x + y ≤ 4
x + y ≤ 1
x - y ≥ 2
x, y ≥ 0
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.

Ejecuta aquí este ejemploExecute here this example

Was useful? want add anything?

Post here

Post from other users

Post here
Update cookies preferences