Maximization of linearly constrained posynomials

DOI10.1016/0898-1221(76)90021-3MaRDI QIDQ1245683zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 3215121 (Why is no real title available?)
• scientific article; zbMATH DE number 3272827 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• Concave minimization over a convex polyhedron
• Constrained maximization of posynomials by geometric programming
• Convergence Conditions for Nonlinear Programming Algorithms
• Global Maximization of a Convex Function with Linear Inequality Constraints
• Non-linear integer programming
• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
• Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
• Solving the Fixed Charge Problem by Ranking the Extreme Points

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245683)