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

AJOR > Vol.7 No.3, May 2017

Volume 7, Issue 3 (May 2017)

ISSN Print: 2160-8830 ISSN Online: 2160-8849

Google-based Impact Factor: 1.72 Citations

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

HTML XML

Download as PDF (Size: 1528KB) PP. 225-238

DOI: 10.4236/ajor.2017.73015 1,527 Downloads 2,559 Views Citations

Author(s)

Thomas Ugbe¹, Polycarp Chigbu²

Affiliation(s)

¹Department of Statistics, University of Calabar, Calabar, Nigeria.
²Deparment of Statistics, University of Nigeria, Nsukka, Nigeria.

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.

KEYWORDS

Average Information Matrix, Experimental Space, Line Search Algorithm, Support Points, Optimal Solution

Share and Cite:

Ugbe, T. and Chigbu, P. (2017) On Optimal Non-Overlapping Segmentation and Solutions of Three-Dimensional Linear Programming Problems through the Super Convergent Line Series. American Journal of Operations Research, 7, 225-238. doi: 10.4236/ajor.2017.73015.

Cited by