Solving Large Sparse Nonlinear Programs Using GRG
From MaRDI portal
Publication:3993662
DOI10.1287/ijoc.4.1.2zbMath0758.90066OpenAlexW2090975713MaRDI QIDQ3993662
No author found.
Publication date: 13 August 1992
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.4.1.2
Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (18)
Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems ⋮ Using the KKT matrix in an augmented Lagrangian SQP method for sparse constrained optimization ⋮ Adaptive memory programming for constrained global optimization ⋮ Quadratic resource allocation with generalized upper bounds ⋮ Financial planning via multi-stage stochastic optimization. ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Nonlinear optimization with GAMS /LGO ⋮ Asset portfolio optimization using fuzzy mathematical programming ⋮ Analyzing infeasible nonlinear programs ⋮ Nonlinear programming for multiperiod capacity planning in a manufacturing system ⋮ Strategic financial risk management and operations research ⋮ Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem ⋮ Bector-Chandra type duality in fuzzy linear programming with exponential membership functions ⋮ Path relinking and GRG for artificial neural networks ⋮ An empirical study of learning speed in back-propagation networks ⋮ Modifications to the subroutine OPALQP for dealing with large problems ⋮ The nonlinear knapsack problem - algorithms and applications ⋮ Characterization of aggregate fuzzy membership functions using Saaty's eigenvalue approach
Uses Software
This page was built for publication: Solving Large Sparse Nonlinear Programs Using GRG
