179
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

An interior-point algorithm for solving inverse linear optimization problem

&
Pages 373-386 | Received 31 Jan 2011, Accepted 11 Oct 2011, Published online: 19 Jan 2012

References

  • Ahuja , RK and Orlin , JB . 2001 . Inverse optimization . Oper. Res. , 49 : 771 – 783 .
  • Bazaraa , MS , Jarvis , JJ and Sherali , HD . 1990 . Linear Programming and Network Flows , New York : John Wiley and Sons .
  • Burton , D and Toint , PhL . 1992 . On an instance of the inverse shortest path problem . Math. Program. , 53 : 45 – 61 .
  • Fletcher , R and Leyffer , S . 2004 . Solving mathematical programs with complementarity constraints as non-linear programs . Optim. Methods Software , 19 : 15 – 40 .
  • Fletcher , R , Leyffer , S , Ralph , D and Scholtes , S . 2006 . Local convergence of SQP methods for mathematical programs with equilibrium constraints . SIAM J. Optim. , 17 : 259 – 286 .
  • Huang , S and Liu , Z . 1999 . On the inverse problem of linear programming and its application to minimum weight perfect k-matching . European J. Oper. Res. , 112 : 421 – 426 .
  • Mangasarian , OL . 2004 . A Newton method for linear programming . J. Optim. Theory Appl. , 121 : 1 – 18 .
  • Vanderbei , RJ and Shanno , DF . 1999 . An interior-point algorithm for nonconvex non-linear programming . Comput. Optim. Appl. , 13 : 231 – 252 .
  • Wang , L . 2009 . Cutting plane algorithms for the inverse mixed integer linear programming problem . Oper. Res. Lett. , 37 : 114 – 116 .
  • Xiao , X , Zhang , L and Zhang , J . 2009 . A smoothing Newton method for a type of inverse semi-definite quadratic programming problem . J. Comput. Appl. Math. , 223 : 485 – 498 .
  • Yang , X and Zhang , J . 2007 . Partial inverse assignment problems under ℓ1 norm . Oper. Res. Lett. , 35 : 23 – 28 .
  • Zhang , J and Liu , Z . 1996 . Calculating some inverse linear programming problems . J. Comput. Appl. Math. , 72 : 261 – 273 .
  • Zhang , J and Liu , Z . 1999 . A further study on inverse linear programming problem . J. Comput. Appl. Math. , 106 : 345 – 359 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.