Surrogate Dual Multiplier Search Procedures in Integer Programming

DOI10.1287/OPRE.32.1.52zbMath0538.90060OpenAlexW2032797095MaRDI QIDQ3325464

Mark H. Karwan, Ronald L. Rardin

Publication date: 1984

Published in: Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

branch and boundoptimal Lagrange multipliersComputational resultssurrogate dual multiplierssearch procedures

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05)

Related Items (30)

On using approximations of the Benders master problem ⋮ On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming ⋮ A surrogate heuristic for set covering problems ⋮ Surrogate duality in a branch-and-bound procedure for integer programming ⋮ Exploiting nested inequalities and surrogate constraints ⋮ Aggregation of constraints in integer programming ⋮ Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs ⋮ Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach ⋮ Matheuristics: survey and synthesis ⋮ A trust region method for the solution of the surrogate dual in integer programming ⋮ RAMP for the capacitated minimum spanning tree problem ⋮ The equity constrained shortest path problem ⋮ Foundation-penalty cuts for mixed-integer programs. ⋮ A surrogate and Lagrangian approach to constrained network problems ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ A relax-and-cut algorithm for the set partitioning problem ⋮ On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints ⋮ Profit-based FMS dynamic part type selection over time for mid-term production planning ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models ⋮ A simple procedure for solving a continuous quadratic mathematical model. ⋮ Improved convergent heuristics for the 0-1 multidimensional knapsack problem ⋮ Some relationships between lagrangian and surrogate duality in integer programming ⋮ A surrogate-based heuristic for production planning problem of orders in small foundries ⋮ On the complexity of surrogate and group relaxation for integer linear programs ⋮ An enumerative algorithm framework for a class of nonlinear integer programming problems ⋮ Calculating surrogate constraints ⋮ Distance confined path problem and separable integer programming ⋮ Revisiting surrogate relaxation for the multidimensional knapsack problem ⋮ On generalized surrogate duality in mixed-integer nonlinear programming ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects

This page was built for publication: Surrogate Dual Multiplier Search Procedures in Integer Programming