An Optimization Procedure for Quadratic Fractional Transportation Problem

Abstract

In many real-life applications, people deal with various types of nonlinear programming problems. These nonlinear problems may provide solutions to some decision-making issues like constructing optimization model with fractional objective function such as profit/cost (financial and corporate planning) and inventory/sales (production planning marketing). Hence, fractional programming problems become one of the popular research topics. Fractional transportation problem is to transport various amounts of a single homogeneous commodity that are initially stored at various origins to different destinations in such a way that the total fractional transportation cost is minimized. In this paper, the researchers have provided study on one of the nonlinear programming problems known as quadratic fractional transportation problem. The objective of these problems is to minimize or maximize the ratios of physical and economical functions. As compared with the linear programming problems, the quadratic programming problem provides a superior representation of real-life distribution problem where the unit cost of transportation is not constant. In this paper, the researchers have proposed an algorithm to find optimal solution of such problems. The algorithm is illustrated with the help of numerical example which will provide validation and proof that the developed algorithm will help to make the transportation system more beneficial in many application areas.