An Upper Bounding Heuristic for Nonlinear Integer Programs

Gupta Omprakash K and Ravindran V

IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

Abstract: Many optimization problems are formulated as nonlinear mixed integer programming problems. Often practioners, as well as theoreticians, are interested in finding an Upper bound on the objective minimum as fast as possible. An upper bound can be found by locating an integer feasible solution first and then evaluating the corresponding value of the objective function. Given that an algorithm A exists which can generate integer feasible solutions, this paper suggests a heuristic so that the computational efforts are reduced in locating an integer feasible solution. Using the branch and bound procedures, this heuristic is tested on a number of test problems and the corresponding computational results are reported.

Date: 1983-01-01
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:iim:iimawp:wp00525

Access Statistics for this paper

More papers in IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department Contact information at EDIRC.
Bibliographic data for series maintained by ().