WOLFRAM|DEMONSTRATIONS PROJECT

Parametric Linear Programming

​
c
1
0
c
2
2
c
3
3
c
4
0
t
-20
optimum
Min
Max
The maximum of the cost function is -34..
The gradient of the cost function is {-1.,0.07}.
A
B
C
D
E
F
_
n
-2
2
4
6
x
-2
2
4
6
y
o
o
o
o
o
o

This Demonstration illustrates the problem of parametric linear programming for the case of two variables. So a linear cost function is optimized on a convex domain determined by linear inequalities. The parameter
t
enters the cost function. Vary
t
to see that the vertex or the edge where the optimum is realized changes.