Skip to main content
SpringerLink
Log in

Some inverse optimization problems on network

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

In this paper, the authors consider some inverse problems on network, such as the inverse transport problems with gains (IGTP) and the inverse linear fractional minimum cost flow problem (IFFP). Firstly, the authors give the mathematics model of (IGTP) and an efficient method of solving it under l 1 norm; Secondly, taking advantage of the optimality conditions, the authors consider the (IFFP) and give a simple method of solving it. Finally, an numerical example test is also developed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahuja R K and Orlin J B, Inverse Optimization, Part1: Linear Programming and General Problem, Working Paper, Sloan School of Management, MIT, Cambridge, WA, 1998a.

    Google Scholar 

  2. Ahuja R K and Orlin J B, Inverse Optimization, Part 2: Network flow Problem, Working Paper, Sloan School of Management, MIT, Cambridge, WA, 1998b.

    Google Scholar 

  3. Burton D and Toint P L, On an instance of the inverse shortest paths problem, Mathematical Programming, 1992, 53: 45–61.

    Article  MathSciNet  MATH  Google Scholar 

  4. Burton D, Pulleyblank B, and Toint P L, The inverse shortest problem with upper bounds on shortest path costs, Lecture Notes in Economics and Mathematical System, 1997, 450: 156–171.

    Article  MathSciNet  Google Scholar 

  5. Burton D and Toint P L, On the use of an inverse shortest paths problem for recovering linearly corrected costs, Mathematical Programming, 1994, 63: 1–22.

    Article  MathSciNet  MATH  Google Scholar 

  6. Xu S and Zhang J Z, An inverse problem of the weighted shortest path problem, Japanese Journal of Industrial and Applied Mathematics, 1995, 12: 47–59.

    Article  MATH  Google Scholar 

  7. Yang C, Zhang J Z, and Ma Z F, Inverse maximum flow and minimum cut problems, Optimization, 1997, 40: 147–170.

    Article  MathSciNet  MATH  Google Scholar 

  8. Zhang J Z, Ma Z F, and Yang C, A column generation method for inverse shortest path problem, ZOR-Mathematical Methods of Operations Research, 1995, 41: 347–358.

    Article  MathSciNet  MATH  Google Scholar 

  9. Zhang J Z and Cai M C, Inverse problem of minimum cuts, Mathematical Methods of Operations Research, 1998, 47(1): 51–58.

    Article  MathSciNet  MATH  Google Scholar 

  10. Zhang J Z and Liu Z H, A further study on inverse linear programming problems, Journal of Computational and Applied Mathematics, 1999, 106: 345–359.

    Article  MathSciNet  MATH  Google Scholar 

  11. Heuberger C, Inverse Combinatorial Optimization: A Survey on Problems, Methods and Results, Journal of Combinatorial Optimization, 2004, 8: 329–361.

    Article  MathSciNet  MATH  Google Scholar 

  12. Demange M and Monnot J, An introduction to Inverse Combinatorial Problems, Paradigms of combinatorial Optimization: Problems and New Approaches, London-Hoboken(UK-USA): ISTEWILEY, Vangelis Th. Paschos, 2010.

  13. Duin C W and Volgenant A, Some Inverse optimization problems under the Hamming distance, European Journal of operational research, 2006, 170: 887–899.

    Article  MathSciNet  MATH  Google Scholar 

  14. Zhang J Z and Xu S J, Linear Programming, Science Press, Beijing, 1999.

    Google Scholar 

  15. Guan M G and Zheng H D, Linear Programming, Shandong Science Press, Jinan, 1983.

    Google Scholar 

  16. Robert J V, Linear Programming: Foundations and Extensions, International Series in Operations Research, Management Science, 37., Kluwer Academic Publishers, Boston, MA, 2001.

    MATH  Google Scholar 

  17. Chadha S S and Chadha V, Linear fractional programming and duality, CEJOR. 2007, 15: 119–125.

    Article  MathSciNet  MATH  Google Scholar 

  18. Wolf H, A Parametric method for solving the linear fractional programming problem, Operations Research, 1985, 33: 835–841.

    Article  MathSciNet  MATH  Google Scholar 

  19. Schaible S, Fractional programming, Zeitschrift fur Operations Research, 1983, B27: 39–54.

    MathSciNet  Google Scholar 

  20. Zheng H D, A linear fractional programming problem On N-complex, Journal of Applied Mathematics, 1996, 1(19): 158–161.

    Google Scholar 

  21. Xu C, Xu X M, and Wang H F, The fractional minimal cost flow problem on network, Optim Lett, 2011, 5: 307–317.

    Article  MathSciNet  MATH  Google Scholar 

  22. Bondy J A and Murty U S R, Graph theory with applications, Macmillan Press LTD, 1976.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Management, University of Shanghai for Science and Technology, Shanghai, 200093, China

    Cheng Xu & Xiaoming Xu

  2. College of Mathematics, Qingdao University, Qingdao, 266071, China

    Cheng Xu

Authors
  1. Cheng Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaoming Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Cheng Xu.

Additional information

This research is supported by Shanghai leading academic discipline project under Grant No. S30501 and Shandong province leading academic discipline project under Grant No. ZR2010AM033.

This paper was recommended for publication by Editor WANG Shouyang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, C., Xu, X. Some inverse optimization problems on network. J Syst Sci Complex 26, 350–364 (2013). https://doi.org/10.1007/s11424-013-0259-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-013-0259-x

Keywords

Search

Navigation