Efficient Algorithms for a Selection Problem with Nested Constraints and Its Application to a Production-Sales Planning Model

DOI10.1137/0318019zbMath0434.90067OpenAlexW2080918242MaRDI QIDQ3873922

Arie Tamir

Publication date: 1980

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0318019

zbMATH Keywords

selection problemefficient algorithmsnested constraintsconcave utilitiesproduction- sales planning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Integer programming (90C10) Production models (90B30)

Related Items (8)

Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ A separable integer programming problem equivalent to its continual version ⋮ Two algorithms for maximizing a separable concave function over a polymatroid feasible region ⋮ An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints ⋮ An algorithm for a separable integer programming problem with cumulatively bounded variables ⋮ On an optimization problem with nested constraints ⋮ A Decomposition Algorithm for Nested Resource Allocation Problems ⋮ Minimum cost flow algorithms for series-parallel networks

This page was built for publication: Efficient Algorithms for a Selection Problem with Nested Constraints and Its Application to a Production-Sales Planning Model