Optimal Solution for Assignment Problem by Average Total Opportunity Cost Method

  • Porchelvi R
  • Anitha M
N/ACitations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

In this paper, a new method, namely Average Total Opportunity Cost (ATOC) assignment method is proposed to solve the assignment problem followed by a Numerical Example. It minimizes the total cost of certain problems and for few problems it gives a more cost compared to existing Hungarian method. We prove that this method gives the same optimum solution and also some of the variations and special cases in an assignment problem with its applications are discussed in this paper.

Cite

CITATION STYLE

APA

Porchelvi, R. S., & Anitha, M. (2018). Optimal Solution for Assignment Problem by Average Total Opportunity Cost Method. Journal of Mathematics and Informatics, 13, 21–27. https://doi.org/10.22457/jmi.v13a3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free