Skip to main content
SpringerLink
Log in

Comments on a reverse convex programming algorithm

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. S. BenSaad (1992), A Cutting Plane Algorithm for a Class of Non-Linear/0-1 Integer Programs, inRecent Advances in Global Optimization, pp. 152–164, Princeton University Press.

  2. S. BenSaad and S. E. Jacobsen (1990), A Level Set Algorithm for a Class of Reverse Convex Programs,Annals of Operations Research 25, 19–42.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AT&T Bell Laboratories, 07748, Middletown, NJ, USA

    S. Bensaad

  2. Electrical Engineering Department, UCLA, 90024-1594, Los Angeles, CA, USA

    S. E. Jacobsen

Authors
  1. S. Bensaad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. E. Jacobsen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bensaad, S., Jacobsen, S.E. Comments on a reverse convex programming algorithm. J Glob Optim 5, 95–96 (1994). https://doi.org/10.1007/BF01097005

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01097005

Keywords

Search

Navigation