A New Algebraic Geometry Algorithm for Integer Programming

We propose a new algorithm for solving integer programming (IP) problems that is based on ideas from algebraic geometry. The method provides a natural generalization of the Farkas lemma for IP, leads to a way of performing sensitivity analysis, offers a systematic enumeration of all feasible solutions, and gives structural information of the feasible set of a given IP. We provide several examples that offer insights on the algorithm and its properties.

MoreLess

Year of publication:	2000
Authors:	Bertsimas, Dimitris ; Perakis, Georgia ; Tayur, Sridhar
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 46.2000, 7, p. 999-1008
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS
Subject:	integer programming \| algebraic geometry \| Groebner basis

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Extent:	application/pdf
Type of publication:	Article
Other identifiers:	10.1287/mnsc.46.7.999.12033 [DOI]
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10009204085