ISSN:
1573-2878
Keywords:
Linear programming
;
parametric linear programming
;
semicontinuity
;
operations research
;
inequality theory
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract For the widest class of parametric linear programs with continuous dependence of coefficients on parameters, the following theorem is proven: for any parameter vectort 0 in the domain of definition of the maximum, if the set of optimal solutions is bounded, then the maximum is upper semicontinuous att 0. If the same proviso is met also in the dual program, then the maximum must be continuous att 0.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00933875
Permalink