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…

Logical binary constraints – Part 2 Suppose a company has 5 projects available to choose from. We define decision variables as follows: xi=1 if project i is selected, and 0…

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…

Welcome! In this tutorial, we will solve this maximization problem using graphical method. Let’s label the constraints C1 to C4 for reference purposes. Let’s start by setting up tables to…

Welcome to this tutorial as we discuss special cases encountered while solving some linear programming problems. The special cases we’ll discuss include Alternative optimal solutions Infeasibility Unboundedness, and Redundancy. Let’s…

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…

Welcome! In this tutorial, we calculate slack and surplus variables, identify binding constraints, and write the linear programming model in standard form. Let’s begin with this LP model. Here is…