Linear Programming Algorithms
Learn about the different optimization algorithms that solve linear programming problems.
We'll cover the following...
Previously, we studied the three steps of solving any problem using linear programming. The third step, which is to find the optimal solution, is at the heart of the process, and it is the most rigorous one. We can employ different algorithms in this way. The choice largely depends on resource constraints like time, computational speed, and precision, among others.
There are numerous optimization algorithms, but we will discuss the more commonly used ones in more detail.
The simplex algorithm
The simplex is the oldest and the most widely-used optimization algorithm. This algorithm involves the selection of a random corner point of the feasible region. The feasible region (or the polygonal region) corresponds to the constraints that are graphically specified. Each corner of the region represents a solution—a possible optimal solution will be one of them. Depending on the type of ...