Two direct methods in linear programming |
| |
| Institution: | 1. Department of Biotechnology, REVA University, Bangalore 560036, India;2. Department of Biotechnology, Annai College of Arts and Science, Kumbakonam, Tamil Nadu 612001, India;3. Department of Zoology, Arumugam Pillai Seethai Ammal College, Tiruppattur, Tamil Nadu, India;4. Department of Microbiology, Faculty of Science, Annamalai University, Annamalai Nagar, Tamil Nadu 608002, India;5. School of Biological Science, St. Joseph''s College, Tiruchirappalli 620002, India;6. Department of Life Science, Kristu Jayanti College (Autonomous), Bangalore University, Bangalore 560064, India |
| |
| Abstract: | In this paper, we introduce two direct methods for solving some classes of linear programming problems. The first method produces the extreme vertex or a neighboring vertex with respect to the extreme point. The second method is based on the game theory. Both these methods can be used in the preparation of the starting point for the simplex method. The efficiency of the improved simplex method, whose starting point is constructed by these introduced methods, is compared with the original simplex method and the interior point methods, and illustrated by examples. Also, we investigate the elimination of excessive constraints. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
