Can LAPACK solve Simplex problems?

[henrycortezwu]

Hi,
I'd like to ask if LAPACK can solve linear problems that Simplex method will be able to solve.

A sample would be found in the following link : http://www.inductive.com/helpsimplex3.htm

The problem in the link is the following :
Maximixe z = 4.00x1+ 6.00x2+ 7.00x3+ 8.00x4
Subject to
2.00x1+ 3.00x2+ 4.00x3+ 7.00x4 <= 4600.00 (Cons 1)
3.00x1+ 4.00x2+ 5.00x3+ 6.00x4 <= 5000.00 (Cons 2)
1.00x4 >= 400.00 (Cons 3)
1.00x1+ 1.00x2+ 1.00x3+ 1.00x4 = 950.00 (Cons 4)

The answer in the link is the following :
The Maximum z = 6650.00

Hope someone can help me out produce some code for such cases. Especially which LAPACK method to use.

Thanks,
Henry Wu

[sven]

LAPACK does not solve linear programming (LP) problems. Guides to optimization software, including LP software can be found at:

www-fp.mcs.anl.gov/OTC/Guide/SoftwareGuide/Categories/linearprog.html

and

plato.la.asu.edu/guide.html

You should be aware that many of the LP solvers are commercial.

Good luck,

Sven Hammarling.

[yura]

Hi

This is a tool you can use to solve smalls linear problems using AMPL: http://www.programacionlineal.net/resolucion.html . Just you need to put in on the parameters.

Also, here is a simplex tool http://www.programacionlineal.net/simplex.html for solve smalls linear programming models. Just "copy and paste" the following:

Maximize p = 4x + 6y + 7z + 8w subject to
2x + 3y + 4z + 7w <= 4600
3x + 4y + 5z + 6w <= 5000
1w >= 400
1x + 1y + 1z + 1w <= 950
1x + 1y + 1z + 1w >= 950

Solution:

x=0, y=400, z=150, w=400 V(P)=6.650