Interactive Operations Research with Maple

Maple Workshops/Seminars

To download these Maple worksheet (.mw) files: Right-click > Save link as...

• 2023-03-31: Rotman School of Management, University of Toronto (7,311 KB) Maple 2022.2 worksheet (.mw)

• 2013-04-10: DeGroote School of Business, McMaster University (443 KB) Maple 16 worksheet (.mw)
• 2012-02-22: Lingnan University, Hong Kong (851 KB) Maple 13 worksheet (.mw)

Springer OR Forum

This .zip file <Parlar-Supplements-SpringerORForum.zip> contains all the Maple worksheets and their related .pdf files. These are discussed in the paper by Mahmut Parlar submitted to the special issue of Springer OR Forum on the topic MODEL DEVELOPMENT FOR THE CLASSROOM.

In 2000 I completed a book entitled Interactive Operations Research with Maple: Methods and Models (ISBN 0-8176-4165-3 / US $59.95) that is published by Birkhauser, Boston (July 2000). This book demonstrates the use of the computer algebra system Maple in solving challenging problems in operations research.

The book has 10 chapters. These are listed below and a sample chapter (Dynamic Programming) can be downloaded as an Adobe Acrobat (.pdf) file.

A Solutions Manual will be provided to instructors who adopt the book for their course.

• Chapter 1: Introduction to Operations Research
• Chapter 2: A Quick Tour of Maple
• This chapter presents examples of Maple's capabilities to perform symbolic manipulations, numerical analysis and to plot two- and three-dimensional graphs.
• Chapter 3:  Maple and Mathematical Foundations of Operations Research
• In this chapter algebra, calculus, linear algebra, differential equations, transform methods and probability methods are reviewed with examples relevant in OR applications.
• Chapter 4: Linear Programming
• This chapter discusses the graphical solution, the simplex method, sensitivity analysis and duality, and integer linear programming.
• Chapter 5: Nonlinear Programming
• This chapter describes the convexity of sets and functions, unconstrained optimization, inequality and equality constrained optimization, and Lagrangian duality.
• Chapter 6: Dynamic Programming (382K)
• This chapter covers the stagecoach problem, models with a linear system and quadratic cost, continuous-time dynamic programming, a constrained work force planning model, a gambling model with myopic optimal policy, and optimal stopping problems.
• Chapter 7: Stochastic Processes
• This chapter covers the exponential distribution and Poisson process, renewal theory, Markov chains, and continuous-time Markov chains.
• Chapter 8: Inventory Models
• This chapter covers classification of inventory models, costs associated with inventory models, deterministic inventory models and probabilistic inventory models.
• Chapter 9: Queueing Systems
• Here the topics are Markovian queueing systems, transient solutions, queueing networks and optimization of queueing systems.
• Chapter 10: Simulation
• The final chapter describes the generation of pseudo-random numbers and random variates, Monte Carlo simulation, dynamic simulation models and optimization by random search.

Typos

• 2000-06-19: Typos000619.pdf
• 2001-07-29: Typos010729.pdf (Typos on pp. 174--175 relate to the statement about the constraint qualification.)
• 2017-11-27: There is a minor typo on page 364. The upper limit of the integral should be 15, not 10. With this correction, the optimal solution changes. Here's the corrected file (pdf): BaseStock6-Corrected (Thanks to Shuai Zhang!)

Downloads

• Download Maple V Release 5.1 and Release 6 worksheets used in the book.
• View sample worksheets used in the book.

Purchase

• amazon.com