You might also like

More about Industrial Optimization Models with Python

• Book details
• Synopsis
• Trending among others

You get 86 loyalty points

Book synopsis

Reactive Publishing

Industrial optimization is at the center of modern operations, from production planning and workforce scheduling to logistics, routing, capacity management, and resource allocation. This book introduces practical optimization modeling with Python for readers who want to understand how mathematical models can be built, solved, and interpreted in operational environments.

Rather than treating optimization as an abstract academic subject, this guide focuses on model structure, decision variables, constraints, objective functions, and implementation workflows. Readers will learn how optimization problems are framed, how different modeling choices affect results, and how Python can be used to translate operational questions into solvable models.

Topics include linear programming, integer programming, scheduling models, routing problems, allocation systems, constraint design, sensitivity thinking, and practical model interpretation. The book is designed for analysts, engineers, operations professionals, supply chain teams, students, and technical readers who want a structured introduction to applied industrial optimization.

Clear examples and implementation-oriented explanations help connect mathematical optimization concepts to real operational decisions. Whether used for production planning, logistics analysis, workforce allocation, or process improvement, this book provides a grounded foundation for building optimization models with Python.

Book details

• Full title: Industrial Optimization Models with Python
• Subtitle: Programming, Scheduling, Routing, and Resource Allocation for Operations
• Author: Alice Schwartz, Vincent Bisette
• Language: English
• Binding: Paperback
• Number of pages: 530
• EAN: 9798195461850
• ID: 52270352
• Publisher: Independently published
• Weight: 703 g
• Dimensions: 229 × 152 × 27 mm
• Date of publishing: 03. May 2026

---

---

---