On the Segmentation of the Response Surfaces for Super Convergent Line Series' Optimal Solutions of Constrained Linear and Quadratic Programming Problems

Abstract

The Solutions of Linear and Quadratic Programming Problems using Super Convergent Line Series involving the Segmentation of the Response Surface are presented in the paper. It is verified that the number of segments, S for which optimal solutions of these problems selected for verification are obtained are 2 and 4 for the linear and Quadratic Programming problems, respectively. On the whole the line search exchange algorithm is exploited.
Key Words: Exchange Algorithm, Response Surface, Segmentation, Super Convergent Line Series, Support points.


(Global Journal of Mathematical Sciences: 2002 1 (1&2): 27-34)