PAGP: a partitioning algorithm for linear goal programming problems. (See J.L. Arthur and A. Ravindran, ACM TOMS 6 (1980) pp. 429.). Classes : G2a1 . Linear programming with a dense matrix of constraints Type : Fortran software in TOMS collection. Access : Some uses prohibited. Portable. Precision: Single. Details : Fullsource Sites : (1) NETLIB
NETLIB: Public access repository, The University of Tennessee at Knoxville and Bell Laboratories Precision: Single. You may access components from NETLIB outside GAMS as follows. Fullsource : echo "send 557 from toms" | mail netlib@ornl.gov
GAMS is a service of the Mathematical and Computational Sciences Division of the Information Technology Laboratory of the National Institute of Standards and Technology
This page was generated on Sat Sep 20, 2008 at 06:31:28 UTC