Operations Research (1): Models and Applications (Coursera)

Operations Research (1): Models and Applications (Coursera)

Operations Research (OR) is a field in which people use mathematical and engineering methods to study optimization problems in Business and Management, Economics, Computer Science, Civil Engineering, Industrial Engineering, etc. This course introduces frameworks and ideas about various types of optimization problems in the business world. In particular, we focus on how to formulate real business problems into mathematical models that can be solved by computers.

Class Deals by MOOC List - Click here and see Coursera's Active Discounts, Deals, and Promo Codes.

What You Will Learn

  • Formulate different types of mathematical models to tackle optimization problems with businessbapplications.
  • Technically, the concepts and application of Linear Programming, Integer Programming, and Nonlinear Programming will be delivered.
  • Solve an optimization problem with one of the most accessible software: Microsoft Excel.

Syllabus

WEEK 1
Course Overview
This lecture gives students an overview of what they may expect from this course, including the fundamental concept and brief history of Operations Research. We will also talk about how mathematical programming can be used to solve real-world business problem.

WEEK 2
Linear Programming
Linear programming (LP) is one of the most important method to achieve the outcome of optimization problems. We can use LP models for various decisions, including production, inventory, personnel scheduling, etc.

WEEK 3
Integer Programming
In many practical areas, some of the optimization problems occur with integrality constraints imposed on some of the variables. Facility location, machine scheduling, and vehicle routing are some examples. Integer Programming (IP) provides a mathematical way to solve these problems.

WEEK 4
Nonlinear programming
In the real life, many problems involve nonlinearities. Examples include pricing, inventory, and portfolio optimization. For such problems, we may use Nonlinear Programming (NLP) to formulate them into models and solve them.

WEEK 5
Case Study: Personnel Scheduling
In this lecture, we introduce a real business case that has been solved with Operations Research by the instructor. The problem is for a company to schedule its customer service representatives to minimize the total amount of staff shortage. We will demonstrate the problem, process of conducting an OR study, integer programming formulation, and result.

WEEK 6
Course Summary and Future Directions
In the final lecture of this course, we will summarize what we have learned. We will also preview what we may learn in future courses.

Go to Class
MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Related Courses

操作系统原理 (Operating Systems) (Coursera) Coursera
Peking University

操作系统原理 (Operating Systems) (Coursera)

操作系统原理》是针对计算机科学技术专业三年级本科生开设的一门专业基础课程。本课程着重学生系统观的培养,通过重点讲述操作系统的内部结构、工作原理及典型技术的实现,使学生建立起对操作系统的整体及各个功能模块的认识,从而系统掌握计算机的专业知识,进一步提升学生的软件开发能力乃至系统软件开发能力。

Aug 3rd 2026
13-24 Weeks
Agile Meets Design Thinking (Coursera) Coursera
University of Virginia

Agile Meets Design Thinking (Coursera)

Despite everyone's good intentions, hard work and solid ideas, too many projects end up creating unneeded, unusable, and unsellable products. But it doesn't have to be this way. Agile and design thinking offer a different--and effective--approach to product development, one that results in valuable solutions to meaningful problems. In this course, you’ll learn how to determine what's valuable to a user early in the process--to frontload value--by focusing your team on testable narratives about the user and creating a strong shared perspective.

Aug 3rd 2026
4 Weeks
Computer Science: Programming with a Purpose (Coursera) Coursera
Princeton University

Computer Science: Programming with a Purpose (Coursera)

The basis for education in the last millennium was “reading, writing, and arithmetic;” now it is reading, writing, and computing. Learning to program is an essential part of the education of every student, not just in the sciences and engineering, but in the arts, social sciences, and humanities, as well. Beyond direct applications, it is the first step in understanding the nature of computer science’s undeniable impact on the modern world.

Aug 10th 2026
5-12 Weeks
Foundations of Objective-C App Development (Coursera) Coursera
University of California, Irvine

Foundations of Objective-C App Development (Coursera)

An introduction to the Objective-C programming language. This will prepare you for more extensive iOS app development and build a foundation for advanced iOS development topics. Objective-C programming requires a Mac laptop or desktop computer. An iOS device is optional if the learner is willing to working exclusively with the simulator. Some learners have been able to work with an OS X virtual machine on Windows, but explaining how to do that is beyond the scope of this course.

Aug 3rd 2026
4 Weeks
Networking and Security in iOS Applications (Coursera) Coursera
University of California, Irvine

Networking and Security in iOS Applications (Coursera)

You will learn to extend your knowledge of making iOS apps so that they can securely interact with web services and receive push notifications. You'll learn how to store data securely on a device using Core Data. You’ll also learn to securely deploy apps to the App Store and beta users over-the-air. The format of the course is through a series of code tutorials. We will walk you through the creation of several apps that you can keep as a personal app toolbox. When you make your own apps after this course, you can bring in these capabilities as needed. When necessary we pop out of the code tutorials to talk about concepts at a higher level so that what you are programming makes sense.

Aug 3rd 2026
4 Weeks
Approximation Algorithms Part I (Coursera) Coursera
École normale supérieure

Approximation Algorithms Part I (Coursera)

How efficiently can you pack objects into a minimum number of boxes? How well can you cluster nodes so as to cheaply separate a network into components around a few centers? These are examples of NP-hard combinatorial optimization problems. It is most likely impossible to solve such problems efficiently, so our aim is to give an approximate solution that can be computed in polynomial time and that at the same time has provable guarantees on its cost relative to the optimum.

Aug 3rd 2026
5-12 Weeks