On using approximations of the Benders master problem

DOI10.1016/0377-2217(94)90032-9zbMath0810.90096OpenAlexW1999075162MaRDI QIDQ1333479

Kaj Holmberg

Publication date: 17 April 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90032-9

zbMATH Keywords

Lagrange multipliersheuristicsLagrange dualityBenders' decompositionsurrogate duality

Mathematics Subject Classification ID

Mixed integer programming (90C11) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

New bounding and decomposition approaches for MILP investment problems: multi-area transmission and generation planning under policy constraints ⋮ Application of Benders' decomposition to power plant preventive maintenance scheduling ⋮ Pre-positioning disaster response facilities at safe locations: an evaluation of deterministic and stochastic modeling approaches ⋮ A hybrid approach of bundle and Benders applied large mixed linear integer problem ⋮ The Star Degree Centrality Problem: A Decomposition Approach ⋮ Speed-up Benders decomposition using maximum density cut (MDC) generation ⋮ The Benders decomposition algorithm: a literature review ⋮ A new approach based on the surrogating method in the project time compression problems ⋮ A demand-shifting feasibility algorithm for Benders decomposition.

Cites Work

• A Benders decomposition based heuristic for the hierarchical production planning problem
• On the convergence of cross decomposition
• Large-scale mixed integer programming: Benders-type heuristics
• Partitioning procedures for solving mixed-variables programming problems
• Decomposition Principle for Linear Programs
• Surrogate Dual Multiplier Search Procedures in Integer Programming
• A Cross Decomposition Algorithm for Capacitated Facility Location
• A Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership
• Some relationships between lagrangian and surrogate duality in integer programming
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Expedients for solving some specially structured mixed-integer programs
• Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
• Multicommodity Distribution System Design by Benders Decomposition
• Surrogate Constraint Duality in Mathematical Programming
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• Cross decomposition for mixed integer programming
• Validation of subgradient optimization
• Minimization of unsmooth functionals
• Surrogate Mathematical Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item