Results 241 to 250 of about 1,887,807 (290)

Stability in Nonlinear Programming

Operations Research, 1970
This paper establishes necessary and sufficient conditions for constraint set stability requiring neither convex constraint functions not convex constraint sets. These conditions then lead to a sufficiency result for the continuity of the optimal objective values as the right-hand side varies. Applications to quasiconvex functions are presented.
James P. Evans, Floyd J. Gould
openaire   +3 more sources

Scaling nonlinear programs

Operations Research Letters, 1981
An automatic procedure for scaling the variables and constraints of a nonlinear optimization problem is proposed and tested. The procedure attempts to reduce the spread of element values of the problem Jacobian. Results obtained using a GRG code show that the proposed scaling method in not consistently successful. Ideas for future work are presented.
Leon S. Lasdon, P. O. Beck
openaire   +2 more sources

Nonlinear programming on a microcomputer

Computers & Operations Research, 1986
We provide a survey of microcomputer-based software for solving nonlinear programs and systems of simultaneous nonlinear equations. Package features are discussed in detail. In addition, the packages are compared with respect to accuracy and efficiency over a set of well-known test problems.
Bruce L. Golden, Edward A. Wasil
openaire   +2 more sources

Nonlinear Complex Programming with Nonlinear Constraints

ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1977
AbstractFollowing Mond [8, 9] a duality theory for nonlinear complex programming problems over polyhedral cones with nonlinear constraints is developed by making use of the linear duality theory.
Das, C., Swarup, K.
openaire   +1 more source

Rates of Stability in Nonlinear Programming

Operations Research, 1976
We give conditions on a nonlinear programming problem for the set of feasible solutions to have stability on the order of a Lipschitz condition. These results then imply conditions for the optimal value of the objective function to satisfy a Lipschitz condition with respect to the right-hand side vector as well as for the set of ϵ-optimal solutions to
Michael H. Stern, Donald M. Topkis
openaire   +2 more sources

Nonlinear programming on generalized networks

ACM Transactions on Mathematical Software, 1987
We describe a specialization of the primal truncated Newton algorithm for solving nonlinear optimization problems on networks with gains. The algorithm and its implementation are able to capitalize on the special structure of the constraints. Extensive computational tests show that the algorithm is capable of solving very large problems.
Ahlfeld, D. P.   +7 more
openaire   +2 more sources

On Symmetric Duality in Nonlinear Programming

Operations Research, 1973
In this study we generalize the formulation of symmetric duality introduced by Dantzig, Eisenberg, and Cottle to include the case where the constraints of the inequality type are defined via closed convex cones and their polars. The new formulation retains the symmetric properties of the original programs.
Mokhtar S. Bazaraa, Jamie J. Goode
openaire   +1 more source

Home - About - Disclaimer - Privacy