Absolute value linear programming

DOI10.1007/S10898-025-01569-3MaRDI QIDQ6876209zbMATH OpenFDO

Authors Milan Hladík, David Hartman

Publication date 13 January 2026

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10898-025-01569-3

zbMATH Keywords

linear programmingnonsmooth optimizationinterval analysisNP-hardness

Mathematics Subject Classification ID

Linear programming (90C05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Integer programming (90C10)

Cites work

• scientific article; zbMATH DE number 3880020 (Why is no real title available?)
• scientific article; zbMATH DE number 3471507 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• A branch-and-bound method for absolute value programs
• A new concave minimization algorithm for the absolute value equation solution
• Absolute value equations
• Absolute value programming
• An algorithm for computing all solutions of an absolute value equation
• An overview of absolute value equations: from theory to solution methods and challenges
• Bounds for the solutions of absolute value equations
• Calculating the exact bounds of optimal values in LP with interval coefficients
• Characterization of Unique Solvability of Absolute Value Equations: An Overview, Extensions, and Future Directions
• Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
• Disjunctive programming
• Duality gap in interval linear programming
• Error bounds and a condition number for the absolute value equations
• How to determine basis stability in interval linear programming
• Interval Methods for Systems of Equations
• Interval analysis and automatic result verification
• Interval linear programming and extensions
• Introduction to Interval Analysis
• Linear Optimization Problems with Inexact Data
• Linear interval inequalities
• Linear programming with interval coefficients
• Linear programming with variable matrix entries
• On approximation of the best case optimal value in interval linear programming
• On equivalent reformulations for absolute value equations
• Optimal correction of the absolute value equations
• Properties of the Solution Set of Absolute Value Equations and the Related Matrix Classes
• Representing piecewise linear functions by functions with small arity
• Sufficient condition of basis stability of an interval linear programming problem
• Unsupervised classification via convex absolute value inequalities

This page was built for publication: Absolute value linear programming

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