ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

On the bottleneck linear programming problem

Seshan, CR and Achary, KK (1982) On the bottleneck linear programming problem. In: European Journal of Operational Research, 9 (4). pp. 347-352.

Full text not available from this repository. (Request a copy)
Official URL: http://dx.doi.org/10.1016/0377-2217(82)90178-3

Abstract

In this paper, the results on primal methods for Bottleneck Linear Programming (BLP) problem are briefly surveyed, the primal method is presented and the degenerate case related to Bottleneck Transportation Problem (BTP) is explicitly considered. The algorithm is based on the idea of using auxiliary coefficients as is done by Garfinkel and Rao [6]. The modification presented for the BTP rectifies the defect in Hammer's method in the case of degenerate basic feasible solution. Illustrative numerical examples are also given.

Item Type: Journal Article
Publication: European Journal of Operational Research
Publisher: Elsevier Science
Additional Information: Copyright of this article belongs to Elsevier Science.
Department/Centre: Division of Physical & Mathematical Sciences > Mathematics
Date Deposited: 22 Dec 2009 05:19
Last Modified: 23 Feb 2012 06:39
URI: http://eprints.iisc.ac.in/id/eprint/23338

Actions (login required)

View Item View Item