The study has developed an algorithm that can be employed to tackle optimization problems with nonlinear separable quadratic objective function with linear constraints. The algorithm used two breakpoints. After transforming the nonlinear objective function to linear function, Wolfram Mathematica was employed to get the optimal solution. The two problems solved in this study showed that the proposed algorithm converged faster than solving the original problem directly via Wolfram Mathematica, though with the same optimal solution. In the study, a program code via Wolfram Mathematica for evaluating a nonlinear separable quadratic objective function with multiple linear variables and constraints of different sizes up to 70,000 variables and 35,000 constraints was written using the proposed technique. The study demonstrated the effectiveness of the proposed approach using the written program code as compared to the written program code for the original problem as it converged faster via the time of execution.