The Direct Power of Adjacent Vertex Programming Methods
How far does the power of the adjacent vertex methods extend in solving non-linear programming problems? This question here gets a partial answer, being restricted to variables and objective functions which are continuous and excluding any transformation or approximation of the original system. The underlying concepts are that of quasi-concavity and quasi-monotonicity. Necessary and sufficient characteristics of the family of objective functions are given in due generality although in some cases subject to several differentiability assumptions. For these latter cases a simple criterion of vector selection is presented. Finally the problem of linear fractional programming is briefly discussed as an example.
Year of publication: |
1965
|
---|---|
Authors: | Martos, B. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 12.1965, 3, p. 241-252
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Nonlinear programming : theory and methods
Martos, Béla, (1975)
-
Martos, Béla, (1978)
-
Optimierungsprobleme mit Betragssummen linearer Formen
Martos, B., (1965)
- More ...