Bounded Linear Allocation With A Nonlinear Cost Constraint Is An Unconstrained Problem

DOI10.1080/03155986.1987.11732048MaRDI QIDQ3773710zbMATH OpenOpenAlexFDO

Authors T. R. Jefferson, Carlton H. Scott

Publication date 1987

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1987.11732048

zbMATH Keywords

bounded variablesconjugate dualitydual programgeneralized geometric programminglinear objectiveone convex constraint

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Nonlinear programming (90C30) Mathematical programming (90C99)

Recommendations

• Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
• A nonlinear allocation problem
• Finite method for a nonlinear allocation problem
• The Nonlinear Resource Allocation Problem
• Addendum: A Finite Algorithm for Solving Nonlinear Allocation Problems
• A specially structured nonlinear integer resource allocation problem
• The constrained minimax linear assignment problem
• A breakpoint search approach for convex resource allocation problems with bounded variables
• A nonlinear minimax allocation problem with multiple knapsack constraints

This page was built for publication: Bounded Linear Allocation With A Nonlinear Cost Constraint Is An Unconstrained Problem

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