INTERIOR POINT ALGORITHMS FOR LINEAR PROGRAMMING AND THEIR BOUNDARY BEHAVIOUR
INTERIOR POINT ALGORITHMS FOR LINEAR PROGRAMMING AND THEIR BOUNDARY BEHAVIOUR
No Thumbnail Available
Date
1997-07
Authors
GWANDI, CHARLES
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
ABSTRACT
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.
Description
Keywords
INTERIOR, POINT, ALGORITHMS, LINEAR, PROGRAMMING, BOUNDARY, BEHAVIOUR