Results

**1 - 2**of**2**### A note on feasibility in Benders Decomposition

, 1999

"... A convex nonlinear programming problem is presented which causes a simplistic application of Benders Decomposition to converge to a nonstationary point. The failure of Benders Decomposition to converge is due to the way in which infeasible subproblems are handled. A new feasibility restoration is pr ..."

Abstract
- Add to MetaCart

(Show Context)
A convex nonlinear programming problem is presented which causes a simplistic application of Benders Decomposition to converge to a nonstationary point. The failure of Benders Decomposition to converge is due to the way in which infeasible subproblems are handled. A new feasibility restoration is proposed and shown to resolve this problem. The new feasibility restoration is also relevant to bundle-based decomposition schemes.