by Peter
Lohmander, Version: 2002-02-22
Welcome to this very small and simple LP-optimizer! Now, you have the
option to solve very small LP problems directly over the INTERNET without any
special software. Just place the coefficients in the right places below and
press SOLVE. Then, you get the optimal results.
Example:
With the software LINDO from www.LINDO.com
we can solve this optimization problem:
-----------------------------------------------------------
Optimization problem:
max 10X + 20 Y
s.t.
1x + 1y =< 10
2x + 2y =< 30
Optimization result:
OBJECTIVE FUNCTION VALUE
1)
200.0000
VARIABLE
VALUE REDUCED COST
X
0.000000 10.000000
Y
10.000000 0.000000
ROW SLACK OR
SURPLUS DUAL PRICES
2)
0.000000
20.000000
3)
10.000000
0.000000
-----------------------------------------------------------
In order to get the same result with this Java program, you just write
the following "Table 1"(*)
version of the optimization problem:
|
-10 |
-20 |
0 |
0 |
0 |
|
1 |
1 |
1 |
0 |
10 |
|
2 |
2 |
0 |
1 |
30 |
Then you press the SOLVE button and the optimal results should appear
below "Table 1".
(*) Reference to the simplex method of
linear programming: Winston, W.L., Operations Research, Applications and Algorithms,
Duxbury Press, International Thomson Publishing, 3 ed., ISBN 0-534-20971-8.
Peter Lohmander