The simplex method as a global optimizer: A c-programming perspective

Abstract

In this paper we give a brief account of the important role that the conventional simplex method of linear programming can play in global optimization, focusing on its collaboration with composite concave programming techniques. In particular, we demonstrate how rich and powerful the c-programming format is in cases where its parametric problem is a standard linear programming problem. © 1994 Kluwer Academic Publishers.