•1 min read•from Towards Data Science
How Benders Decomposition Works, Part II: Feasibility Cuts
Learning about Farkas' lemma and how it can inform Benders decomposition to learn from infeasibility, applied to the capacitated facility location problem.
The post How Benders Decomposition Works, Part II: Feasibility Cuts appeared first on Towards Data Science.
Want to read more?
Check out the full article on the original site
Tagged with
#Benders Decomposition
#Feasibility Cuts
#Farkas' Lemma
#Infeasibility
#Capacitated Facility Location
#Optimization
#Mathematical Programming
#Linear Programming
#Decomposition Methods
#Facility Location Problem
#Integer Programming
#Cutting Plane Methods
#Algorithm
#Data Science
#Constraint Generation
#Subproblems
#Master Problem
#Dual Problem
#Relaxation
#Solver