Abstract
We formulate the NP-hard n-dimensional knapsack feasibility problem as an equivalent absolute value equation (AVE) in an n-dimensional noninteger real variable space and propose a finite succession of linear programs for solving the AVE. Exact solutions are obtained for 1,880 out of 2,000 randomly generated consecutive knapsack feasibility problems with dimensions between 500 and one million. For the 120 approximately solved problems the error consists of exactly one noninteger component with value in (0, 1), which when replaced by 0, results in a relative error of less than 0.04%. We also give a necessary and sufficient condition for the solvability of the knapsack feasibility problem in terms of minimizing a concave quadratic function on a polyhedral set. Average time for solving exactly a million-variable knapsack feasibility problem was less than 14 s on a 4 GB machine.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chung S.-J.: NP-completeness of the linear complementarity problem. J. Optim. Theory Appl. 60, 393–399 (1989)
Horst R., Pardalos P., Thoai N.V.: Introduction to Global Optimization. Kluwer, Dordrecht (1995)
ILOG: Incline Village, Nevada. ILOG CPLEX 9.0. User’s Manual (2003). http://www.ilog.com/products/cplex/
Mangasarian, O.L.: Nonlinear Programming. McGraw-Hill, New York (1969) [Reprint: SIAM Classic Appl. Math., vol. 10, Philadelphia (1994)]
Mangasarian O.L.: The linear complementarity problem as a separable bilinear program. J. Global Optim. 6, 153–161 (1995)
Mangasarian, O.L.: Machine learning via polyhedral concave minimization. In: Fischer, H., Riedmueller, B., Schaeffler, S. (eds.) Applied Mathematics and Parallel Computing—Festschrift for Klaus Ritter, pp. 175–188. Physica-Verlag A Springer-Verlag Company, Heidelberg (1996). ftp://ftp.cs.wisc.edu/math-prog/tech-reports/95-20.ps
Mangasarian, O.L.: Solution of general linear complementarity problems via nondifferentiable concave minimization. Acta Math. Vietnam. 22(1), 199–205 (1997). ftp://ftp.cs.wisc.edu/math-prog/tech-reports/96-10.ps
Mangasarian, O.L.: Minimum-support solutions of polyhedral concave programs. Optimization 45, 149–162 (1999). ftp://ftp.cs.wisc.edu/math-prog/tech-reports/97-05.ps
Mangasarian, O.L.: Absolute value equation solution via concave minimization. Optim. Lett. 1(1), 3–8 (2007). ftp://ftp.cs.wisc.edu/pub/dmi/tech-reports/06-02.pdf
Mangasarian, O.L.: A generlaized newton method for absolute value equations. Optim. Lett. (to appear). Technical Report 08-01, Data Mining Institute, Computer Sciences Department, University of Wisconsin, May 2008. ftp://ftp.cs.wisc.edu/pub/dmi/tech-reports/08-01.pdf
Mangasarian, O.L., Meyer, R.R.: Absolute value equations. Linear Algebra Appl. 419, 359–367 (2006). ftp://ftp.cs.wisc.edu/pub/dmi/tech-reports/05-06.pdf
MATLAB: User’s Guide. The MathWorks, Inc., Natick (1994–2006). http://www.mathworks.com
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mangasarian, O.L. Knapsack feasibility as an absolute value equation solvable by successive linear programming. Optim Lett 3, 161–170 (2009). https://doi.org/10.1007/s11590-008-0102-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-008-0102-9