Tools
Tools
Bell, D.E. & Shapiro, J.F. (1975). A Finitely Convergent Duality Theory for Zero-One Integer Programming. IIASA Research Memorandum. IIASA, Laxenburg, Austria: RM-75-033
Preview |
Text
RM-75-033.pdf Download (633kB) | Preview |
Abstract
Given an integer programming problem, a constructive procedure is presented for generating a finite sequence of increasingly stronger dual problems to the given problem. The last dual problem in the sequence yields an optimal solution to the given integer programming problem. It is shown that this dual problem approximates the convex hull of the feasible integer solutions in a neighborhood of the optimal solution it finds. The theory is applicable to any bounded integer programming problem with rational data.
| Item Type: | Monograph (IIASA Research Memorandum) |
|---|---|
| Research Programs: | System and Decision Sciences - Core (SDS) |
| Depositing User: | IIASA Import |
| Date Deposited: | 15 Jan 2016 01:42 |
| Last Modified: | 27 Aug 2021 17:08 |
| URI: | https://pure.iiasa.ac.at/483 |
Actions (login required)
 |
View Item |