Optimization algorithm of reflective and contraction variable function

Optimization technique is a mathematical approach to solve for the best solution to problem. It is a science designed to provide quantitative tools to help in decision making procedures. The Simplex method provides the optimum solution of the function. Linear programming being the most prominent optimization technique is applicable for the solution of real world problems in which the objective function and constraints appear as linear functions of the decision variables. The paper will discuss on the function optimization algorithm. There will be consider an n- dimensional space and use the operation equation of reflection, contraction and expansion.