In this paper, we focused on general nonlinear programming (NLP) problems having m nonlinear (or linear) algebraic inequality (or equality or mixed) constraints with a nonlinear (or linear) algebraic objective function in n variables. We proposed a new two-phase-successive linearization approach for solving NLP problems. Aim of this proposed approach is to find a solution of the NLP problem, based on optimal solution of linear programming (LP) problems, satisfying the nonlinear constraints oversensitively. This approach leads to novel methods. Numerical examples are given to illustrate the approach.
Albayrak, Inci; Sivri, Mustafa; and Temelcan, Gizem
A New Successive Linearization Approach for Solving Nonlinear Programming Problems,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 14,
1, Article 30.
Available at: https://digitalcommons.pvamu.edu/aam/vol14/iss1/30