571 999 090 8.00—15.30.

Doprava zdarma se Zásilkovnou nad 1 499 Kč

PPL Parcel Shop 54 Kč Balík do ruky 74 Kč Balíkovna 49 Kč PPL 99 Kč Zásilkovna 54 Kč

Kontakt

Jak nakupovat

Pomoc

Můj účet

▸ Prázdný :-(

Solutions Manual to Accompany Nonlinear Programming - Theory and Algorithms, Third Edition

Name: Solutions Manual to Accompany Nonlinear Programming - Theory and Algorithms, Third Edition
Brand: John Wiley & Sons Inc
SKU: 04952451
Price: 1253 CZK
Availability: InStock

Mokhtar S. Bazaraa

Hanif D. Sherali

C. M. Shetty

Jazyk

Angličtina

Kniha Brožovaná

Libristo kód: 04952451

Nakladatelství John Wiley & Sons Inc, října 2013

As the Solutions Manual, this book is meant to accompany the main title, Nonlinear Programming: The... Celý popis

Libristo kód: 04952451

125 b

1 253 Kč

Skladem u dodavatele Odesíláme za 14-18 dnů

30 dní na vrácení zboží

Zákazníci také koupili

Choice Theory: A Very Short Introduction Michael Allingham

/ Brožovaná

270 Kč

Graphs, Networks and Algorithms Dieter Jungnickel

/ Pevná

3 313 Kč

Mathematics for Computer Science ERIC LEHMAN

/ Brožovaná

1 175 Kč

Linear Programming: An Introduction to Finite Improvement Algorithms Daniel Solow

/ Brožovaná

838 Kč

Combinatorial Optimization Christos H. Papadimitriou

/ Brožovaná

765 Kč

Computational Optimization, Methods and Algorithms Slawomir Koziel

/ Pevná

5 094 Kč

Principles in Noisy Optimization Pratyusha Rakshit

/ Pevná

3 313 Kč

Max-linear Systems: Theory and Algorithms Butkovic

/ Pevná

3 313 Kč

Evolutionary Constrained Optimization Rituparna Datta

/ Pevná

3 313 Kč

Nonlinear Control and Filtering for Stochastic Networked Systems Lifeng Ma

/ Pevná

4 607 Kč

Mathematical Modeling and Optimization of Complex Structures Pekka Neittaanmäki

/ Pevná

3 362 Kč

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.