C. M. Shetty - Böcker
Visar alla böcker från författaren C. M. Shetty. Handla med fri frakt och snabb leverans.
4 produkter
4 produkter
1 985 kr
Skickas inom 7-10 vardagar
COMPREHENSIVE COVERAGE OF NONLINEAR PROGRAMMING THEORY AND ALGORITHMS, THOROUGHLY REVISED AND EXPANDED Nonlinear Programming: Theory and Algorithms—now in an extensively updated Third Edition—addresses the problem of optimizing an objective function in the presence of equality and inequality constraints. Many realistic problems cannot be adequately represented as a linear program owing to the nature of the nonlinearity of the objective function and/or the nonlinearity of any constraints. The Third Edition begins with a general introduction to nonlinear programming with illustrative examples and guidelines for model construction.Concentration on the three major parts of nonlinear programming is provided: Convex analysis with discussion of topological properties of convex sets, separation and support of convex sets, polyhedral sets, extreme points and extreme directions of polyhedral sets, and linear programmingOptimality conditions and duality with coverage of the nature, interpretation, and value of the classical Fritz John (FJ) and the Karush-Kuhn-Tucker (KKT) optimality conditions; the interrelationships between various proposed constraint qualifications; and Lagrangian duality and saddle point optimality conditionsAlgorithms and their convergence, with a presentation of algorithms for solving both unconstrained and constrained nonlinear programming problemsImportant features of the Third Edition include: New topics such as second interior point methods, nonconvex optimization, nondifferentiable optimization, and moreUpdated discussion and new applications in each chapterDetailed numerical examples and graphical illustrationsEssential coverage of modeling and formulating nonlinear programsSimple numerical problemsAdvanced theoretical exercisesThe book is a solid reference for professionals as well as a useful text for students in the fields of operations research, management science, industrial engineering, applied mathematics, and also in engineering disciplines that deal with analytical optimization techniques. The logical and self-contained format uniquely covers nonlinear programming techniques with a great depth of information and an abundance of valuable examples and illustrations that showcase the most current advances in nonlinear problems.
367 kr
Skickas inom 7-10 vardagar
As the Solutions Manual, this book is meant to accompany the main title, Nonlinear Programming: Theory and Algorithms, Third Edition. This book presents recent developments of key topics in nonlinear programming (NLP) using a logical and self-contained format. The volume is divided into three sections: convex analysis, optimality conditions, and dual computational techniques. Precise statements of algortihms are given along with convergence analysis. Each chapter contains detailed numerical examples, graphical illustrations, and numerous exercises to aid readers in understanding the concepts and methods discussed.
1 620 kr
Tillfälligt slut
Presenting recent developments of key topics in nonlinear programming, this text looks specifically at three main areas; convex analysis, optimality conditions and dual computational techniques.
Del 122 - Lecture Notes in Economics and Mathematical Systems
Foundations of Optimization
Häftad, Engelska, 1976
1 064 kr
Skickas inom 10-15 vardagar
Current1y there is a vast amount of literature on nonlinear programming in finite dimensions. The pub1ications deal with convex analysis and severa1 aspects of optimization. On the conditions of optima1ity they deal mainly with generali- tions of known results to more general problems and also with less restrictive assumptions. There are also more general results dealing with duality. There are yet other important publications dealing with algorithmic deve10pment and their applications. This book is intended for researchers in nonlinear programming, and deals mainly with convex analysis, optimality conditions and duality in nonlinear programming. It consolidates the classic results in this area and some of the recent results. The book has been divided into two parts. The first part gives a very comp- hensive background material. Assuming a background of matrix algebra and a senior level course in Analysis, the first part on convex analysis is self-contained, and develops some important results needed for subsequent chapters. The second part deals with optimality conditions and duality. The results are developed using extensively the properties of cones discussed in the first part. This has faci- tated derivations of optimality conditions for equality and inequality constrained problems. Further, minimum-principle type conditions are derived under less restrictive assumptions. We also discuss constraint qualifications and treat some of the more general duality theory in nonlinear programming.