Finding shortest route — Optimization

Basics of Linear programming

Linear programming is being used everywhere around you. Whether it is to find the shortest route while traveling to work, maximize the productivity of our teams or maximize profits. Well, all we are trying to do here is optimize either the way of working or gain the maximum results. This is what is described as Optimization.

At the heart of optimization lies linear programming. Linear programming is nothing but converting your real life problem into a mathematical model.

The various optimization software and algorithms out there use linear programming at the core. But the challenge people face is not being clear with the basics of linear programming. That’s why I decided to write this article.

In this article, I have explained the different methods of linear programming. I will walk you through Graphical method to solve a two variable linear program, then how to build your first model in OpenSolver. Then I have explained the three popular methods of linear programming — Simplex method, Northwest Corner method, and Least cost method. To help you understand each concept & method clearly, I have given examples with each one of them.

To read the complete article, click below.

Introductory guide on Linear Programming for (aspiring) data scientists

Do share your feedback!

Show your support

Clapping shows how much you appreciated swati kashyap’s story.