An Application-Oriented Guide for Designing Lagrangean Dual Ascent Algorithms

A Lagrangean dual ascent procedure is a specialized algorithm, tailored for a particular model, that may effectively solve a Lagrangean dual. We present a design framework for constructing such algorithms. Our framework is adapted to design Lagrangean dual ascent algorithms for the generalized assignment and constrained arborescence problems.