A resource decomposition algorithm for general mathematical programs

DOI10.1007/BFb0120932zbMath0449.90085MaRDI QIDQ3896856

Laurence A. Wolsey

Publication date: 1981

Published in: Mathematical Programming Studies (Search for Journal in Brave)

zbMATH Keywords

sensitivity analysisduality theoryglobal optimalitybilinear programsBenders' algorithmpostoptimality analysisoptimal dual solutionresource decomposition algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20)

Related Items

Petroleum supply planning: reformulations and a novel decomposition algorithm, Subadditive approaches in integer programming, Partitioning procedure for polynomial optimization, Decomposition in global optimization, Reduction of indefinite quadratic programs to bilinear programs, Decomposition in general mathematical programming, An elementary survey of general duality theory in mathematical programming, L-shaped decomposition of two-stage stochastic programs with integer recourse, Generalized primal-relaxed dual approach for global optimization, Cross decomposition for mixed integer programming, Primal-relaxed dual global optimization approach