Nonlinear one-parametric bottleneck linear programming


We consider the one-parametric linear bottleneck problem nfln { c (x, t) I x E P ( t ) ) where the bottleneck objective c (x, t) := max (c] (t) I x/> 0) is minimized subject to linear constraints, i.e. P (t) := (x IA (t) 9 x = b (t), x/> 0 ) . All coefficients are assumed to be continuous functions of one real parameter t which varies in a real interval S… (More)
DOI: 10.1007/BF01920308


  • Presentations referencing similar topics