Loading...
Please wait, while we are loading the content...
Similar Documents
A New Algebraic Geometry Algorithm for Integer Programming
| Content Provider | Semantic Scholar |
|---|---|
| Author | Bertsimas, Dimitris Perakis, G. Sridhar R. Tayur |
| Copyright Year | 2000 |
| Abstract | 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. |
| Starting Page | 999 |
| Ending Page | 1008 |
| Page Count | 10 |
| File Format | PDF HTM / HTML |
| DOI | 10.1287/mnsc.46.7.999.12033 |
| Alternate Webpage(s) | http://web.mit.edu/~dbertsim/papers/Optimization/A%20new%20algebraic%20geometry%20algorithm%20for%20integer%20programming.pdf |
| Alternate Webpage(s) | http://web.mit.edu/dbertsim/www/papers/Optimization/A%20new%20algebraic%20geometry%20algorithm%20for%20integer%20programming.pdf |
| Alternate Webpage(s) | http://dspace.mit.edu/bitstream/handle/1721.1/5359/OR-329-98-43940446.pdf?sequence=1 |
| Alternate Webpage(s) | http://web.mit.edu/~dbertsim/www/papers/Optimization/A%20new%20algebraic%20geometry%20algorithm%20for%20integer%20programming.pdf |
| Alternate Webpage(s) | http://www.mit.edu/~dbertsim/papers/Optimization/A%20new%20algebraic%20geometry%20algorithm%20for%20integer%20programming.pdf |
| Alternate Webpage(s) | http://dspace.mit.edu/bitstream/1721.1/5359/1/OR-329-98-43940446.pdf |
| Alternate Webpage(s) | https://doi.org/10.1287/mnsc.46.7.999.12033 |
| Volume Number | 46 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
