🔬 Implementation of the simplex method.
Welcome to the Simplex Method Solver project! This program is designed to help you solve linear programming problems using the simplex method, with a focus on maximization objectives. You can access and use this solver through our website without the need for complex installations.
The program primarily handles maximization problems.
- Adewuyi Israel Oluwajuwon
- Egor Machnev
- Khush Patel
- Yehia Sobeh
- Hadi Salloum
- Mike Tezin
- Maximization Solver: Focuses on solving maximization linear programming problems.
- Web-based Interface: Use the solver through your web browser without the need for installation.
- Intuitive User Interface: Our user-friendly interface makes it easy to input your linear programming problem and obtain the optimal solution.
To get started with the Maximization Simplex Method Solver, simply follow these steps:
- Visit our website at MAX_SIMPLEX_SOLVER.
- Input your linear programming problem in the specified format. The solver will guide you through the process.
- Click the "Submit" button to find the optimal solution.
- Review the solution.
Using the Maximization Simplex Method Solver is straightforward:
-
Input Your Problem: Enter your linear programming problem. All equations should already be in standard form, meaning, aside the the objective function, the inequality present should be "<=". Each equation should also be separated by a comma.
variables ==> x_1, x_2, ... inequality ==> '<=' objective function ==> Z
As an example
Z = 3x_1 + 5x_2 + 4x_3, 2x_1 - 3x_2 <= 8, 2x_2 + 5x_3 <= 10, 3x_1 + 2x_2 + 4x_3 <= 15
-
Solve: Click the "Submit" button to initiate the solver.
-
Review Solution: Examine the solution to understand the optimal values of your decision variables and the optimal objective function value.
To run locally:
- Clone the repository
git clone https://github.com/machnevegor/simplex_method
- Install the dependency
pip install numpy
- cd into the folder and run the main.py
cd simplex_method
main.py
Enjoy!