The Generalized Slack Variable Linear Program
The dilemma of when to cease analysis of a subproblem and go on to the next subproblem in convex programming is an especially difficult one. This paper views convex programming as an extension of linear programming and focuses attention on the analysis of a given subproblem. Specifically, if K = {x|Ax \le b} is bounded with a nonempty interior and represents a residual unsearched region in some convex programming algorithm, what is (are) the "best" trial point(s) which can be selected? The generalized slack variable linear program (GSVLP) provides a mechanism for implementing trial point selection based on many strategies. Several implications of the L<sub>2</sub> norm are revealed which are especially important in constraint deletion and rate of reduction of the hypervolume of the residual search region K.
Year of publication: |
1977
|
---|---|
Authors: | Mattheiss, T. H. ; Widhelm, William B. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 23.1977, 8, p. 859-871
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
The generalized slack variable linear program
Mattheiss, T. H., (1977)
-
Acceleration of Lagrangian colum-generation algorithms by penalty function methods
O'Neill, Richard P., (1976)
-
The evaluation of sponsored research in energy storage
Widhelm, William B., (1980)
- More ...