𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Complexity of linear programming
✍ J.F. Traub; H. WoΕΊniakowski πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 415 KB
Quadratic as parametric linear programmi
✍ Robert J. Townsley; Wilfred Candler πŸ“‚ Article πŸ“… 1972 πŸ› John Wiley and Sons 🌐 English βš– 329 KB

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

The use of parametric programming in fuz
✍ Stefan Chanas πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 439 KB

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