- Publisher's listprice EUR 64.19
-
26 622 Ft (25 355 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 12% (cc. 3 195 Ft off)
- Discounted price 23 428 Ft (22 312 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
26 622 Ft
Availability
Not yet published.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Springer Nature Switzerland
- Date of Publication 14 March 2026
- Number of Volumes 1 pieces, Book
- ISBN 9783032015136
- Binding Paperback
- No. of pages264 pages
- Size 235x155 mm
- Language English
- Illustrations XVI, 264 p. 25 illus. Illustrations, black & white 700
Categories
Long description:
This book originates from the graduate course Theory and Methods of Optimisation taught at the University of Pisa and is primarily intended for students seeking a rigorous yet accessible introduction to optimisation techniques. While designed with graduate students in mind, the text is largely self-contained and may also be approached by motivated undergraduates with a solid foundation in mathematical analysis, linear algebra, and the basic topology of Euclidean spaces. Key results from differential calculus and topology are recalled throughout, ensuring that the material remains accessible without compromising mathematical depth.
Structured in three parts, the text offers a coherent progression from foundational theory to algorithmic methods. The first part provides an introduction to convex analysis; the second covers the theory of linear and nonlinear programming; and the third presents key classical algorithms, including the simplex method and gradient-based techniques. Each chapter builds on previous material, with methods presented in detail, including pseudocode and full convergence proofs.
Throughout, the book combines theoretical rigour with applied insight. Every result is proved, and numerous worked examples illustrate the methods in action. This dual emphasis gives the work the character of both a rigorous theoretical text and a practical guide to mathematical optimisation.
The book serves both as an introduction and as a comprehensive reference for those interested in applying mathematical models to real-world problems. It will be especially valuable to young researchers in applied mathematics looking to understand the theoretical underpinnings of optimisation methods as well as to those working on the practical implementation of such techniques.
MoreTable of Contents:
Part I. Convex Analysis.- Chapter 1. Convex sets.- Chapter 2. Convex functions.- Part II. Theory of Optimisation.- Chapter 3. Introduction to Mathematical Programming.- Chapter 4. Linear programming.- Chapter 5. Non-linear Programming.- Chapter 6. Lagrangian Duality.- Part III. Methods of Optimisation.- Chapter 7. Algorithms and Their Convergence.- Chapter 8. The Simplex Method.- Chapter 9. Unconstrained Problems.- Chapter 10. Constrained Problems.
More
