A Linear Fractional Interval Transportation Problem with and Without Budgetary Constraints (original) (raw)
Related papers
Time variant multi-objective linear fractional interval-valued transportation problem
Applied Mathematics-A Journal of Chinese Universities, 2022
This paper studies a time-variant multi-objective linear fractional transportation problem. In reality, transported goods should reach in destinations within a specific time. Considering the importance of time, a time-variant multi-objective linear fractional transportation problem is formulated here. We take into account the parameters as cost, supply and demand are interval valued that involved in the proposed model, so we treat the model as a multi-objective linear fractional interval transportation problem. To solve the formulated model, we first convert it into a deterministic form using a new transformation technique and then apply fuzzy programming to solve it. The applicability of our proposed method is shown by considering two numerical examples. At last, conclusions and future research directions regarding our study is included.
Linear Plus Linear Fractional Capacitated Transportation Problem with Restricted Flow
American Journal of Operations Research, 2013
In this paper, a transportation problem with an objective function as the sum of a linear and fractional function is considered. The linear function represents the total transportation cost incurred when the goods are shipped from various sources to the destinations and the fractional function gives the ratio of sales tax to the total public expenditure. Our objective is to determine the transportation schedule which minimizes the sum of total transportation cost and ratio of total sales tax paid to the total public expenditure. Sometimes, situations arise where either reserve stocks have to be kept at the supply points, for emergencies or there may be extra demand in the markets. In such situations, the total flow needs to be controlled or enhanced. In this paper, a special class of transportation problems is studied where in the total transportation flow is restricted to a known specified level. A related transportation problem is formulated and it is shown that to each basic feasible solution which is called corner feasible solution to related transportation problem, there is a corresponding feasible solution to this restricted flow problem. The optimal solution to restricted flow problem may be obtained from the optimal solution to related transportation problem. An algorithm is presented to solve a capacitated linear plus linear fractional transportation problem with restricted flow. The algorithm is supported by a real life example of a manufacturing company.
The paper is developed to study interval-valued inventory optimization problem. We consider a constant demand inventory model without shortages the input data of which are not fixed, but vary in some real bounded intervals. The aim of this paper is to determine the optimal order quantity, maximizing the total profit and minimizing the holding cost subjecting to three constraints: budget constraint, space constraint, and budgetary constraint on ordering cost of each item. We apply interval-valued linear fractional programming (IVLFP) approach to solve the model. In this respect, we convert the IVLFP problem to an optimization problem with interval-valued objective function having its bounds as linear fractional functions. We solved three numerical examples to illustrate the proposed model in crisp case and interval-valued case.
Fractional transportation problem with non-linear discount cost
Sri Lankan Journal of Applied Statistics
The generalization of linear programming is a fractional programming where the objective function is a proportion of two linear functions. Likewise, in fractional transportation problem the aim is to optimize or improve the ratio of two cost functions or damage functions or demand functions. Since the ratio of two functions is considered, the fractional programming models become more appropriate for dealing with real life problems. The fractional transportation problem (FTP) plays a very important role in supply management for reducing cost and amending service. In real life, the parameters in the models are rarely known exactly and have to be evaluated. This paper investigates the fractional transportation problem (FTP) with some discount cost that avails during the shipment time. The transportation problem, which is one of integer programming problems, deals with distributing any commodity from any group of 'sources' to any group of destinations or 'sinks' in the most effective way with a given 'supply' and 'demand' constraints. The volume of goods to be transported from one place to another incurs some discount cost that could effectively reduce the shipment cost which is directly related to the profit associated with the shipment. This paper is aimed at studying the optimal solution for the problem has been achieved by using Karush-Kuhn-Tucker (KKT) optimality algorithm. Finally, a numerical example is illustrated to support the algorithm.
This paper presents an algorithm to find optimum cost-time trade off pairs in a fractional capacitated transportation problem with bounds on total availabilities at sources and total destination requirements. The objective function is a ratio of two linear functions consisting of variable costs and profits respectively. Sometimes, situations arise where either reserve stocks have to be kept at the supply points say, for emergencies or there is a shortfall in the production level. In such situations, the total flow needs to be curtailed. In this paper, a special class of transportation problems is studied where in the total transportation flow is restricted to a known specified level. A related transportation problem is formulated and the efficient cost-time trade off pairs to the given problem are shown to be derivable from this related transportation problem. Moreover , it is established that special type of feasible solution called corner feasible solution of related transportation problem bear one to one correspondence with the feasible solution of the given restricted flow problem. The optimal solution to restricted flow problem may be obtained from the optimal solution to related transportation problem. Numerical illustration is included in support of theory.
2017
This paper discusses a paradox in a capacitated transportation problem where the objective function is the sum of two fractional functions consisting of variable costs only. A paradoxical situation arises in a transportation problem when value of the objective function falls below the optimal value and this lower value is attainable by shipping larger quantities of goods over the same routes that were previously designated as optimal. Firstly, optimality condition at which a feasible solution of fractional plus fractional capacitated transportation problem will be an optimal solution is established. Then a sufficient condition for the existence of paradox is found. If paradox exists, then the procedure for finding the best paradoxical pair is proposed which ultimately gives a paradoxical range of flows. Moreover, a method is proposed to find the paradoxical solution for a specified flow . Developed algorithm is applied on the real data taken from the account keeping books of the fir...
In this paper, an interval-valued inventory optimization model is proposed. The model involves the price dependent demand and no shortages. The input data for this model are not fixed, but vary in some real bounded intervals. The aim is to determine the optimal order quantity, maximizing the total profit and minimizing the holding cost subjecting to three constraints: budget constraint, space constraint, and budgetary constraint on ordering cost of each item. We apply the linear fractional programming approach based on interval numbers. To apply this approach, a linear fractional programming problem is modeled with interval type uncertainty. This problem is further converted to an optimization problem with intervalvalued objective function having its bounds as linear fractional functions. Two numerical examples in crisp case and interval-valued case are solved to illustrate the proposed approach.
The present paper presents an algorithm to solve a linear plus linear fractional transportation problem with enhanced flow. Sometimes, situations arise where either reserve stocks have to be kept at supply points say, for emergencies, or there may be extra demand in the markets. In such situations, the total flow needs to be controlled or enhanced. In this paper ,a special class of transportation problem is studied where total transportation flow is enhanced to a known specified level.A related transportation problem is formulated and it is established that a special type of feasible solution called corner feasible solution of related transportation problembear one to one correspondence with the feasible solutionof the givenenhanced flow problem. The optimal solution to enhanced flow problem may be obtained from the optimal solution to related transportation problem. An algorithm is presented to solve a capacitated linear plus linear fractional transportation problem with enhanced flow. A real life example of a company is included in support of the theory.
A New Approach for Finding an Optimal Solution for Integer Interval Transportation Problems
2010
In this paper a difierent approach namely separation method based on zero su‐x method is applied for flnding an optimal solution for integer transportation problems where transportation cost, supply and demand are intervals. The proposed method is a non fuzzy method. The solution procedure is illustrated with a numerical example. The separation method can be served as an important tool for the decision makers when they are handling various types of logistic problems having interval parameters.
Solving the Interval-Valued Linear Fractional Programming Problem
American Journal of Computational Mathematics, 2012
This paper introduces an interval valued linear fractional programming problem (IVLFP). An IVLFP is a linear fractional programming problem with interval coefficients in the objective function. It is proved that we can convert an IVLFP to an optimization problem with interval valued objective function which its bounds are linear fractional functions. Also there is a discussion for the solutions of this kind of optimization problem.