Zhu, S., Ruan, G. and Huang, X. (2010) Some Fundamental Issues of Basic Line Search Algorithm for Linear Programming Problems. Optimization, 59, 1283-1295.
https://doi.org/10.1080/02331930903395873

has been cited by the following article:

• 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.