TITLE:
On Optimal Non-Overlapping Segmentation and Solutions of Three-Dimensional Linear Programming Problems through the Super Convergent Line Series
AUTHORS:
Thomas Ugbe, Polycarp Chigbu
KEYWORDS:
Average Information Matrix, Experimental Space, Line Search Algorithm, Support Points, Optimal Solution
JOURNAL NAME:
American Journal of Operations Research,
Vol.7 No.3,
May
24,
2017
ABSTRACT: The solutions of Linear Programming Problems by the segmentation of the cuboidal response surface through the Super Convergent Line Series methodologies were obtained. The cuboidal response surface was segmented up to four segments, and explored. It was verified that the number of segments, S, for which optimal solutions are obtained is two (S = 2). Illustrative examples and a real-life problem were also given and solved.