Solving linear programming using Newton method and Goldstein conditions
MetadataShow full item record
CitationKhosravi, P., Navidi, H. ve Malek, A. (2009). Solving linear programming using Newton method and Goldstein conditions. Maltepe Üniversitesi. s. 319.
The aim of this paper is to find an exact least 2-norm solution to the dual linear programming problem and to generate an exact solution to the primal programming problem. The Newton method is proposed for solving linear programs with very large numbers of constraints and variables. We use Goldstein conditions in order to find a suitable step-size in each iteration. The proposed method is based on the apparently overlooked fact that the dual of an exterior penalty formulation of a linear program provides an exact least 2-norm solution to the dual of the linear program. Solving the dual yields an exact least 2-norm solution to the dual and the exact least 2-norm solution to dual problem can be used to generate an exact primal solution. A simple prototype of the method is given in eleven lines of MATLAB code. Encouraging computational results are presented.
SourceInternational Conference of Mathematical Sciences
- Makale Koleksiyonu 
The following license files are associated with this item: