Linprog -- low dimensional linear programming
For low-dimensional linear programming problems, computational geometry
flavored algorithms can outperform more general LP codes.
An implementation of Seidel's randomized incremental LP algorithm
in C by Mike Hohmeyer at ftp://icemcfd.com/pub/linprog.a.
This program also
handles rational objective functions, so with some cleverness
you can get
polytope separation distance, linear programming on a sphere, etc.
Download Files (local site)Linear Programming / Optimization PageR Project Homepage
Problem Links
This page last modified on 2008-07-10
.
www.algorist.com
