Index of /atarilibrary/atari_cd04/OP_RSRCH/LPSOLVES
Name Last modified Size Description
Parent Directory 11-May-2007 21:00 -
CHANGELO.G 28-Jul-1993 11:13 1k
DEFINES.H 28-Jul-1993 11:13 2k
DUAL.C 28-Jul-1993 11:13 3k
EX1.LP 28-Jul-1993 11:13 1k
EX1.OUT 28-Jul-1993 11:13 1k
EX2.LP 28-Jul-1993 11:13 1k
EX2.OUT 28-Jul-1993 11:13 1k
EX3.LP 28-Jul-1993 11:13 1k
EX3.OUT 28-Jul-1993 11:13 1k
EX4.LP 28-Jul-1993 11:13 5k
EX4.OUT 28-Jul-1993 11:13 1k
EX5.LP 28-Jul-1993 11:13 9k
EX5.OUT 28-Jul-1993 11:13 4k
GLOBALS.H 28-Jul-1993 11:13 1k
INSTALL 28-Jul-1993 11:13 1k
LEX.L 28-Jul-1993 11:13 1k
LEX.YY 28-Jul-1993 11:13 10k
LEXYYX.C 28-Jul-1993 11:13 10k
LEX_YY.C 28-Jul-1993 11:13 10k
LP.Y 28-Jul-1993 11:13 3k
LP_SOLVE.1 28-Jul-1993 11:13 4k
LP_SOLVE.MAN 28-Jul-1993 11:13 5k
LP_SOLVE.TTP 28-Jul-1993 11:13 53k
LW 28-Jul-1993 11:13 0k
MAIN.C 28-Jul-1993 11:13 5k
MAKEFILE 28-Jul-1993 11:13 1k
MAKEFILE.ST 28-Jul-1993 11:13 1k
MANIFEST 28-Jul-1993 11:13 2k
PATCHLEV.H 28-Jul-1993 11:13 1k
PROTO.H 28-Jul-1993 11:13 2k
READ.C 28-Jul-1993 11:13 14k
SOLVE.C 28-Jul-1993 11:13 19k
TRAN.C 28-Jul-1993 11:13 1k
WRITE.C 28-Jul-1993 11:13 2k
Y.TAB 28-Jul-1993 11:13 16k
YTAB.C 28-Jul-1993 11:13 17k
Y_TAB.C 28-Jul-1993 11:13 16k
CONTENTS:
This package contains the ANSI C sources for a very efficient (mixed integer)
linear problem solver. To compile without warnings, you need ANSI include
files as well. Its base is a sparse matrix dual simplex LP solver. MILP
problems are solved with a branch-and-bound iteration over LP solutions.
It uses a lex and yacc parser to read a human-friendly algebraic input format.
The author has used the program to solve LP problems up to about 30000
variables and 50000 constraints (on a 22 MFLOPS HP9000/750).
VECTOR PROCESSORS:
For alliant users, there are pragmas in dual.c which allow to compile it in
vector mode. This reduces the cpu usage with 40% on a FX/8. Do not compile any
of the other files with vector optimization; this will just slow things down.
It should easily be possible to use vector capabilities of other computers.
KNOWN BUGS / PROBLEMS
The program does not store simple bounds on variables in the main matrix.
Therefore, simple problems like:
x + y;
x < 1;
y < 1;
define an empty matrix. This sometimes causes the program to crash. All
real-life problems do not have this property, fortunately.
FUTURE ENHANCEMENTS:
The program lacks two things:
- matrix optimization as preprocessing
- matrix normalization to increase numerical stability
Contributions are welcome.
AUTHOR:
For any comment on the sources, contact: michel@es.ele.tue.nl
INSTALL:
Look into file INSTALL for installation hints.
TESTING:
After a succesful build, run:
lp_solve < ex[12345].lp
The results should be close to (floating point accuracy is important) the
results in ex[12345].out.