ISSN:
1436-4646
Keywords:
Parametric linear program
;
continuous optimal solution
;
extended Bland's anticycling dual simplex algorithm
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract This note shows that, if a parametric linear program, min{cx: Ax = b 1 θ+b 2,x≥0}, has optimal solutions in an interval $$\left[ {\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{\theta } ,\bar \theta } \right]$$ forθ, then, depending on degeneracy, the solutions(θ) is a continuous vector function or a continuous point-to-set mapping. In the latter case an algorithm is introduced to solve the problem and generate a continuous vector solution in $$\left[ {\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{\theta } ,\bar \theta } \right]$$ .
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01580857
Permalink