Solving certain singly constrained convex optimization problems in production planning
From MaRDI portal
Publication:1170996
DOI10.1016/0167-6377(82)90030-XzbMath0497.90029OpenAlexW2022001077MaRDI QIDQ1170996
Publication date: 1982
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(82)90030-x
computational complexityconvex optimizationLagrange multiplierapproximationproduction planninglower and upper boundspolynomial time approximation schemeone linear constraint
Convex programming (90C25) Applications of mathematical programming (90C90) Numerical optimization and variational techniques (65K10) Production models (90B30)
Related Items (15)
Maximum likelihood estimation of cell probabilities in constrained multinomial models ⋮ CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization ⋮ A note on multi-item inventory systems with limited capacity ⋮ A nonlinear knapsack problem ⋮ Multi-period resource allocation for estimating project costs in competitive bidding ⋮ A general purpose exact solution method for mixed integer concave minimization problems ⋮ On a discrete nonlinear and nonseparable knapsack problem ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ A guide to conic optimisation and its applications ⋮ Production and inventory management under multiple resource constraints ⋮ Solving the continuous nonlinear resource allocation problem with an interior point method ⋮ Convergent Lagrangian and domain cut method for nonlinear knapsack problems ⋮ Warehouse sizing to minimize inventory and storage costs ⋮ Inverse optimization for linearly constrained convex separable programming problems ⋮ The nonlinear knapsack problem - algorithms and applications
Cites Work
This page was built for publication: Solving certain singly constrained convex optimization problems in production planning
