Computational complexity of parametric linear programming
β Scribed by Katta G. Murty
- Publisher
- Springer-Verlag
- Year
- 1980
- Tongue
- English
- Weight
- 408 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper describes an approximate solution procedure for quadratic programming problems using parametric linear programming. Limited computational experience suggests that the approximation can be expected to be "good." ## PROBLEM DEFINITION We define the quadratic programming problem: Assume
In this paper the possibility of the identification of a complete fuzzy decision (not only the maximizing alternative) in fuzzy linear programming by use of the parametric programming technique is presented. Also, it is shown that this fact can be useful in the Zimmermann approach to multiple object