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, ...

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 ...

MG4C6.1 Foundations of Mathematical Programming: An introduction to linear programming and to the theory of duality. MG4C6.2 Mathematical Programming: Introduction to theory and the solution of linear ...

Lookup tables and Taylor series are two common methods for interpolating between experimentally gathered data or for generating a known function such as a sine wave. This article proposes a third ...

Formulate linear and integer programming problems for solving commonly encountered optimization problems. Understand how approximation algorithms compute solutions that are guaranteed to be within ...