Computational complexity of parametric linear programming |
| |
| Authors: | Katta G. Murty |
| |
| Affiliation: | (1) The University of Michigan, Ann Arbor, MI, USA |
| |
| Abstract: | ![]()
We establish that in the worst case, the computational effort required for solving a parametric linear program is not bounded above by a polynomial in the size of the problem.This research is partially supported by Air Force Office of Scientific Research, Air Force Number AFOSR-78-3646. |
| |
| Keywords: | Parametric Linear Program Computational Complexity Worst Case Behavior Exponential Growth |
| 本文献已被 SpringerLink 等数据库收录！ |
