Optimal Exploration of Segmented Space of Response Surfaces

The book is about optimal exploration of the response surfaces which are partitioned into segments (non-overlapping and overlapping). From the segments, constrained programming problems are solved via the Super Convergent Line Series (SCLS). The D-and G-optimality criteria of designs generated from the non-overlapping and overlapping segments for unbiased and biased models are also explored. A JAVA program was developed to solve constrained programming problems, Linear, Quadratic and Cubic.