MATHEMATICAL STRATEGIES FOR SOLVING OPTIMIZATION PROBLEMS

Yogeesh N; Girish Yadav K. P; Girija D.K; N. Raja

doi:10.29121/shodhkosh.v5.i1ICITAICT.2024.1638

Authors

Dr. Yogeesh N Assistant Professor, Department of Mathematics, Government First Grade College, Tumkur, Karnataka, India
Girish Yadav K. P Assistant Professor, Department of Mathematics, Vedavathi Government First Grade College, Hiriyur, India
Dr. Girija D.K Associate Professor and HOD, Department of Computer Science, Government First Grade College, Madhugiri, Karnataka, India
N. Raja Assistant Professor, Department of Visual Communication, Sathyabama Institute of Science and Technology, Deemed University, A++ Grade by NAAC & Category 1 University by UGC, Chennai, Tamilnadu, India

DOI:

https://doi.org/10.29121/shodhkosh.v5.i1ICITAICT.2024.1638

Keywords:

Optimization Problems, Linear Programming, Quadratic Programming

Abstract [English]

In the subject of mathematics and computational science, the optimization-problems refer to a process of selecting a feasible alternatives solution from a set. Many of the ideas given in this paper apply to constrained parameter optimization as well. Contrary to unconstrained optimization, it is more difficult to obtain consistent numerical results, making the selection of an appropriate algorithm more complex. Optimization in finite dimensions. Early attempts to solve optimization issues on computers gave rise to the term "computer programming." “Programming” is still used in issue categories like linear and quadratic programming. So, in this paper, I aim to explore using a mathematical approach to solve optimization problems.

References

R. Fletcher, Practical Methods of Optimization, John Wiley & Sons, 2013.

D. P. Bertsekas, Nonlinear Programming, Athena Scientific, 2016.

S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, 2004. DOI: https://doi.org/10.1017/CBO9780511804441

A. Charnes and W. W. Cooper, Management Models and Industrial Applications of Linear Programming, Vol. 1, Wiley-Interscience, 1961.

J. Nocedal and S. Wright, Numerical Optimization, Springer, 2006.

M. Biegler, Nonlinear Programming: Concepts, Algorithms, and Applications to Chemical Processes, SIAM, 2010. DOI: https://doi.org/10.1137/1.9780898719383

Auger A., Teytaud O. (2010) Continuous lunches are free plus the design of optimal optimization algorithms. Algorithmica, 57, 121–146. DOI: https://doi.org/10.1007/s00453-008-9244-5

Yogeesh N. "Study on Clustering Method Based on K-Means Algorithm." Journal of Advances and Scholarly Researches in Allied Education (JASRAE), vol. 17, no. 1, 2020, pp. 485-489(5), www.ignited.in//I/a/305304.

Dennis J.E.Jr. et al. (1981) An adaptive nonlinear least-squares algorithm. ACM Trans. Math. Softw. (TOMS), 7, 348–368. DOI: https://doi.org/10.1145/355958.355965

Egea J.A. et al. (2009) Dynamic optimization of nonlinear processes with an enhanced scatter search method. Ind. Eng. Chem. Res., 48, 4388–4401. DOI: https://doi.org/10.1021/ie801717t

Yogeesh N. "Mathematical Approach to Representation of Locations Using K-Means Clustering Algorithm." International Journal of Mathematics And its Applications (IJMAA), vol. 9, no. 1, 2021, pp. 127-136.

Esposito W.R., Floudas C. (2000) Global optimization for the parameter estimation of differential-algebraic systems. Ind. Eng. Chem. Res., 39, 1291–1310. DOI: https://doi.org/10.1021/ie990486w

Hendrix E., Tóth B. (2010) Introduction to Nonlinear and Global Optimization. Springer Verlag, New York. DOI: https://doi.org/10.1007/978-0-387-88670-1

Hindmarsh A.C. et al. (2005) Sundials: suite of nonlinear and differential/algebraic equation solvers. ACM Trans. Math. Softw. (TOMS), 31, 363–396. DOI: https://doi.org/10.1145/1089014.1089020