Two general methods for inverse optimization problems

Applied Mathematics Letters

Volumn 12, Issue 2, 1999, Pages 69-72

  Yang, C ^a   Zhang, J ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Column generation method; Ellipsoid method; Revised simplex method

Indexed keywords

EID: 0002542112     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-9659(98)00151-7     Document Type: Article

References (4)

1. D. Burton and Ph.L. Toint, On an instance of the inverse shortest paths problem, Mathematical Programming 53, 45-61, (1992).
2. S. Xu and J. Zhang, An inverse problem of the weighted shortest path problem, Japan Journal of Industrial and Applied Mathematics 12, 47-60, (1995).
3. J. Zhang, Z. Liu and Z. Ma, On the inverse problem of minimum spanning tree with partition constraints, Mathematical Methods of Operations Research 44, 171-188, (1996).
4. J. Zhang and Z. Liu, Calculating some inverse linear programming problems, Journal of Computational and Applied Mathematics 72, 261-273, (1996).