Abstract
The authors present, in a tutorial way, the basic ideas involved in Narendra Karmarkar's projective scaling algorithm for solving linear programming problems and to show two of its most important extensions, the dual and the dual affine algorithms. Implementation issues regarding the practical solution of the search direction are also discussed. A new parallel preconditioned conjugate gradient solution technique is introduced. This parallel search direction solver provides almost perfect p speedup for p processors. A summary of application results on a very large scale integration (VLSI) circuit layout and economic dispatch in power systems is presented. In all these applications, the interior point methods exhibit an average speedup of about six to 100 times over a well-known MINOS simplex code.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Canadian Journal of Electrical and Computer Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
