In addition, two algorithms are presented for approximately solving fractional programming (FP) problems. The first algorithm is based on an objective space cut and bound method for solving convex FP ...

Successive Linear Programming (SLP) algorithms solve nonlinear optimization problems via a sequence of linear programs. They have been widely used, particularly in the oil and chemical industries, ...

MG4C6.2 Mathematical Programming: Introduction to theory and the solution of linear and nonlinear programming problems: basic solutions and the simplex method, convex programming and KKT conditions, ...