The generalized linear programming algorithm allows an arbitrary mathematical programming minimization problem to be analyzed as a sequence of linear programming approximations. Under fairly general ...

This paper presents an algorithm for the global maximization of a convex function subject to linear inequality constraints. It is computationally finite and is designed to converge rapidly on problems ...