Geometric Programming
摘要
This chapter explores geometric programming as a method suitable for widely used classes of nonlinear problems, especially in engineering and production economics. It describes optimization problems in which the functions in the constraints and the objective function are polynomials with positive coefficients (called posynomials) and their transformation into convex forms. After discussing duality in geometric programming with the focus on the economic interpretation, the chapter presents cost minimization under production constraints and a nonlinear input–output model with substitution between primary factors as illustrative examples. A particular focus here is on the effects of automation on employment in a multisectoral setting showing the potential and usefulness of the geometric programming duality for qualitative economic analysis.