Lexi-Search Algorithm for A Three Dimensional Group Assignment Problem

A. Vidhyullatha*
HOD, Department of Mathematics, SPW Degree & PG College, Tirupati, Andhra Pradesh, India.
Periodicity:April - June'2016
DOI : https://doi.org/10.26634/jmat.5.2.6005


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


Assignment Problem, Word, Alphabet-Table, Search-Table, Optimum Solution, Lexi-Search, Pattern Recognition Technique.

How to Cite this Article?

Vidhyullatha,A. (2016). Lexi-Search Algorithm for A Three Dimensional Group Assignment Problem. i-manager’s Journal on Mathematics, 5(2), 19-33. https://doi.org/10.26634/jmat.5.2.6005


[1]. Garfinkel R.S, (1971). “An Improved Algorithm for Bottleneck Assignment Problem”. Operations Research, Vol.18, pp.1717-1751.
[2]. Ravindran. A, and Ramaswamy. V, (1977). “On the Bottleneck Assignment Problem”. Journal of Optimization Theory and Application, Vol. 21, pp. 451-458
[3]. Shalini Arora, and Puri M.C, (1997). “A Variant of Time Minimizing Assignment Problem”. European Journal of Operational Research, pp.314-325.
[4]. Balakrishna U and Sundara Murthy M, (2008). “Constraint Time Minimizing Assignment Problem”. 41 Annual Convention of Operational Research Society of India.
[5]. Seshan C.R, (1981). “Some Generalizations of Time Minimizing Assignment Problem”. Journal of Operational Research Society, Vol.32, pp.489-494.
[6]. Subrahmanyam Y.V, (1979). “Some Special Cases of Assignment Problem”. Opsearch, Vol.16, No.1, pp.45-47.
[7]. Shalini Arora, and Puri M.C, (1998). “A Lexi Search Algorithm for a Time Minimizing Assignment Problem”. Opsearch, Vol.35, No.3, pp.193-213.
[8]. Tapadar Rudrajit, and Sahu Anshuman, (2007). “Solving the Assignment Problem using Genetic Algorithm and Simulated Anneling”. International Journal of Applied Mathematics, Vol.36, No.1.
[9]. Karl Hoffman, (2013). “Combinatorial and Integer Optimization”. George Mason University, Manfred Padberg, New York University. Retrieved from http://www.esi2.us.es/~mbilbao/combiopt.htm
[10]. Pannerselvam, (2006). Operations Research, Second Edition. Prentice Hall of India Pvt. Ltd. New Delhi
[11]. Sonia and M. C. Puri, (2004). “Two Level Hierarchical Time Minimization Transportation Problem”. TOP Springer, Vol.12, No.2, pp.301-330.
[12]. Anumula Vidhyullatha, (2013). “Three Dimensional Time Minimization Bulk Transportation Problem”. International Journal of Research in Mathematics & Computation, Vol.12, No.1, pp.26-40.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.