An Improved Extreme Point Enumeration Technique for Assignment Problem

Qazi Shoeb Ahmad, Quazzafi Rabbani

Abstract


In this paper an extreme point technique is used for solving the assignment problem. The procedure starts from a feasible extreme point and moves from one extreme point to another extreme point to achieve the optimality of the problem. A numerical example is given to illustrate the procedure.


References


. Dwyer, P.S. “The Solution of Hitchcock Transportation Problem with a Method of Reduced Matrices”, Statistical Laboratory, University of Michigon. 1955

. Flood, M.M.: “On the Hitchcock Distribution Problem” Pacific Journal of Mathematics, Vol.3 (2). 369-386. 1953

. Kuhn, H.W. “The Hungarian Method for the Assignment Problem” Naval Research Logistics, Quarterly, 2 (1 & 2). 83-98. 1955

. Puri, M.C. “Extreme Point Enumeration Technique for Assignment Problem, Portugaliae Mathematica, Vol. 37. (1-2) 31-37. 1978

. Bari, A. and Ahmad, Q.S. Conversion of an Assignment Problem into a Knapsack Problem and its Solution Procedure, Pure and Applied Mathematika Sciences. Vol. XLVIII, (1-2) 15-21. 1998


پاراگلایدر Full Text: PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

ISSN : 2251-1563