In this video, I’ll talk about how to formulate the traveling salesman problem and its applications. An example of the typical traveling salesman problem is described as follows. Joe owns…

In this video, I’ll give you a quick start guide about AMPL, and introduce how to use AMPL to model and solve simple LP problems. We use this problem as…

In this video, I’ll talk about how to solve the shortest path problem using Dijkstra’s algorithm for directed networks. We assume that each arc in the network has a length…

In this video, I’ll talk about some basic concepts of integer programming and linear programming relaxation. An integer programming problem is an optimization problem with integer decision variables. If all…

In this video, I’ll talk about how to formulate a special type of LP problem called the staff scheduling problem. Let’s see an example. A company requires different numbers of…

In this video, I’ll talk about how to formulate goal programming problems. All the LP problems we have introduced so far have only a single objective function. In real-world applications,…

In this video, I’ll talk about how to solve IP problems using the branch and bound method. The branch-and-bound algorithm is actually an enumeration of candidate solutions in the search…

In this video, I’ll talk about how to formulate a special type of LP problem called the blending problem. In a blending problem, various inputs are blended in some desired…