Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints

DOI10.1007/BF01585097zbMath0489.90069OpenAlexW2013484861WikidataQ56324203 ScholiaQ56324203MaRDI QIDQ3951912

No author found.

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585097

zbMATH Keywords

linear constraintspre-processingsubgradient optimizationLagrangian dual of discrete programmingLagrangian subproblemseparable nonlinear objective function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30)

Related Items (5)

A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem ⋮ An efficient algorithm for multi-dimensional nonlinear knapsack problems ⋮ Convergent Lagrangian and domain cut method for nonlinear knapsack problems ⋮ The geometry of complete linear maps ⋮ Complete collineations and blowing up determinantal ideals

Cites Work

• Notes on the Problem of the Allocation of Resources to Activities in Discrete Quantities
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• An Algorithm for Nonlinear Knapsack Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints