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

Authors

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

DOI:

https://doi.org/10.3329/diujst.v4i1.4352

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
108
PDF
379

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.  

Downloads

How to Cite

Das, B. C. (2010). 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

Issue

Vol. 4 No. 1 (2009)

Section

Papers

License

Copyright and Reprint Permissions
This journal and the individual contributions contained in it are protected by the copyright of Daffodil International University. Photocopies of this journal in full or parts for personal or classroom usage may be allowed provided that copies are not made or distributed for profit or commercial advantage and the copies bear this notice and the full citation. Copyright for components of this work owned by others than Daffodil International University must be honored. Abstracting with credit is permitted. Specific permission of the publisher and payment of a fee are required for multiple or systemic copying, copying for advertising or promotional purposes, resale, republishing, posting on servers, redistributing to lists and all forms of document delivery.

Subscribers may reproduce table of contents or prepare lists of articles including abstracts for internal circulation within their institutions. Permission of the publisher is required for resale and distribution outside the institution. Permission of the publisher is required for all other derivative works, including compilations and translations. Except as outlined above, no part of this publication may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, mechanical, photocopying, recording or otherwise, without prior written permission of the publisher.

Permissions may be sought directly from Daffodil International University; email: diujst@daffodilvarsity.edu.bd.