[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Help-glpk] How to get All Extreme Points?
From: |
glpk xypron |
Subject: |
Re: [Help-glpk] How to get All Extreme Points? |
Date: |
Tue, 15 Feb 2011 21:39:12 +0100 |
Hello Zhe,
with GLPK you can only determine one of the points for which the
objective function is minimal/maximal.
The following articles might be of interest to you:
Leonid Khachiyan
Generating All Vertices of a Polyhedron Is Hard
Discrete Comput Geom (2008) 39: 174–190
http://www.mpi-inf.mpg.de/~elbassio/pub/DCG08.pdf
J. Scott Provan
Efficient enumeration of the vertices of polyhedra associated with network LP's
Mathematical Programming
Volume 63, Numbers 1-3, 47-64
http://www.springerlink.com/content/g0jh04630w248865/
Best regard
Xypron
-------- Original-Nachricht --------
> Datum: Tue, 15 Feb 2011 14:51:17 -0500
> Betreff: [Help-glpk] How to get All Extreme Points?
> Hello, guys,
>
> I'm new to GLPK, went over most parts of the GLPK guide last week.
>
> I used simplex method, want to get all extreme points in a simple LP,
> and it is a small size LP.
> But did not find functions to do so.
>
> Are there such kind of functions available in GLPK?
> or can I find some work around method?
> Thanks.
>
> Best,
> Zhe
--
Schon gehört? GMX hat einen genialen Phishing-Filter in die
Toolbar eingebaut! http://www.gmx.net/de/go/toolbar