Optimization with an approximate Lagrangian
From MaRDI portal
Publication:4775704
DOI10.1007/BF01585515zbMath0287.90024OpenAlexW2009983900MaRDI QIDQ4775704
Publication date: 1974
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585515
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Inventory, storage, reservoirs (90B05)
Related Items (2)
Objective function approximations in mathematical programming ⋮ Heuristic methods and applications: A categorized survey
Cites Work
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Solution of the Lorie-Savage and Similar Integer Programming Problems by the Generalized Lagrange Multiplier Method
- An Algorithm to Solve Finite Separable Single-Constrained Optimization Problems
- Primal Decomposition of Mathematical Programs by Resource Allocation: I—Basic Theory and a Direction-Finding Procedure
- Optimal Weapon Allocation with Overlapping Area Defenses
This page was built for publication: Optimization with an approximate Lagrangian