An algorithm for solving a capacitated indefinite quadratic transportation problem with enhanced flow
Kavita Gupta, Shalini Arora
Abstract
Open-access reader
Kavita Gupta, Shalini Arora
Abstract
Open-access reader
The present paper discusses enhanced flow in a capacitated indefinite quadratic transportation problem. Sometimes, situations arise where either reserve stocks have to be kept at the 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 problems is studied, where the total transportation flow is enhanced to a known specified level. A related indefinite quadratic 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 enhanced flow problem. The optimal solution to enhanced flow problem may be obtained from the optimal solution to the related transportation problem. An algorithm is presented to solve a capacitated indefinite quadratic transportation problem with enhanced flow. Numerical illustrations are also included in support of the theory. Computational software GAMS is also used.
OpenAlex reports 4 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.
The present paper discusses enhanced flow in a capacitated indefinite quadratic transportation problem. Sometimes, situations arise where either reserve stocks have to be kept at the 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 problems is studied, where the total transportation flow is enhanced to a known specified level. A related indefinite quadratic 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 enhanced flow problem. The optimal solution to enhanced flow problem may be obtained from the optimal solution to the related transportation problem. An algorithm is presented to solve a capacitated indefinite quadratic transportation problem with enhanced flow. Numerical illustrations are also included in support of the theory. Computational software GAMS is also used.
Key concepts: Transportation theory, Mathematical optimization, Quadratic equation, Flow (mathematics), Quadratic programming, Minimum-cost flow problem, Flow network, Computer science