Content area

Abstract

The application of Fourier variable elimination method for solving Linear programming problems generates additional and redundant constraints in each step. Even after using Kohler’s rule to eliminate redundant constraints, some of the constraints generated are still redundant. In this paper, we present modified method of Fourier for solving Linear programming problems. In the modified method, the number of additional constraints generated are reduced to a considerable extent.

Details

Title
Modified Fourier’s Method of Solving Linear Programming Problems
Author
Kanniappan, P 1 ; Thangavel, K 1 

1  Department of Mathematics, Gandhigram Rural Institute, Gandhigram, India 
Pages
45-56
Publication year
1998
Publication date
Mar 1998
Publisher
Springer Nature B.V.
ISSN
00303887
e-ISSN
09750320
Source type
Scholarly Journal
Language of publication
English
DOI
https://doi.org/10.1007/BF03398538
ProQuest document ID
1977128751
Copyright
OPSEARCH is a copyright of Springer, (1998). All Rights Reserved.