Overview
- Features innovative perspectives on the simplex algorithm and Krushal-Kuhn-Tucker-John conditions
- Serves as a resource for readers to use the tools of optimization without needing to acquire expertise in the theory
- Features plentiful resources that focus on rigorous definitions, proofs, and case studies
Part of the book series: Synthesis Lectures on Mathematics & Statistics (SLMS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
This book also:
- Features innovative perspectives on the simplex algorithm and Krushal-Kuhn-Tucker-John conditions
- Serves as a resource for readers to use the tools of optimization without needing to acquire expertise in the theory
- Features plentiful resources that focus on rigorous definitions, proofs, and case studies
Similar content being viewed by others
Table of contents (6 chapters)
Authors and Affiliations
About the author
Accessibility Information
Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.
Bibliographic Information
Book Title: Basics of Optimization Theory
Authors: Arthur David Snider
Series Title: Synthesis Lectures on Mathematics & Statistics
DOI: https://doi.org/10.1007/978-3-031-29219-4
Publisher: Springer Cham
eBook Packages: Synthesis Collection of Technology (R0), eBColl Synthesis Collection 12
Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2023
Hardcover ISBN: 978-3-031-29218-7Published: 11 August 2023
Softcover ISBN: 978-3-031-29221-7Published: 12 August 2024
eBook ISBN: 978-3-031-29219-4Published: 10 August 2023
Series ISSN: 1938-1743
Series E-ISSN: 1938-1751
Edition Number: 1
Number of Pages: VIII, 143
Number of Illustrations: 121 b/w illustrations, 59 illustrations in colour
Topics: Optimization, Mathematics, general, Applications of Mathematics, Computational Mathematics and Numerical Analysis, Mathematics of Computing, Algorithms