Research Article

A New Approach for Easy Computation by using h-Matrix for solving Integer Linear Fractional Programming Problems

by  V.Seerengasamy, K.Jeyaraman
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 69 - Issue 7
Published: May 2013
Authors: V.Seerengasamy, K.Jeyaraman
10.5120/11855-7622
PDF

V.Seerengasamy, K.Jeyaraman . A New Approach for Easy Computation by using h-Matrix for solving Integer Linear Fractional Programming Problems. International Journal of Computer Applications. 69, 7 (May 2013), 26-30. DOI=10.5120/11855-7622

                        @article{ 10.5120/11855-7622,
                        author  = { V.Seerengasamy,K.Jeyaraman },
                        title   = { A New Approach for Easy Computation by using h-Matrix for solving Integer Linear Fractional Programming Problems },
                        journal = { International Journal of Computer Applications },
                        year    = { 2013 },
                        volume  = { 69 },
                        number  = { 7 },
                        pages   = { 26-30 },
                        doi     = { 10.5120/11855-7622 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2013
                        %A V.Seerengasamy
                        %A K.Jeyaraman
                        %T A New Approach for Easy Computation by using h-Matrix for solving Integer Linear Fractional Programming Problems%T 
                        %J International Journal of Computer Applications
                        %V 69
                        %N 7
                        %P 26-30
                        %R 10.5120/11855-7622
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

To minimize the computational effort needed in solving a Integer Linear Fractional programming problem a new approach has been proposed. Here we use matrix for finding the solution of the integer linear fractional programming problems.

References
  • C. Audet, P. Hansen, B. Jaumard and G. Savard, Journal of Optimization theory and Application. Vol. 93, No. 2, (1997) 273-300.
  • A. I. Barros, J. B. G. Frenk, S. Schaible and S. Zhang, A new algorithm for generalized fractional programs Mathematical Programming 72 (1996), 2, 147-175.
  • A. Charles, W. W. Cooper An explicit general solution in linear fractional programming, Vol. 20 449-467 September 1973.
  • Erik B. Bajalinov Linear Fractional programming theory, methods, Applications and Siftware.
  • Fengquiyou & Ignacio Grossmam. Solving Mixed-Integer Linear Fractional Programming Problems with Dinkelbach's Algorithm and MINLP methods
  • Hamdy A. Taha, "Operations Research- An Introduction", Seventh Edition, Prentice-Hall of India Private Limited, 2004
  • H. Ishii, T. Ibaraki and H. Mine, Fractional knapsack problems, Mathematical Programming 13 (1976), 3, 255-271.
  • Kanti Swarup, Gupta P. K. Manmohan, "Operations Research", Sultan Chand and Sons,2010.
  • G. KarthiKeyan,"Design of a new computer oriented algorithm to solve linear programming problems", Ph. D. , thesis, Alagappa University, India, May 2011.
  • Stancu–Minasian, I. M. Fractional programming theory, methods and applications series, Mathematics and its Application Vol. 409 (1997)432p.
  • Suresh Chandra, M. Chandra Mohan, A note on integer linear fractional programming, Volume 27 (1980)171-174.
  • L. Vicente, G. Savard and S. Judics, Journal of Optimization Theory and Applications, 89, No. 3 (1996) 597-614.
  • Wukfred Candler and Robert Townsley, Computers and Operations Research, 9(1982) 59-76.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Integer Linear Fractional Programming Problems matrix and Promising variables

Powered by PhDFocusTM