Absolute value programming

Absolute value programming

0.00 Avg rating0 Votes
Article ID: iaor20072589
Country: Netherlands
Volume: 36
Issue: 1
Start Page Number: 43
End Page Number: 53
Publication Date: Jan 2007
Journal: Computational Optimization and Applications
Authors:
Abstract:

We investigate equations, inequalities and mathematical programs involving absolute values of variables such as the equation Ax+B|x| = b, where A and B are arbitrary m × n real matrices. We show that this absolute value equation is NP-hard to solve, and that solving it with B = I solves the general linear complementarity problem. We give sufficient optimality conditions and duality results for absolute value programs as well as theorems of the alternative for absolute value inequalities. We also propose concave minimization formulations for absolute value equations that are solved by a finite succession of linear programs. These algorithms terminate at a local minimum that solves the absolute value equation in almost all solvable random problems tried.

Reviews

Required fields are marked *. Your email address will not be published.