Warm Start of the Primal-Dual Method Applied in the Cutting Plane Scheme

Logilab Technical Report 1996.3

J. Gondzio

Abstract
A practical warm-start procedure is described for the infeasible primal-dual interior-point method employed to solve the restricted master problem within the cutting-plane method. In contrast to the theoretical developments in this field, the approach presented in this paper does not make the unrealistic assumption that the new cuts are shallow. Moreover, it treats systematically the case when a large number of cuts are added at one time. The technique proposed in this paper has been implemented in the context of HOPDM , the state of the art, yet public domain, interior-point code. Numerical results confirm a high degree of efficiency of this approach: regardless of the number of cuts added at one time (can be thousands in the largest examples) and regardless of the depth of the new cuts, reoptimizations are usually done with a few additional iterations.

Key words: Warm Start, Primal-Dual Algorithm, Cutting Plane Methods.


Text
PDF TR1996.3.pdf.
History:
Written: May 1996, revised April 1997.
Published: Mathematical Programming 83(1998) 125--143.