Knapsack feasibility as an absolute value equation solvable by successive linear programming

DOI10.1007/s11590-008-0102-9zbMath1173.90474OpenAlexW2160639883MaRDI QIDQ1024724

Olvi L. Mangasarian

Publication date: 17 June 2009

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-008-0102-9

zbMATH Keywords

absolute value equationssuccessive linear programmingknapsack feasibility

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27)

Related Items

Unified smoothing functions for absolute value equation associated with second-order cone, On Picard-SHSS iteration method for absolute value equation, The relaxed nonlinear PHSS-like iteration method for absolute value equations, Uniqueness of integer solution of linear equations, Sufficient conditions for the unsolvability and solvability of the absolute value equation, A generalized Newton method for absolute value equations associated with second order cones, Semidefinite Relaxation Methods for Tensor Absolute Value Equations, A three-step iterative method for solving absolute value equations, An exact penalty global optimization approach for mixed-integer programming problems, Continuous reformulations for zero-one programming problems, A New Fixed-Time Dynamical System for Absolute Value Equations, TWO CSCS-BASED ITERATION METHODS FOR SOLVING ABSOLUTE VALUE EQUATIONS, Unnamed Item, Interval algorithm for absolute value equations, On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems, A generalized Newton method for absolute value equations associated with circular cones, Tensor absolute value equations, A smoothing Newton method for absolute value equation associated with second-order cone, Exact penalty functions for nonlinear integer programming problems, Probability of unique integer solution to a system of linear equations, Modified HS conjugate gradient method for solving generalized absolute value equations, On the solvability and Picard-type method for absolute value matrix equations

Uses Software

• Matlab
• CPLEX

Cites Work

• Absolute value equations
• NP-completeness of the linear complementarity problem
• Solution of general linear complementarity problems via nondifferentiable concave minimization
• The linear complementarity problem as a separable bilinear program
• Introduction to global optimization
• Absolute value equation solution via concave minimization
• Minimum-support solutions of polyhedral concave programs^*
• Unnamed Item
• Unnamed Item