Technical Note—The One-Dimensional Generalized Lagrange Multiplier Problem

DOI10.1287/OPRE.25.2.338MaRDI QIDQ4162979zbMATH OpenOpenAlexFDO

Authors Harvey J. Greenberg

Publication date 1977

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.25.2.338

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cited in

(3)

• Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint
• A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints
• An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints

This page was built for publication: Technical Note—The One-Dimensional Generalized Lagrange Multiplier Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4162979)