Code for All Basic Feasible solutions of a LPP

Article View: sci.math.num-analysis

Article #134

Back to sci.math.num-analysis Previous Next

#134

From: Marios Leventopoulos
Date: Wed, 29 Jul 1992 14:13

9 lines
722 bytes

I would appreciate if someone could provide me with a reference/pointers to 
a code (or at least an algorithm) that explores all the basic feasible solutions
of a linaer programming problem (i.e. of a convex polytope).

Thanks
-marios

mml@eng.umd.edu

Technical Details

Message-ID: <1992Jul29.141317.29808@eng.umd.edu>

Path: arc1-ca.pugleaf.net!sparky!uunet!darwin.sura.net!mojo.eng.umd.edu!mml

Show Full Headers

Complete Article Headers

Newsgroups: sci.math.num-analysis
Path: arc1-ca.pugleaf.net!sparky!uunet!darwin.sura.net!mojo.eng.umd.edu!mml
From: mml@eng.umd.edu (Marios Leventopoulos)
Subject: Code for All Basic Feasible solutions of a LPP
Message-ID: <1992Jul29.141317.29808@eng.umd.edu>
Date: Wed, 29 Jul 92 14:13:17 GMT
Organization: College of Engineering, University of Maryland, College Park
Keywords: Linear Programming, Basic Feasible Solutions
Originator: mml@hellas.eng.umd.edu
Lines: 9