Generalized Benders decomposition

DOI10.1007/BF00934810zbMath0229.90024OpenAlexW2061962896MaRDI QIDQ2550358

Publication date: 1972

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (only showing first 100 items - show all)

On the identification of the optimal partition for semidefinite optimization ⋮ Genomic feature selection by coverage design optimization ⋮ A new Lagrangian-Benders approach for a concave cost supply chain network design problem ⋮ Concave minimization under linear constraints with special structure ⋮ Algorithms and Software for Convex Mixed Integer Nonlinear Programs ⋮ Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming ⋮ Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming ⋮ Formation of a strategic manufacturing and distribution network with transfer prices ⋮ Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach ⋮ Mathematical formulations for a 1-full-truckload pickup-and-delivery problem ⋮ Improved algorithm for mixed-integer quadratic programs and a computational study ⋮ Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective ⋮ Stochastic Planning and Scheduling with Logic-Based Benders Decomposition ⋮ A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm ⋮ A class of convergent primal-dual subgradient algorithms for decomposable convex programs ⋮ Unnamed Item ⋮ A decomposition approach for global optimum search in QP, NLP and MINLP problems ⋮ The application of generalized Benders decomposition to certain nonconcave programs ⋮ Cutting Plane Algorithm for Convex Generalized Disjunctive Programs ⋮ An integrated plant loading model with economies of scale and scope ⋮ Solving multiple criteria problems by interactive decomposition ⋮ A decomposition method for the min concave cost flow problem with a staircase structure ⋮ Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment ⋮ Uncontrolled inexact information within bundle methods ⋮ A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems ⋮ Minimizing the operation cost of distributed green data centers with energy storage under carbon capping ⋮ Simultaneous Location of Trauma Centers and Helicopters for Emergency Medical Service Planning ⋮ Solving multi-period interdiction via generalized Bender's decomposition ⋮ Combinatorial Benders' Cuts for the Strip Packing Problem ⋮ Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty ⋮ A Scalable Algorithm for Sparse Portfolio Selection ⋮ The multi-period multi-trip container drayage problem with release and due dates ⋮ A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines ⋮ Biconvex Models and Algorithms for Risk Management Problems ⋮ An outer-approximation algorithm for a class of mixed-integer nonlinear programs ⋮ Assembly planning by disjunctive programming and geometrical reasoning ⋮ Some Transportation Problems Under Uncertain Environments ⋮ Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint ⋮ The most probable allocation solution for the p-median problem ⋮ Two linear approximation algorithms for convex mixed integer nonlinear programming ⋮ A partial outer convexification approach to control transmission lines ⋮ On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition ⋮ A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning ⋮ Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts ⋮ A bilinear approach to the pooling problem† ⋮ A risk function for the stochastic modeling of electric capacity expansion ⋮ Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes ⋮ An interior-point Benders based branch-and-cut algorithm for mixed integer programs ⋮ On generating maximal nondominated Benders cuts ⋮ Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems ⋮ Single-facility scheduling by logic-based Benders decomposition ⋮ Optimal engineering design via Benders' decomposition ⋮ Solution of preemptive multi-objective network design problems applying Benders decomposition method ⋮ Estimating the parameters of a fatigue model using Benders' decomposition ⋮ A decomposition approach for solving a broadcast domination network design problem ⋮ A decomposition approach to the two-stage stochastic unit commitment problem ⋮ Finding multiple optimal solutions of signomial discrete programming problems with free variables ⋮ The Benders Dual Decomposition Method ⋮ Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire ⋮ Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches ⋮ Solving two-stage robust optimization problems using a column-and-constraint generation method ⋮ Logic-Based Benders Decomposition for Large-Scale Optimization ⋮ Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization ⋮ Constraint partitioning in penalty formulations for solving temporal planning problems ⋮ Optimization of a complex flexible multibody systems with composite materials ⋮ A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques ⋮ Biconvex sets and optimization with biconvex functions: a survey and extensions ⋮ Decentralized Cooperative Optimization for Multi-criteria Decision Making ⋮ A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints ⋮ A CONVEX SUBMODEL WITH APPLICATION TO SYSTEM DESIGN ⋮ Unnamed Item ⋮ On decomposition in bilinear programming ⋮ Portfolio selection with divisible and indivisible assets: mathematical algorithm and economic analysis ⋮ A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates ⋮ Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization ⋮ Two-stage stochastic optimization for optimal power flow under renewable generation uncertainty ⋮ Outer-approximation algorithms for nonsmooth convex MINLP problems ⋮ A nested benders decomposition approach for telecommunication network planning ⋮ Strict linear prices in non-convex European day-ahead electricity markets ⋮ A constraint generation algorithm for large scale linear programs using multiple-points separation ⋮ Manufacturing start-up problem solved by mixed-integer quadratic programming and multivariate statistical modelling ⋮ A Benders decomposition approach for the robust spanning tree problem with interval data ⋮ Challenges in Optimal Control Problems for Gas and Fluid Flow in Networks of Pipes and Canals: From Modeling to Industrial Applications ⋮ A local relaxation approach for the siting of electrical substations ⋮ The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming ⋮ Preface ⋮ Robust Critical Node Selection by Benders Decomposition ⋮ An optimization method for solving mixed discrete-continuous programming problems ⋮ Unnamed Item ⋮ Convexity and optimization with copulæ structured probabilistic constraints ⋮ On a Three-Level Competitive Pricing Problem with Uniform and Mill Pricing Strategies ⋮ Mean value cross decomposition for nonlinear convex problems ⋮ Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité ⋮ On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs ⋮ Robust Optimization for Electricity Generation ⋮ Generalized primal-relaxed dual approach for global optimization ⋮ A solution procedure for mixed-integer nonlinear programming formulation of supply chain planning with quantity discounts under demand uncertainty ⋮ Mixed-integer quadratic programming ⋮ A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems ⋮ Extension of optimality conditions via supporting functions

Cites Work

This page was built for publication: Generalized Benders decomposition