« Previous « Start » Next »
2 LP Problem
The general formulation in TOMVIEW for a linear programming problem
is:
|
|
|
f(x) = cT x |
| |
|
| s/t |
| xL |
≤ |
x |
≤ |
xU |
| bL |
≤ |
A x |
≤ |
bU |
|
|
(1) |
where
c,
x,
xL,
xU 
Rn,
A Rm1 × n, and
bL,
bU Rm1. Equality constraints are defined by setting the lower bound to the upper bound.
Example problem:
|
|
|
f(x1,x2) = −7x1−5x2 |
| |
|
| s/t |
| x1+2x2 |
≤ |
6 |
| 4x1+x2 |
≤ |
12 |
| x1,x2 |
≥ |
0 |
|
|
(2) |
The following VI defines this problem in TOMVIEW.
It is possible to change the output displayed by expanding the
cluster in the block diagram.
« Previous « Start » Next »
TOMVIEW
