Skip to main content
SpringerLink
Log in

Reverse Convex Optimization

Reverse convex programming

  • Reference work entry
Encyclopedia of Optimization

  • 600 Accesses

Article Outline

Keywords

Definitions

Examples

Some Basic Concepts for Solution Methods

   X a Convex Polytope, f Linear

  X Convex, F Convex

Test Problem Construction

See also

References

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Avriel M, Williams AC (1970) Complementary geometric programming. SIAM J Appl Math 19:121–141

    Article  MathSciNet  Google Scholar 

  2. Avriel M, Williams AC (1971) An extension of geometric programming with applications in engineering optimization. J Eng Math 5:187–194

    Article  Google Scholar 

  3. Bansal P, Jacobsen SE (1975) An algorithm for optimizing network flow capacity expansion under economies-of-scale. J Optim Th Appl 15:565–586

    Article  MATH  MathSciNet  Google Scholar 

  4. Bansal P, Jacobsen SE (1975) Characterization of basic solutions for a class of nonconvex programs. J Optim Th Appl 15:549–564

    Article  MATH  MathSciNet  Google Scholar 

  5. Bard JF (1983) An algorithm for solving the general bilevel programming problem. Math Oper Res 8:260–272

    MATH  MathSciNet  Google Scholar 

  6. Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Math 4:238–252

    Article  MATH  MathSciNet  Google Scholar 

  7. Fulop J (1988) A finite cutting plane method for solving linear programs with an additional reverse convex constraint. Working Paper, Dept Oper Res, Hungarian Acad Sci, Budapest

    Google Scholar 

  8. Geoffrion AM (1972) Generalized Benders decomposition. J Optim Th Appl 4:237–260

    Article  MathSciNet  Google Scholar 

  9. Gurlitz TR, Jacobsen SE (1991) On the use of cuts in reverse convex programs. J Optim Th Appl 68:257–274

    Article  MATH  MathSciNet  Google Scholar 

  10. Hillestad RJ (1975) Optimization problems subject to a budget constraint with economies-of-scale. J Oper Res 6:1091–1098

    MathSciNet  Google Scholar 

  11. Hillestad RJ, Jacobsen SE (1980) Linear programs with an additional reverse convex constraint. J Appl Math Optim 6:257–269

    Article  MATH  MathSciNet  Google Scholar 

  12. Hillestad RJ, Jacobsen SE (1980) Reverse convex programming. J Appl Math Optim 6:63–78

    Article  MATH  MathSciNet  Google Scholar 

  13. Horst R, Tuy H (1990) Global optimization: deterministic approaches. Springer, Berlin

    MATH  Google Scholar 

  14. Jacobsen SE, Moshirvaziri K (1996) Computational experience using an edge search algorithm for linear reverse convex programs. J Global Optim 9:153–167

    Article  MATH  MathSciNet  Google Scholar 

  15. Meyer R (1970) The validity of a family of optimization methods. SIAM J Control 8:41–54

    Article  MATH  MathSciNet  Google Scholar 

  16. Moshirvaziri K (1994) A generalization of the construction of test problems for nonconvex optimization. J Global Optim 5:21–34

    Article  MATH  MathSciNet  Google Scholar 

  17. Rosen JB (1966) Iterative solution of nonlinear optimal control problems. SIAM J Control 4:223–244

    Article  MATH  MathSciNet  Google Scholar 

  18. Sen S, Sherali HD (1987) Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization. Math Program 37:169–183

    Article  MATH  MathSciNet  Google Scholar 

  19. Sung Y, Rosen JB (1982) Global minimum test problem construction. Math Program 24:353–355

    Article  MATH  MathSciNet  Google Scholar 

  20. Tuy H (1964) Concave programming under linear constraints. Soviet Math 5:1437–1440

    Google Scholar 

  21. Tuy H (1987) Convex programs with an additional reverse convex constraint. J Optim Th Appl 52:463–485

    Article  MATH  MathSciNet  Google Scholar 

  22. Ueing U (1972) A combinatorial method to compute a global solution of certain non-convex optimization problems. In: Lootsma FA (ed) Global Optimization: Deterministic Approaches. Acad Press, New York, pp 223–230

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University California, Los Angeles, USA

    Stephen E. Jacobsen

Authors
  1. Stephen E. Jacobsen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Jacobsen, S.E. (2008). Reverse Convex Optimization . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_564

Download citation

Publish with us

Policies and ethics

Search

Navigation