Associate Professor Tiru Arthanari
BSc, MStat, DipOR, PhD
Tiru Arthanari has a B.Sc. (Statistics) with first rank from the University of Madras, a Master’s degree in Statistics, M.Stat., a Diploma in O.R., and a Ph.D. all from the Indian statistical Institute (ISI, Calcutta), a premier institute of higher learning and research in the fields of quantitative methods and their applications. Tiru has served as the Head of the SQC & OR division of ISI, which provides training and consultation to industries through its 11 units spread all over India. The Quality Mission Project of the division was launched during that period with a major grant (equivalent to NZ$ 3 million) from the government of India. Tiru is a very successful quality and optimisation consultant with sound theoretical basis and vast applied experience. He is a trained quality system auditor. Before migrating to New Zealand, Tiru was serving one of the three centres of ISI located at Bangalore, India as its head.
Research | Current
Pedigree Polytope and Traveling Salesman Problem
Traveling salesman problen is one of the difficult combinatorial problems. In this research I study an alternative combinatorial object called Pedigrees which I invented. My research students along with me have studied the properties of the set of pedigrees
- “Introduction to Pedigree polytope” at ISI, Chennai, on 23 February, 2009.
- “Pedigree polytope and symmetric traveling salesman polytope- some comparisons” at ISI, Chennai, on 25 February, 2009.
- “New Polyhedral Approaches to Difficult combinatorial problems - Pedigree Polytopes” organised by CR Rao AIMSCS, Hyderabad, 25 March, 2009.
- “Compact formulations for Difficult Combinatorial Problems - Pedigree Polytopes” given at Laboratory of Theoretical and Applied Computer Science, UFR MIM, Paul Verlaine University, Metz, France, 26 May, 2009.
- “Pedigree Polytope and How it Differs from the STSP Polytope”- given at, the Symposium on Graph Theory, in the international conference, CMASM-07, Chennai, during January 6-8, 2007.
- “On the Membership Problem of Pedigree Polytope”, - given at, international Symposium on Mathematical Programming for Decision Making: Theory and Applications, New Delhi, during January 10-11, 2007.
- “Pedigree polytope is a Combinatorial Polytope”, - given at the international Conference ICOR 2004, Kolkata, January 2004.
- “On Pedigree polytopes and Hamiltonian Cycles”- invited paper presented at Bose Centenary Symposium, 20-23 December, 2002, Kolkata, India.
Teaching | Current
- 2006 MKTG 202 Marketing Research
- ---- INFOSYS 750 Research Methods - Quantitative
- ---- MATHS 208 Mathematics for Business
- ---- OPSMGT 357 Project Management
- ---- OPSMGT 370 Operations and Supply Chain Strategy
- ---- OPSMGT 371 Business Logistics
- ---- OPSMGT 372 Systems and Management of Quality
- ---- OPSMGT 376 Strategic Procurement
- ---- OPSMGT 760 Advanced Operations Management Systems
- ---- OPSMGT 762 Management of Quality
- ---- OPSRES 392 Operations Research for Management Science
- 2011 Appointed as an Editor of Open Journal of Discrete Mathematics
Areas of expertise
- Human Decision Making- Missing Middle hypothesis
- Multivariate Measurement Systems- New insights on Mahalanobis Taguchi Systems
- New polyhedral approaches to solving the Symmetric Traveling salesman Problem
- Supply Chain Management - Value added services, Coopetition
- System Dynamics Modeling- of corruption, sustainable transportation
- Association for Information Systems
- Australian Association of Engineering Education
- Australian Conservation Foundation
- Life member, Operations Research Society of India
- Operations Research Society of New Zealand
- Production and Operations Management Society of America
- Professional Member, Association of Computing Machinery
Selected publications and creative works (Research Outputs)
- Arthanari, T. S., & Dodge, Y. (1993). Mathematical Programming in Statistics (Wiley Classics Library Series). New York: John Wiley and Sons. Pages: 431.