IDEAS home Printed from https://ideas.repec.org/a/igg/joris0/v7y2016i4p67-93.html
   My bibliography  Save this article

Decomposition Procedure for Solving NLP and QP Problems based on Lagrange and Sander's Method

Author

Listed:
  • H. K. Das

    (Department of Mathematics, University of Dhaka, Dhaka, Bangladesh)

Abstract

This paper develops a decompose procedure for finding the optimal solution of convex and concave Quadratic Programming (QP) problems together with general Non-linear Programming (NLP) problems. The paper also develops a sophisticated computer technique corresponding to the author's algorithm using programming language MATHEMATICA. As for auxiliary by making comparison, the author introduces a computer-oriented technique of the traditional Karush-Kuhn-Tucker (KKT) method and Lagrange method for solving NLP problems. He then modify the Sander's algorithm and develop a new computational technique to evaluate the performance of the Sander's algorithm for solving NLP problems. The author observe that the technique avoids some certain numerical difficulties in NLP and QP. He illustrates a number of numerical examples to demonstrate his method and the modified algorithm.

Suggested Citation

  • H. K. Das, 2016. "Decomposition Procedure for Solving NLP and QP Problems based on Lagrange and Sander's Method," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 7(4), pages 67-93, October.
    • Handle: RePEc:igg:joris0:v:7:y:2016:i:4:p:67-93
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJORIS.2016100103
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:joris0:v:7:y:2016:i:4:p:67-93. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.