In 1975, Huang and Aggerwal developed a class of quadratic convergent algorithm for constrained function minimization. Jennergren, L Peter developed a price schedules decomposition algorithm for LP in 1973. In 2013, H. K. Das and M. B. Hasan developed a generalized technique for solving unconstrained NLP problems and again in 2014, H. K. Das, T. Saha and M. B. Hasan worked on 1-D simplex search and its numerical experiments through computer algebra. In 2015, H. K. Das and M. B. Hasan developed an algorithmic technique for solving NLP and QP problems. In 2005, Wang, Chen, Wee and K.-J. Wang proposed a non-linear stochastic optimization algorithm named Stochastic Portfolio Genetic Algorithm (SPGA) to determine a profitable portfolio selection planning plan under risk. In 2012, Gina, Carlos, Barbosa-Correa and Humberto developed a NLP model that addresses to attain the balance between the costs associated with their application and the potential economic losses caused by failing to satisfy customers' quality levels. In 2013, H. K. Das and M. B. Hasan introduced a decomposition approach and its Computer Technique for Solving Primal Dual LP & Linear Fractional Programming (LFP) problems.