Author:
Liu Xiao,Jiang Tao,Li Hao-hao
Abstract
AbstractIn this paper, weak optimal inverse problems of interval linear programming (IvLP) are studied based on KKT conditions. Firstly, the problem is precisely defined. Specifically, by adjusting the minimum change of the current cost coefficient, a given weak solution can become optimal. Then, an equivalent characterization of weak optimal inverse IvLP problems is obtained. Finally, the problem is simplified without adjusting the cost coefficient of null variable.
Publisher
Springer Science and Business Media LLC
Reference27 articles.
1. S Ahmed, Y Guan. The inverse optimal value problem, Mathematical Programming, 2005, 102(1): 91–110.
2. R K Ahuja, J B Orlin. Inverse optimization, Operations Research, 2001, 49(5): 771–783.
3. M S Bazaraa, J J Jarvis. Linear programming and network flows, J Wiley, New York, 1977.
4. D Burton, P L Toint. On the use of an inverse shortest paths algorithm for recovering linearly correlated costs, Mathematical Programming, 1994, 63(1): 1–22.
5. M Fiedler, J Nedoma, J Ramík, J Rohn, K Zimmermann. Linear optimization problems within exact data, Springer-Verlag, New York, 2006.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献