Linear Programming Problem With Bounded Variables

About the book

Contents

• The subject “Linear Programming” forms a part of “Operations Research” which deals with systematic study of system of operations. This term was first introduced by Mc-Closky and Trefthenin 1939. This subject came in existence during World War II.
• Chapter 1 is an introductory chapter and gives a briefhistorical backgroundand latest research work done in the fieldof linear programming problems with bounded variables and importance of sensitivity analysis.It also describes the dual simplex method for linear programming with bounded variables.
• Chapter 2 deals with basic sensitivity analysis in linear programming with bounded variables.There are seven basic types of changes in the data, like, change in cost vector or requirement vector, addition or deletion of a constraint, addition or deletion of a variable and change in the coefficient matrix. All these aspects have been discussed in details in Chapter 2 along with numerical problems.
• Chapter 3 deals with positive sensitivity in linear programming problems with bounded variables. In this chapter, we have discussed some propertiesof PSA, the relationship between PSA and sensitivity analysis using optimal basesand the relationship between PSA and sensitivity analysis using optimal partition.

Editions

Subjects