IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v105y2001i1p201-21210.1023-a1013361800945.html
   My bibliography  Save this article

A Cutting Plane Algorithm for Linear Reverse Convex Programs

Author

Listed:
  • Khosrow Moshirvaziri
  • Mahyar Amouzegar

Abstract

In this paper, global optimization of linear programs with an additional reverse convex constraint is considered. This type of problem arises in many applications such as engineering design, communications networks, and many management decision support systems with budget constraints and economies-of-scale. The main difficulty with this type of problem is the presence of the complicated reverse convex constraint, which destroys the convexity and possibly the connectivity of the feasible region, putting the problem in a class of difficult and mathematically intractable problems. We present a cutting plane method within the scope of a branch-and-bound scheme that efficiently partitions the polytope associated with the linear constraints and systematically fathoms these portions through the use of the bounds. An upper bound and a lower bound for the optimal value is found and improved at each iteration. The algorithm terminates when all the generated subdivisions have been fathomed. Copyright Kluwer Academic Publishers 2001

Suggested Citation

  • Khosrow Moshirvaziri & Mahyar Amouzegar, 2001. "A Cutting Plane Algorithm for Linear Reverse Convex Programs," Annals of Operations Research, Springer, vol. 105(1), pages 201-212, July.
    • Handle: RePEc:spr:annopr:v:105:y:2001:i:1:p:201-212:10.1023/a:1013361800945
    DOI: 10.1023/A:1013361800945
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1013361800945
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1013361800945?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:annopr:v:105:y:2001:i:1:p:201-212:10.1023/a:1013361800945. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.