On Optimal Non-Overlapping Segmentation and Solutions of Three-Dimensional Linear Programming Problems through the Super Convergent Line Series

Thomas Ugbe, Polycarp Chigbu
2017 American Journal of Operations Research  
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.
doi:10.4236/ajor.2017.73015 fatcat:ty6ptvfwq5bcjp52pxmidhqicm