An interior-point algorithm for solving inverse linear optimization problem

DOI10.1080/02331934.2011.637111MaRDI QIDQ2903128zbMATH OpenOpenAlexFDO

Authors Z. Akbari, M. Reza Peyghami

Publication date 23 August 2012

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2011.637111

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• An Interior-Point Algorithm for Linearly Constrained Optimization
• scientific article; zbMATH DE number 1097715
• An interior point method for linear programming
• scientific article; zbMATH DE number 4031392
• Interior proximal point algorithm for linear programs
• Interior point algorithms in linear optimization
• Interior-point algorithm for linear optimization based on a new search direction
• scientific article; zbMATH DE number 1559133
• scientific article; zbMATH DE number 269555
• The modified interior point algorithm for linear optimization

Cites work

• A Newton method for linear programming
• A further study on inverse linear programming problems
• A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
• An interior-point algorithm for nonconvex nonlinear programming
• Calculating some inverse linear programming problems
• Cutting plane algorithms for the inverse mixed integer linear programming problem
• Inverse Optimization
• Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
• 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
• Partial inverse assignment problems under \(l_{1}\) norm
• Solving mathematical programs with complementarity constraints as nonlinear programs

Cited in

(4)

• Solving inverse optimization problems in linear programming: a geometric and algorithmic approach
• A gradient based algorithm to solve inverse plane bimodular problems of identification
• Predictor-correct interior point method for solving the inverse general linear programming problem
• Inverse optimization for multi-objective linear programming

This page was built for publication: An interior-point algorithm for solving inverse linear optimization problem

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