๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A further study on inverse linear programming problems

โœ Scribed by Jianzhong Zhang; Zhenhong Liu

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
599 KB
Volume
106
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 ll measure, we also consider the inverse LP problems under I~ measure and propose solution methods. (~

๐Ÿ“œ SIMILAR VOLUMES

On the dual of linear inverse problems
On the dual of linear inverse problems
โœ Peter Kas; Emil Klafszky ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 306 KB
A note on programming problems with line
A note on programming problems with linear-plus-linear-fractional objective functions
โœ Joachim Hirche ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 177 KB

In a recent paper Chadha presented a dual of a maximization problem for the sum of a linear and linear fractional function under linear constraints. His approach is based on assertions of Teterev which have been already proven to be erroneous. The aim of this note is to clarify deficiencies of the p