Bounds for Generalized Integer Programs

Bell, D.E. (1973) Bounds for Generalized Integer Programs. IIASA Working Paper. IIASA, Laxenburg, Austria, WP-73-009

[img]
Preview
Text
WP-73-009.pdf

Download (489kB) | Preview

Abstract

Generalized linear programming problems have been well solved by column generation and dual ascent procedures. The same problems with the variables restricted to be integer have only been solved when all the coefficients are known explicitly. This paper finds lower bounds for the optimal value of such programs requiring only the implicit definition of the activities.

Item Type: Monograph (IIASA Working Paper)
Research Programs: System and Decision Sciences - Core (SDS)
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 01:40
Last Modified: 08 Aug 2016 07:55
URI: http://pure.iiasa.ac.at/37

Actions (login required)

View Item View Item

International Institute for Applied Systems Analysis (IIASA)
Schlossplatz 1, A-2361 Laxenburg, Austria
Phone: (+43 2236) 807 0 Fax:(+43 2236) 71 313