Restricted flow in a non linear Capacitated Transportation Problem with Bounds on Rim Conditions
Kavita Gupta, S.R. Arora
Abstract
Kavita Gupta, S.R. Arora
Abstract
This paper discusses restricted flow in a fixed charge capacitated transportation problem with bounds on total source availabilities and total destination requirements. The objective function is the sum of two linear fractional functions consisting of variable costs and fixed charges respectively. Sometimes, situations arise when one wishes to keep reserve stocks at the sources for emergencies, thereby restricting the total transportation flow to a known specified level. A related transportation problem is formulated and it is shown that to each basic feasible solution 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 non linear capacitated transportation problem with restricted flow. Numerical illustration is included in support of theory.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper discusses restricted flow in a fixed charge capacitated transportation problem with bounds on total source availabilities and total destination requirements. The objective function is the sum of two linear fractional functions consisting of variable costs and fixed charges respectively. Sometimes, situations arise when one wishes to keep reserve stocks at the sources for emergencies, thereby restricting the total transportation flow to a known specified level. A related transportation problem is formulated and it is shown that to each basic feasible solution 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 non linear capacitated transportation problem with restricted flow. Numerical illustration is included in support of theory.
Key concepts: Transportation theory, Flow network, Mathematical optimization, Flow (mathematics), Minimum-cost flow problem, Linear programming, Variable (mathematics), Multi-commodity flow problem