Maximization of linearly constrained posynomials

DOI10.1016/0898-1221(76)90021-3zbMath0375.65035OpenAlexW2075452685MaRDI QIDQ1245683

John J. Dinkel, Gary A. Kochenberger

Publication date: 1976

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(76)90021-3

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-linear integer programming
• Constrained maximization of posynomials by geometric programming
• Global Maximization of a Convex Function with Linear Inequality Constraints
• Concave minimization over a convex polyhedron
• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
• Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
• Convergence Conditions for Nonlinear Programming Algorithms
• Solving the Fixed Charge Problem by Ranking the Extreme Points

This page was built for publication: Maximization of linearly constrained posynomials