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

An Algorithm for Separable Nonconvex Programming Problems

Author

Listed:
  • James E. Falk

    (Research Analysis Corporation)

  • Richard M. Soland

    (Research Analysis Corporation)

Abstract

In this paper we present an algorithm for solving mathematical programming problems of the form: Find x - (x 1 ,..., x n ) to minimize \sum \varphi i (x i ) subject to x \in G and l i is assumed to be lower semicontinuous, possibly nonconvex, and G is assumed to be closed. The algorithm is of the branch and bound type and solves a sequence of problems in each of which the objective function is convex. These problems correspond to successive partitions of the feasible set. Two different rules for refining the partitions are considered; these lead to convergence of the algorithm under different requirements on the problem functions. Examples are given, and computational considerations are discussed.

Suggested Citation

  • James E. Falk & Richard M. Soland, 1969. "An Algorithm for Separable Nonconvex Programming Problems," Management Science, INFORMS, vol. 15(9), pages 550-569, May.
    • Handle: RePEc:inm:ormnsc:v:15:y:1969:i:9:p:550-569
    DOI: 10.1287/mnsc.15.9.550
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.15.9.550
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.15.9.550?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
    ---><---

    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:inm:ormnsc:v:15:y:1969:i:9:p:550-569. 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.