International Journal of Engineering and Information Systems (IJEAIS)   Year: 2023 | Volume: 7 | Issue: 1 | Page No.: 78-82 Solving Constraint and Unconstraint Optimization Problems Using Approximate Methods Download PDF Ammar Imad Nadhim, Dr. Ahmed Sabah Al-Jilawi Abstract: In One-dimensional problem of numerical optimization, the Golden section search method and Lagrange multiplier method They an iterative optimization procedure of the first order. process for locating a function's local lowest and maximum values. the function can be minimized using this strategy in applied mathematics. this methods is typically taught at we implementation the new approach for Solving constraints and unconstraint numerical optimization. A solution's degree of goodness is determined by minimizing or optimizing an objective function (e.g., cost). when searching for a solution, constraints and without constraints and system model are utilized as a guide. instead, optimization aims to improve (or reduce) the value of the objective function while taking into consideration a variety of restrictions.