A Road Map of Optimization Problem Solving Techniques, Nomenclature and Algorithms
Nikhitha Pai1, Ilango V2
1Nikhitha Pai, Research Scholar, CMR Institute of Technology, Bangalore, India.
2Dr Ilango V, CMR Institute of Technology, Bangalore, India.
Manuscript received on July 20, 2019. | Revised Manuscript received on August 10, 2019. | Manuscript published on August 30, 2019. | PP: 5068-5071 | Volume-8 Issue-6, August 2019. | Retrieval Number: F9553088619/2019©BEIESP | DOI: 10.35940/ijeat.F9553.088619
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Optimization problems are different from other mathematical problems in that they are able to discover solutions which are ideal or near ideal in accordance to the goals. Problems are not solved in one step, but we follow different sequence of steps to reach the solution. The steps could be to define problems, construct and solve models and evaluate and implement solutions. This paper presents an overall outlook of how a problem of optimization type can be solved.
Keywords: A Constraints, Optimality criteria, Taxonomy, Optimization algorithms