Constraints: The linear inequalities or restrictions on the variables of an LPP are called constraints. The conditions x ≥ 0, y ≥ 0 are called non-negative constraints.

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 this paper we address the problem of protecting sensitive data in a statistical table whose entries are linked by a generic system of linear constraints. This very general setting covers, among ...