This repository contains an implementation of the Interior Point Algorithm, a powerful method for solving Linear Programming Problems (LPP).
The Interior Point Algorithm is a class of methods that solve LPP by traversing the interior of the feasible region. It offers a more efficient and practical alternative to the
Simplex method, especially for large-scale problems.
- Copy the main.cpp file content and paste in your programming invironment.
- Make sure to have a C++ compiler installed.
- Run g++ main.cpp -o main and call using ./main