Bottleneck linear programming |
| |
| Authors: | Robert S Garfinkel Mendu Rao |
| |
| Institution: | (1) The University of Tennessee, Knoxville, Tenn., USA;(2) The University of Rochester, N.Y., USA |
| |
| Abstract: | The Bottleneck Linear Programming problem (BLP) is to maximizex
0 = max
j
c
j
,x
j
> 0 subject toAx = b, x  0. A relationship between the BLP and a problem solvable by a  greedy algorithm is established. Two algorithms for the BLP are developed and computational experience is reported. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
