INTERIOR POINT ALGORITHMS FOR LINEAR PROGRAMMING AND THEIR BOUNDARY BEHAVIOUR

Simple item page
dc.contributor.authorGWANDI, CHARLES
dc.date.accessioned2014-02-04T09:59:47Z
dc.date.available2014-02-04T09:59:47Z
dc.date.issued1997-07
dc.description.abstractABSTRACT This work presents a survey of recent developments in linear programming. The whole project is divided into four chapters. Chapter one introduces the formulation of the linear programming problem. The graphical method is mentioned. Also mentioned is the simplex method procedure for solving linear programming problems. In chapter two, the concept of duality is introduced. Proof of the fundamental theorem of duality and complementarity slackness theorem are provided. In chapter three, the various interior point algorithms recently developed are critically analyzed. In chapter four, the boundary behaviour of the interior point algorithms is discussed.en_US
dc.identifier.urihttp://hdl.handle.net/123456789/143
dc.language.isoenen_US
dc.subjectINTERIORen_US
dc.subjectPOINTen_US
dc.subjectALGORITHMSen_US
dc.subjectLINEARen_US
dc.subjectPROGRAMMINGen_US
dc.subjectBOUNDARYen_US
dc.subjectBEHAVIOURen_US
dc.titleINTERIOR POINT ALGORITHMS FOR LINEAR PROGRAMMING AND THEIR BOUNDARY BEHAVIOURen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
INTERIOR POINT ALGORITHMS FOR LINEAR PROGRAMMING AND THEIR BOUNDARY BEHAVIOUR.pdf
Size:
2.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.58 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
SCIENCE