On Optimal Non-Overlapping Segmentation and Solutions of Three-Dimensional Linear Programming Problems through the Super Convergent Line Series
Open Access
- 1 January 2017
- journal article
- Published by Scientific Research Publishing, Inc. in American Journal of Operations Research
- Vol. 07 (03), 225-238
- https://doi.org/10.4236/ajor.2017.73015
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
This publication has 1 reference indexed in Scilit:
- On the Segmentation of the Response Surfaces for Super Convergent Line Series' Optimal Solutions of Constrained Linear and Quadratic Programming ProblemsGlobal Journal of Mathematical Sciences, 2002