全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

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

DOI: 10.4236/ajor.2017.73015, PP. 225-238

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

Full-Text   Cite this paper   Add to My Lib

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.

References

[1]  Gass, S.I. (1958) Linear Programming Methods and Applications. McGraw-Hill, New York.
[2]  Dantzig, G.B. (1963) Linear Programming and Extension. Princeton University Press, Princeton.
https://doi.org/10.1515/9781400884179
[3]  Philip, D.T., Walter, M. and Wright, M.H. (1981) Practical Optimization. Academic Press, London.
[4]  Wilde, D.J. and Beightler, C.S. (1967) Foundations of Optimization. Prentice Hall Inc., Upper Saddle River.
[5]  Myers, R.H. (1971) Response Surface Methodology. Allyn & Bacon, Boston.
[6]  Onukogu, I.B. and Chigbu, P.E. (2002) Super Convergent Line Series (in Optimal Design of Experiment and Mathematical Programming). AP Express Publishing, Nsukka.
[7]  Chigbu, P.E. and Ugbe, T.A. (2002) On the Segmentation of the Response Surfaces for Super Convergent Line Series Optimal Solutions of Constrained Linear and Quadratic Programming Problem. Global Journal of Mathematical Sciences, 1, 27-34.
[8]  Chigbu, P.E. and Ukaegbu, E.C. (2007) On the Precision and Mean Square Error Matrices Approaches in Obtaining the Average Information Matrices via the Super Convergent Line Series. Journal of Nigerian Statistical Association, 19, 4-18.
[9]  Etukudo, I.A. and Umoren, M.U. (2008) A Modified Super Convergent Line Series Algorithm for Solving Linear Programming Problems. Journal of Mathematical Sciences, 19, 73-88.
[10]  Iwundu, M.P. and Hezekiah, J.E. (2014) Algorithmic Approach to Solving Linear Programming Problems on Segmented Regions. Asian Journal of Mathematics and Statistics, 7, 40-59.
https://doi.org/10.3923/ajms.2014.40.59
[11]  Iwundu, M.P. and Ebong, D.W. (2014) Modified Quick Convergent Inflow Algorithm for Solving Linear Programming Problems. International Journal of Probability and Statistics, 3, 54-66.
https://doi.org/10.5539/ijsp.v3n4p54
[12]  Ugbe, T.A. and Chigbu, P.E. (2014) On Non-Overlapping Segmentation of the Response Surfaces for Solving Constrained Programming Problems through Super Convergent Line Series. Communications in Statistics—Theory and Methods, 43, 306-320.
https://doi.org/10.1080/03610926.2012.661510
[13]  Grosan, C. and Abraham, A. (2007) Modified Line Search Method for Global Optimization. Proceeding of the 1st Asia International Conference of Modeling and Simulation, Phuket, 27-30 March 2007, 415-420.
https://doi.org/10.1109/AMS.2007.68
[14]  Andrei, N. (2008) Performance Profiles of Line Search Algorithm for Unconstrained Optimization. Research Institute for Informatics. Centre for Advance Modeling and Optimization, ICI Technical report.
https://www.ici.ro/neculai/p12a08
[15]  Chouzenoux, E., Moussaoui, S. and Idier, J. (2009) A Majorize-Minimize Line Search Algorithm for Barrier Function Optimization. 17th European Signal Processing Conference, Glasgow, 24-28 August 2009, 1379-1383.
[16]  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
[17]  Gardeux, V., Chelouah, R., Siarry, P. and Glover, F. (2011) EM323: A Line Search Algorithm for Solving High Dimensional Continuous Non-Linear Optimization Problems. Soft Computing, 15, 2275-2285.
https://doi.org/10.1007/s00500-010-0651-6
[18]  Pazman, A. (1987) Foundation of Optimum Experimental Design. D. Riedel Publishing Company, Dordrecht.
[19]  Onukogu, I.B. (1997) Foundation of Optimal Exploration of Response Surfaces. Ephrata Press, Nsukka.
[20]  Smith, W.F. (2005) Experimental Design for Formulation (ASA-SIAM Series on Statistics and Applied Probability). SIAM, Philadelphia, ASA, Alexandria, VA.
[21]  Taha, H.A. (2006) Operations Research: An Introduction. 7th Edition, Macmillan Publishing Company, New York.
[22]  Gupta, P.K. and Hira, D.S. (2008) Operations Research. S. Chand and Company Limited, New Delhi.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133