KUET Institutional Repository

An Experimental Study on Linear Fractional Programming Problems

Show simple item record

dc.contributor.advisor Jamali, Prof. Dr. A. R. M. Jalal Uddin
dc.contributor.author Ferdaus, Kazi Tanzila
dc.date.accessioned 2018-05-20T10:25:23Z
dc.date.available 2018-05-20T10:25:23Z
dc.date.copyright 2017
dc.date.issued 2017-01
dc.identifier.other ID 1351502
dc.identifier.uri http://hdl.handle.net/20.500.12228/131
dc.description This thesis is submitted to the Department of Mathematics, Khulna University of Engineering & Technology in partial fulfillment of the requirements for the degree of Master of Philosophy in Mathematics, January 2017. en_US
dc.description Cataloged from PDF Version of Thesis.
dc.description Includes bibliographical references (pages 53-55).
dc.description.abstract Much effort has been concentrated on transportation problems (TP) with equality constraints. In real life, however, most problems have mixed constraints accommodating many applications that go beyond transportation related problems to include job scheduling, production inventory, production distribution, allocation problems, and investment analysis. A literature search revealed no systematic method for finding an optimal solution or addressing more-for-less situations in transportation problems with mixed constraint. Here we consider modified VAM method to solve TP with mixed constraints to find out more-for-less situations in transportation problems. Several numerical examples have been considered to justify the effectiveness of the method. On the other hand Linear Fraction Programming (LFP) (i.e. ratio objective that have numerator and denominator) have attracted the interest of many researches due to its application in many important fields such as production planning, financial and corporate planning, health care and hospital planning. Also various optimization problems in engineering and economics involve maximization (or minimization) of the ratio of physical or economical function, for instances cost/time, cost/volume, cost/benefit, profit/cost or other quantities measuring the efficiency of the system. This study presents a new approach for solving a fractional linear programming problem in which the objective function is a linear fractional function, while the constraint functions are in the form of linear inequalities. The LFP problem is converted it into a regular linear programming (LP) problem by an efficient way. The proposed approach is able to reduce some significant limitations of the existing methods. To test the effectiveness and efficiency of the algorithm some hard instances are considered. The proposed approach is able to solve the problem efficiently whereas in some cases the existence approaches are failed to solve the problems. en_US
dc.description.statementofresponsibility Kazi Tanzila Ferdaus
dc.format.extent 65 pages
dc.language.iso en_US en_US
dc.publisher Khulna University of Engineering & Technology (KUET), Khulna, Bangladesh. en_US
dc.rights Khulna University of Engineering & Technology (KUET) thesis/dissertation/internship reports are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission.
dc.subject Programming en_US
dc.subject Linear Fractional en_US
dc.subject Transportation en_US
dc.title An Experimental Study on Linear Fractional Programming Problems en_US
dc.type Thesis en_US
dc.description.degree Master of Philosophy in Mathematics
dc.contributor.department Department of Mathematics

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search KUET IR

Advanced Search


My Account