Standard Model of Dantzig Based Princing Method in Linear Programming

In linear programming (LP), the objective is to find a solution which optimizes the given linear objective function. The Simplex method developed by G.B. Dantzig in 1947 is an iterative procedure for solving LP problems. But in the case of a large scale problems where the number of constraints is too large, Simplex method doesn't work well. In such cases, Dantgiz-Wolf (DW) decomposition and column generation method are used. In the case of large scale problem, decomposition based pricing (DBP) method is more helpful to solve than these two methods. In this Monograph, we have developed a computer program for solving a large scale problem based on DBP method. By using our computer program, we can get a complete solution of the respective large scale problem which may raise problem if we try to solve it by using Simplex method. To avoid complication, we may use our computer program to solve LP problems where the number of constraints occurs in a large volume. We develop this computer technique by using the programming language MATHMATICA. We will show the ability of our program in saving labor and time for solving large scale problems.