A further study on inverse linear programming problems |
| |
Institution: | 1. Department of Mathematics, City University of Hong Kong, Tat Chee Avenue, Hong Kong China;2. Institute of Systems Science, Academia Sinica, Beijing, People''s Republic of China |
| |
Abstract: | In this paper we continue our previous study (Zhang and Liu, J. Comput. Appl. Math. 72 (1996) 261–273) on inverse linear programming problems which requires us to adjust the cost coefficients of a given LP problem as less as possible so that a known feasible solution becomes the optimal one. In particular, we consider the cases in which the given feasible solution and one optimal solution of the LP problem are 0–1 vectors which often occur in network programming and combinatorial optimization, and give very simple methods for solving this type of inverse LP problems. Besides, instead of the commonly used l1 measure, we also consider the inverse LP problems under l∞ measure and propose solution methods. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|