An Algorithmic Technique for Solving Non-Linear Programming and Quadratic Programming Problems

Authors

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

DOI:

https://doi.org/10.3329/ganit.v35i0.28566

Keywords:

Constrained, Unconstrained, Optimization, Non Linear Programming, Quadratic Programming, Computer Algebra

Abstract

In this paper, we improve a combined algorithm and develop a uniform computer technique for solving constrained, unconstrained Non Linear Programming (NLP) and Quadratic Programming (QP) problems into a single framework. For this, we first review the basic algorithms of convex and concave QP as well as general NLP problems. We also focus on the development of the graphical representations. We use MATHEMATICA 9.0 to develop this algorithmic technique. We present a number of numerical examples to demonstrate our method.

GANIT J. Bangladesh Math. Soc.Vol. 35 (2015) 41-55

Downloads

Download data is not yet available.
Abstract
127
PDF
84

Author Biography

HK Das, Department of Mathematics, University of Dhaka, Dhaka-1000



Downloads

Published

2016-06-28

How to Cite

Das, H., & Hasan, M. B. (2016). An Algorithmic Technique for Solving Non-Linear Programming and Quadratic Programming Problems. GANIT: Journal of Bangladesh Mathematical Society, 35, 41–55. https://doi.org/10.3329/ganit.v35i0.28566

Issue

Vol. 35 (2015)

Section

Articles

License

The copyright of GANIT: Journal of Bangladesh Mathematical Society is reserved by Bangladesh Mathematical Society (web: https://bdmathsociety.org/)