DEVELOPMENT OF A LINEAR PROGRAMMING PACKAGE

Abstract

Linear Programming (LP) package is useful to solve IP models used in industry, military, agriculture, economics, transportation and health systems. In this package, LP models are solved using simplex and dual simplex methods. The simplex method employs an iterative process that starts at a feasible corner point, and systematically moves from one feasible extreme point to another until the optimum point is reached. The dual simplex method starts from a infeasible but (better than) optimal sol-ution, maintaining optimality all the time. In this method, approach is in opposite direction as compared to the simplex method. This package is developed in MS-FOtTRAN on IBM-PC. It is highly interacting and produces optimal solution for primal as well as dual.