A parametric problem in linear programming
β Scribed by V.-K.I. Karabegov
- Publisher
- Elsevier Science
- Year
- 1963
- Weight
- 776 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0041-5553
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
Previous methods for solving the nonlinear one-parametric linear programming problem min (c(r)'x IAx = b, x >/ 0) for f β¬ b,PI were based on the simplex method using a considerably extended tableau. The proposed method avoids such an extension. A finite sequence of feasible bases (Bk I k = 1, 2, . .