Duality for fractional transportation problem

Duality for fractional transportation problem

0.00 Avg rating—0 Votes
Article ID: iaor19982464
Country: Belgium
Volume: 37
Start Page Number: 121
End Page Number: 133
Publication Date: Jan 1995
Journal: Cahiers du Centre d'tudes de Recherche Oprationnelle
Authors: ,
Keywords: programming: fractional
Abstract:

The main purpose of this paper is to introduce a dual problem of the following fractional transportation problem min f(X) = (Σi=1m Σj=1n cij xij)/(Σi=1m Σj=1n dij xij) subject to (Σj=1n xij ≤ ai, i=1, ..., m; (Σi=1m xij ≥ bj, j=1, ..., n; and xij ≥ 0, i=1, ..., m and j=1, ..., n. Weak, direct and converse duality theorems regarding the relationship between primal and dual problems are established. Finally, a numerical example is presented.

Reviews

Required fields are marked *. Your email address will not be published.