Reduction of nonlinear integer separable programming problems∗

DOI10.1080/00207168808803631zbMath0658.90068OpenAlexW2093291547MaRDI QIDQ3807881

J. Ben Rosen, Panos M. Pardalos

Publication date: 1988

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168808803631

zbMATH Keywords

interpolationlinearizationapproximationpiecewise linear functionsknapsack problemsinteger separable programming

Mathematics Subject Classification ID

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

Related Items (2)

Piecewise linear bounding functions in univariate global optimization ⋮ Exact algorithm for concave knapsack problems: linear underestimation and partition method

Cites Work

• Integer programming formulation of combinatorial optimization problems
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• Computational aspects of two-segment separable programming
• Global minimization of large-scale constrained concave quadratic problems by separable programming
• Methods of Nonlinear 0-1 Programming
• A Survey of Methods for Pure Nonlinear Integer Programming
• An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions
• A Class of Nonlinear Integer Programs Solvable by a Single Linear Program
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• Discrete Optimization Via Marginal Analysis
• Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems

This page was built for publication: Reduction of nonlinear integer separable programming problems^∗