IDEAS home Printed from https://ideas.repec.org/p/iim/iimawp/wp00525.html
   My bibliography  Save this paper

An Upper Bounding Heuristic for Nonlinear Integer Programs

Author

Listed:
  • Gupta Omprakash K
  • Ravindran V

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.

Suggested Citation

  • Gupta Omprakash K & Ravindran V, 1983. "An Upper Bounding Heuristic for Nonlinear Integer Programs," IIMA Working Papers WP1983-01-01_00525, Indian Institute of Management Ahmedabad, Research and Publication Department.
    • Handle: RePEc:iim:iimawp:wp00525
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:iim:iimawp:wp00525. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/eciimin.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.