A Sequential Algorithm for a Class of Programming Problems with Nonlinear Constraints
The purpose of this paper is to furnish a computational scheme for a class of programming problems with nonlinear constraints. The algorithm is sequential in nature, producing a sequence of feasible solutions whose limit points are optimal solutions of the original problem. Further, with a view to accelerating convergence we suggest two variants of the solution procedure.
Year of publication: |
1974
|
---|---|
Authors: | Jagannathan, R. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 21.1974, 1, p. 13-21
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Assessing specification errors in stochastic discount factor models
Hansen, Lars Peter, (1994)
-
Ex-dividend price behavior of common stocks
Boyd, John H., (1994)
-
A contingent claim approach to performance evaluation
Glosten, Lawrence R., (1993)
- More ...