Efficient Algorithms for a Selection Problem with Nested Constraints and Its Application to a Production-Sales Planning Model
From MaRDI portal
Publication:3873922
DOI10.1137/0318019zbMath0434.90067MaRDI QIDQ3873922
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
selection problem; efficient algorithms; nested constraints; concave utilities; production- sales planning
68Q25: Analysis of algorithms and problem complexity
90C90: Applications of mathematical programming
90C10: Integer programming
90B30: Production models
Related Items
An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints, Two algorithms for maximizing a separable concave function over a polymatroid feasible region