Asian Journal of Information Technology

Year: 2008
Volume: 7
Issue: 2
Page No. 83 - 86

Genetic Algorithm Based Method to Solve Linear Fractional Programming Problem

Authors : A.M. Sameeullah , S. Divyaa Devi and B. Palaniappan

Abstract: Linear fractional programming problem finds application in all fields such as animal husbandry problem, power aware embedded system, etc. Finding solution to this problem using conventional methods requires more computational effort. Therefore, a heuristic approach based on Genetic Algorithm is developed to solve the linear fractional programming problem. A set of solution points are generated using random numbers and feasibility of each solution point is verified and the fitness values for all the feasible solution points are obtained. Among the feasible solution points, the best solution point is found out and it replaces the worst solution point. Then pair wise solution points are used for crossover and a new set of solution points is obtained. These steps are repeated for a certain number of generations and the best solution for the given problem is obtained.

How to cite this article:

A.M. Sameeullah , S. Divyaa Devi and B. Palaniappan , 2008. Genetic Algorithm Based Method to Solve Linear Fractional Programming Problem. Asian Journal of Information Technology, 7: 83-86.

Design and power by Medwell Web Development Team. © Medwell Publishing 2022 All Rights Reserved