A Study on 1-D Simplex Search Algorithm with its Numerical Experiments Through Computer Algebra

Authors

  • HK Das Department of Mathematics, Dhaka University, Dhaka-1000
  • Tapash Saha Department of Mathematics, Dhaka University, Dhaka-1000
  • M Babul Hasan Department of Mathematics, Dhaka University, Dhaka-1000

DOI:

https://doi.org/10.3329/dujs.v62i2.21972

Keywords:

Non Linear Programming, 1-D, Two Phase, Simplex Search, Computer Algebra

Abstract

Computer techniques have been developed to solve 1-D NLP problems. The 1-D simplex search algorithm was studied and a code corresponding to the modified phase-0 has been developed. The 1-D two phase methods and modified Phase-0 method have been compared with those reported by others. The efficiency of computer techniques and algorithms have been demonstrated with a number of numerical examples.

DOI: http://dx.doi.org/10.3329/dujs.v62i2.21972

Dhaka Univ. J. Sci. 62(2): 95-102, 2014 (July)

Downloads

Download data is not yet available.
Abstract
791
PDF
516

Downloads

Published

2015-02-08

How to Cite

Das, H., Saha, T., & Hasan, M. B. (2015). A Study on 1-D Simplex Search Algorithm with its Numerical Experiments Through Computer Algebra. Dhaka University Journal of Science, 62(2), 95–102. https://doi.org/10.3329/dujs.v62i2.21972

Issue

Section

Articles