Non linear programming comparative theory par bimal (3 résultats)
- Couverture souple
Vendeur : preigu, Osnabrück, Allemagnepreigu
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 51,10
EUR 70,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 5 disponible(s)
Taschenbuch. Etat : Neu. Non-linear Programming Comparative theory and Examples | Comparative Study about the methods of Non-linear Programming Problem Including Different types of Numerical Examples | Bimal Das | Taschenbuch | Englisch | VDM Verlag Dr. Müller | EAN 9783639263985 | Verantwortliche Person für die EU: VDM Verlag D…r. Müller, Brivibas Gatve 197, 1039 RIGA, LETTLAND, customerservice[at]vdm-vsg[dot]de | Anbieter: preigu.
- Couverture souple
- impression à la demande
Vendeur : moluna, Greven, Allemagnemoluna
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 46,32
EUR 48,99 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Kartoniert / Broschiert. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Das BimalBimal Chandra Das is a faculty member of the Department of Textile Engineering, Daffodil International University, Dhaka, Bangladesh. He obtained his M.Sc Degree in Pure Ma…thematics from Chittagong University of Bangladesh i.
- Couverture souple
- impression à la demande
Vendeur : AHA-BUCH GmbH, Einbeck, AllemagneAHA-BUCH GmbH
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 59,71
EUR 61,04 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 2 disponible(s)
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The work presented in this book is based on Comparative Study of the Methods of Solving Non-linear Programming (NLP) Problem Including Different types of Numerical Examples . We know that Kuhn-Tucker conditions method is an efficient method…of solving Non-linear programming (NLP) 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 the thesis in following way:In chapter-1 we discuss graphical solution method for solving all kinds of NLP problem. In chapter-2 we discuss other methods of solving NLP problem with numerical examples. In chapter-3 we compare the solutions of the problems obtained by graphical solution method with other methods. For all the problems so considered we use MATLAB programming to graph of the constraints for obtaining feasible regions. Also we plot the objective functions for determining optimum points and compare the solution thus obtained with exact solutions.
