IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v26y1979i4p595-609.html
   My bibliography  Save this article

An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions

Author

Listed:
  • Claude Dennis Pegden
  • Clifford C. Petersen

Abstract

This paper presents an algorithm for solving the integer programming problem possessing a separable nonlinear objective function subject to linear constraints. The method is based on a generalization of the Balas implicit enumeration scheme. Computational experience is given for a set of seventeen linear and seventeen nonlinear test problems. The results indicate that the algorithm can solve the nonlinear integer programming problem in roughly the equivalent time required to solve the linear integer programming problem of similar size with existing algorithms. Although the algorithm is specifically designed to solve the nonlinear problem, the results indicate that the algorithm compares favorably with the Branch and Bound algorithm in the solution of linear integer programming problems.

Suggested Citation

  • Claude Dennis Pegden & Clifford C. Petersen, 1979. "An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 26(4), pages 595-609, December.
    • Handle: RePEc:wly:navlog:v:26:y:1979:i:4:p:595-609
    DOI: 10.1002/nav.3800260405
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800260405
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800260405?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Harold P. Benson & S. Selcuk Erenguc, 1990. "An algorithm for concave integer minimization over a polyhedron," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 515-525, August.

    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:wly:navlog:v:26:y:1979:i:4:p:595-609. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.