IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v31y1985i12p1533-1546.html
   My bibliography  Save this article

Branch and Bound Experiments in Convex Nonlinear Integer Programming

Author

Listed:
  • Omprakash K. Gupta

    (Indian Institute of Management, Ahmedabad--380015, India)

  • A. Ravindran

    (School of Industrial Engineering, University of Oklahoma, Norman, Oklahoma 73019)

Abstract

The branch and bound principle has long been established as an effective computational tool for solving mixed integer linear programming problems. This paper investigates the computational feasibility of branch and bound methods in solving convex nonlinear integer programming problems. The efficiency of a branch and bound method often depends on the rules used for selecting the branching variables and branching nodes. Among others, the concepts of pseudo-costs and estimations are implemented in selecting these parameters. Since the efficiency of the algorithm also depends on how fast an upper bound on the objective minimum is attained, heuristic rules are developed to locate an integer feasible solution to provide an upper bound. The different criteria for selecting branching variables, branching nodes, and heuristics form a total of 27 branch and bound strategies. These strategies are computationally tested and the empirical results are presented.

Suggested Citation

  • Omprakash K. Gupta & A. Ravindran, 1985. "Branch and Bound Experiments in Convex Nonlinear Integer Programming," Management Science, INFORMS, vol. 31(12), pages 1533-1546, December.
    • Handle: RePEc:inm:ormnsc:v:31:y:1985:i:12:p:1533-1546
    DOI: 10.1287/mnsc.31.12.1533
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.31.12.1533
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.31.12.1533?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:inm:ormnsc:v:31:y:1985:i:12:p:1533-1546. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.