All | Since 2020 | |
Citation | 172 | 110 |
h-index | 7 | 5 |
i10-index | 1 | 0 |
WJERT Citation 
Login
News & Updation
Abstract
GENERALIZATION OF OPTIMIZATION TECHNIQUE WITH ANALYTICAL AND COMPUTATIONAL METHODS FOR SOLVING LINEAR PROGRAMMING PROBLEM
Ankitapuja Pradhan* and Dr. P. K. Mishra
ABSTRACT
In this work, we have studied the establishment of traditional simplex methods and the modified simplex methods for solving linear programming problem (LPP) by replacing one basic variable by one non-basic variable at each simplex iteration. After the generalization of traditional simplex methods for solving linear programming problem (LPP) by replacing more than one basic variables by non-basic variables at each simplex iteration and compare the methods between themselves. To apply these methods on large scale real life linear programming problem, we developed computer program based onMATHEMATICA language. This method is applicable for LPP based on garment industry and textile mill scheduling problem. Introduction:-Operations research is a science which deals with problem, formulation, solutions and appropriate decision making. It is most often used to analyze complex real-life problems with the goal of improving or optimizing performance. It is a quantitative approach for decision making based on the scientific method of solving linear programming problem (LPP) by graphical method, simplex method etc. Graphical method is only applicable for problems with two variables whereas simplex method is to solve the problems with any number of variables and constraints, using an iterative approach.
[Full Text Article] [Download Certificate]