A separable integer programming problem equivalent to its continual version

DOI10.1016/0771-050X(81)90015-2MaRDI QIDQ1152307zbMATH OpenFDO

Authors Anatoly Galperin, Z. Waksman

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)

Cites work

• scientific article; zbMATH DE number 3427118 (Why is no real title available?)
• scientific article; zbMATH DE number 3121293 (Why is no real title available?)
• scientific article; zbMATH DE number 3331350 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• 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
• Nonlinear programming with cumulatively bounded variables
• The Status of Mathematical Inventory Theory

Cited in

(2)

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

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

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