[Help-glpk] Using MIP to get a less-than-optimal solution?

[Philip Warner]

This may be a silly question, but is it possible to get GLPK to give a 
faster, less-than-optimal solution to a problem?

eg. if I have an optimal (non-integer) LP solution, and am happy with any 
integer solution that is at most 20% more expensive, can I use MIP to find it?



----------------------------------------------------------------
Philip Warner                    |     __---_____
Albatross Consulting Pty. Ltd.   |----/       -  \
(A.B.N. 75 008 659 498)          |          /(@)   ______---_
Tel: (+61) 0500 83 82 81         |                 _________  \
Fax: (+61) 03 5330 3172          |                 ___________ |
Http://www.rhyme.com.au          |                /           \|
                                 |    --________--
PGP key available upon request,  |  /
and from pgp.mit.edu:11371       |/