Title :
Generalized linear programming with line searches
Author :
Hearn, Donald W. ; Lawphongpanich, Siriphong
Author_Institution :
Dept. of Ind. & Syst. Eng., Florida Univ., Gainesville, FL, USA
Abstract :
The generalized linear programming family of methods (Dantzig-Wolfe decomposition, dual cutting plane, etc.) can be accelerated by the addition of (inexact) line searches in the dual space. Convergence results for this method are given, and a summary of computational experience is presented. The results of solving two sets of problems, namely, linear and quadratic integer programs, are summarized
Keywords :
convergence; duality (mathematics); linear programming; search problems; Dantzig-Wolfe decomposition; convergence; dual cutting plane; dual space; generalized linear programming; line searches; quadratic integer programs; Acceleration; Aerospace industry; Convergence; Lagrangian functions; Linear programming; Operations research; Systems engineering and theory; Upper bound;
Conference_Titel :
Decision and Control, 1989., Proceedings of the 28th IEEE Conference on
Conference_Location :
Tampa, FL
DOI :
10.1109/CDC.1989.70313
