Geometric Programming

H. A. Eiselt and Carl-Louis Sandblom
Additional contact information
H. A. Eiselt: University of New Brunswick
Carl-Louis Sandblom: Dalhousie University

Chapter Chapter 8 in Nonlinear Optimization, 2019, pp 279-328 from Springer

Abstract: Abstract This chapter is devoted to a branch of optimization called geometric programming. It originated in the 1960s and early references are Zener (1961) and Duffin (1962). The term “geometric programming” is actually a misnomer as explained below, but it has stuck. A better term would be “posynomial programming,” since the problems under investigation involve posynomial functions, which we will define below. Our discussion commences with unconstrained geometric programming. Readers may wonder why this was not covered in Chap. 2 . As we develop the theory of geometric programming below, we will have to resort to results from duality for nonlinear programming, an issue not covered until Chap. 4 . General references are Beightler and Phillips (1976), Eiselt et al. (1987), Avriel (2013), and Bazaraa et al. (2013). An entertaining account can be found in Woolsey and Swanson (1975).

Date: 2019
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-030-19462-8_8

Ordering information: This item can be ordered from
http://www.springer.com/9783030194628

DOI: 10.1007/978-3-030-19462-8_8

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().