A separable integer programming problem equivalent to its continual version

DOI10.1016/0771-050X(81)90015-2zbMath0459.90053MaRDI QIDQ1152307

Z. Waksman, A. M. Galperin

Publication date: 1981

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmsnested constraintspiecewise linear continuation of the cost functionspiecewise linear convex functionsseparable integer programmingsuccessive reduction in size

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items

An algorithm for a separable integer programming problem with cumulatively bounded variables ⋮ On an optimization problem with nested constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear programming with cumulatively bounded variables
• A General Algorithm for the Optimal Distribution of Effort
• Efficient Algorithms for a Selection Problem with Nested Constraints and Its Application to a Production-Sales Planning Model
• The Status of Mathematical Inventory Theory

This page was built for publication: A separable integer programming problem equivalent to its continual version