PATH-FOLLOWING METHODS FOR LINEAR PROGRAMMING

Simple item page
dc.contributor.authorQUABILI, MUHAMMAD MASUDUR RAHMAN
dc.date.accessioned2017-01-13T14:16:14Z
dc.date.available2017-01-13T14:16:14Z
dc.date.issued1999-04
dc.descriptionA thesis submitted to the post-graduate School, Ahmadu Bello University, Zaria, Nigeria, in partial fulfilment of the Requirements for the Degree of DOCTOR OF PHILOSOPHY (MATHEMATICS)en_US
dc.description.abstractIn this thesis a unified treatment of various Path - following methods for linear programming is presented. A modification based on "Specifiic Most Violated Constraints" in Pivot and Probe Algorithm (PAPA) is introduced which ensures early termination of the algorithm. While comparing the Ellipsoid method with Karmarkar's algorirthm it has been shown that the hearts of these two algorithms depend on the solution of weighted least squares subproblems and these subproblems are closely related. Some results related to the volume reduction inequality for the ellipsoid method and convergence inequality for Karmarkar's algorithm have also been obtained. Various types of parameterization of central trajectory and proximity measures have been critically examined. As a result some inequalities which ensures faster convergence in Primal - Dual interior point path - following methods have been obtained.en_US
dc.identifier.urihttp://hdl.handle.net/123456789/8465
dc.language.isoenen_US
dc.subjectPATH-FOLLOWING METHODS,en_US
dc.subjectLINEAR PROGRAMMING,en_US
dc.titlePATH-FOLLOWING METHODS FOR LINEAR PROGRAMMINGen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
PATH-FOLLOWING METHODS FOR LINEAR.pdf
Size:
7.14 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.62 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
SCIENCE