A comparative study of the methods of solving non-linear programming problem

  • Bimal Chandra Das Department of Textile Engineering Daffodil International University, Dhaka
Keywords: Non-linear programming, objective function, convex-region, pivotal element, optimal solution

Abstract

The work present in this paper is based on a comparative study of the methods of solving Non-linear programming (NLP) problem. We know that Kuhn-Tucker condition method is an efficient method of solving Non-linear programming problem. By using Kuhn-Tucker conditions the quadratic programming (QP) problem reduced to form of Linear programming(LP) problem, so practically simplex type algorithm can be used to solve the quadratic programming problem (Wolfe's Algorithm).We have arranged the materials of this paper in following way. Fist we discuss about non-linear programming problems. In second step we discuss Kuhn- Tucker condition method of solving NLP problems. Finally we compare the solution obtained by Kuhn- Tucker condition method with other methods. For problem so consider we use MATLAB programming to graph the constraints for obtaining feasible region. Also we plot the objective functions for determining optimum points and compare the solution thus obtained with exact solutions.

Keywords: Non-linear programming, objective function ,convex-region, pivotal element, optimal solution.

DOI: 10.3329/diujst.v4i1.4352

Daffodil International University Journal of Science and Technology Vol.4(1) 2009 pp.28-34

Downloads

Download data is not yet available.
Abstract
603
PDF
2064

Author Biography

Bimal Chandra Das, Department of Textile Engineering Daffodil International University, Dhaka

Bimal Chandra Das has completed M. Sc in pure Mathematics and B. Sc (Hons) in Mathematics from Chittagong University. Now he is working as a Lecturer under the Department of Textile Engineering in Daffodil International University. His area of research is Operation Research.  

How to Cite
Das, B. (1). A comparative study of the methods of solving non-linear programming problem. Daffodil International University Journal of Science and Technology, 4(1), 28-34. https://doi.org/10.3329/diujst.v4i1.4352
Section
Papers