Asymptotic Linear Programming.
CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP
Pagination or Media Count:
By suitably modifying the Simplex Algorithm, the author shows how to obtain a parametric closed form for the solution to linear programs, all of whose coefficients may be as complex as rational functions of a real parameter t, in two primary circumstances. Modified author abstract
- Operations Research