Solving inverse optimization problems in linear programming: a geometric and algorithmic approach

DOI10.22080/CJMS.2024.28094.1729MaRDI QIDQ6948146zbMATH OpenFDO

Authors Z. Akbari

Publication date 5 August 2025

Published in Caspian Journal of Mathematical Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.22080/CJMS.2024.28094.1729

zbMATH Keywords

convex quadratic programminggradient projection methodinverse optimizationKarush-Kuhn-Tucker (KKT) conditionslinear programmingresource allocation

Mathematics Subject Classification ID

Linear programming (90C05) Applications of mathematical programming (90C90)

Cites work

• A further study on inverse linear programming problems
• An interior-point algorithm for solving inverse linear optimization problem
• Calculating some inverse linear programming problems
• Finding the nearest point in A polytope
• scientific article; zbMATH DE number 1086909 (Why is no real title available?)
• scientific article; zbMATH DE number 852525 (Why is no real title available?)
• Inverse conic programming with applications
• Numerical Optimization
• On an instance of the inverse shortest paths problem
• On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching
• On the use of an inverse shortest paths algorithm for recovering linearly correlated costs

This page was built for publication: Solving inverse optimization problems in linear programming: a geometric and algorithmic approach

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