CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach 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 thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 69 - Number 7
Year of Publication: 2013
Authors: V.seerengasamy, K.jeyaraman
10.5120/11855-7622

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 },
issue_date = { May 2013 },
volume = { 69 },
number = { 7 },
month = { May },
year = { 2013 },
issn = { 0975-8887 },
pages = { 26-30 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume69/number7/11855-7622/ },
doi = { 10.5120/11855-7622 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:29:35.972799+05:30
%A V.seerengasamy
%A K.jeyaraman
%T A New Approach for Easy Computation by using h-Matrix for solving Integer Linear Fractional Programming Problems
%J International Journal of Computer Applications
%@ 0975-8887
%V 69
%N 7
%P 26-30
%D 2013
%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
  1. C. Audet, P. Hansen, B. Jaumard and G. Savard, Journal of Optimization theory and Application. Vol. 93, No. 2, (1997) 273-300.
  2. 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.
  3. A. Charles, W. W. Cooper An explicit general solution in linear fractional programming, Vol. 20 449-467 September 1973.
  4. Erik B. Bajalinov Linear Fractional programming theory, methods, Applications and Siftware.
  5. Fengquiyou & Ignacio Grossmam. Solving Mixed-Integer Linear Fractional Programming Problems with Dinkelbach's Algorithm and MINLP methods
  6. Hamdy A. Taha, "Operations Research- An Introduction", Seventh Edition, Prentice-Hall of India Private Limited, 2004
  7. H. Ishii, T. Ibaraki and H. Mine, Fractional knapsack problems, Mathematical Programming 13 (1976), 3, 255-271.
  8. Kanti Swarup, Gupta P. K. Manmohan, "Operations Research", Sultan Chand and Sons,2010.
  9. G. KarthiKeyan,"Design of a new computer oriented algorithm to solve linear programming problems", Ph. D. , thesis, Alagappa University, India, May 2011.
  10. Stancu–Minasian, I. M. Fractional programming theory, methods and applications series, Mathematics and its Application Vol. 409 (1997)432p.
  11. Suresh Chandra, M. Chandra Mohan, A note on integer linear fractional programming, Volume 27 (1980)171-174.
  12. L. Vicente, G. Savard and S. Judics, Journal of Optimization Theory and Applications, 89, No. 3 (1996) 597-614.
  13. Wukfred Candler and Robert Townsley, Computers and Operations Research, 9(1982) 59-76.
Index Terms

Computer Science
Information Sciences

Keywords

Integer Linear Fractional Programming Problems matrix and Promising variables

Powered by PhDFocusTM