<article_id>JMAT_V5_N2_RP2</article_id>
<title>Lexi-Search Algorithm for A Three Dimensional Group Assignment Problem</title>
<author>A. Vidhyullatha</author>
<journal>Journal on Mathematics</journal>
<issn>2277-5137</issn>
<volume>5</volume>
<issue>2</issue>
<first_page>19</first_page>
<last_page>33</last_page>
<keywords>Assignment Problem, Word, Alphabet-Table, Search-Table, Optimum Solution, Lexi-Search, Pattern
Recognition Technique</keywords>
<abstract>Application of Operations Research has traditionally arisen in response to solve the complex nature problems due to change in structure of human organizations, specialization in various fields and introduction of division of labour concept in each organization. In view of this, a variant Assignment Problem with the introduction of third dimension is studied in this paper. The problem is more versatile which influences the objective function. It is a mini-max combinatorial programming problem. A Lexi-Search exact algorithm based on the pattern recognition technique is developed to obtain an optimal solution and is illustrated with a numerical example. Lexi-Search method is an implicit enumeration method where it eliminates subsets of solutions called blocks which are not having an optimal feasible solution and converge fast to an optimum solution.</abstract>
<date>April - June 2016</date>
<copyright>Copyright &copy; 2016 i-manager publications. All rights reserved.</copyright>
<publisher>i-manager Publications</publisher>
<article_url>http://www.imanagerpublications.com/Article.aspx?ArticleId=6005</article_url>