Back to Browse

Warehouse Location Problem: ILP, CPLEX & LP Relaxation Tutorial | IBM OPL Optimization

4.0K views
Aug 27, 2020
13:45

📦 Learn how to solve the Warehouse Location Problem using Integer Linear Programming (ILP) and LP Relaxation in IBM ILOG CPLEX OPL Studio by Dr. Hakeem-Ur-Rehman. This video walks you step-by-step through modelling a cost-minimising warehouse location problem. You'll define fixed and supply costs, decision variables, and constraints (like capacity and assignment) using Optimization Programming Language (OPL). You’ll also learn to compute CPU time for solution performance and compare ILP vs LP relaxation to understand computational efficiency and bounds. 📘 Key Topics Covered: 🔹 Introduction to the Warehouse Location Problem 🔹 Modelling the problem as an Integer Linear Program (ILP) 🔹 Defining decision variables, parameters, and constraints in OPL 🔹 Measuring CPU time for solution analysis 🔹 Converting the ILP model to LP Relaxation for benchmarking 🔹 Understanding lower bounds and performance improvements in complex problems 🎯 Best for: ✔️ Supply chain analysts & operations researchers ✔️ Students of operations research, optimisation, and industrial engineering ✔️ Learners of IBM CPLEX OPL Studio ✔️ Professionals solving facility location or network design problems 📌 Like 👍 | Comment 💬 | Subscribe 🔔 for more tutorials on optimisation, CPLEX, and supply chain analytics.

Download

1 formats

Video Formats

360pmp421.3 MB

Right-click 'Download' and select 'Save Link As' if the file opens in a new tab.

Warehouse Location Problem: ILP, CPLEX & LP Relaxation Tutorial | IBM OPL Optimization | NatokHD