https://github.com/contractor-x/simplex-algorithm-c-
A simple program that uses the Simplex Algorithm
https://github.com/contractor-x/simplex-algorithm-c-
c computer-science simplex-algorithm student-project
Last synced: 3 months ago
JSON representation
A simple program that uses the Simplex Algorithm
- Host: GitHub
- URL: https://github.com/contractor-x/simplex-algorithm-c-
- Owner: Contractor-x
- Created: 2025-01-18T02:27:41.000Z (5 months ago)
- Default Branch: main
- Last Pushed: 2025-02-21T23:54:54.000Z (4 months ago)
- Last Synced: 2025-02-22T00:27:13.151Z (4 months ago)
- Topics: c, computer-science, simplex-algorithm, student-project
- Language: C++
- Homepage:
- Size: 6.84 KB
- Stars: 3
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
nono# Simplex Algorithm Solver
A **C++ implementation** of the **Simplex method** for solving Linear Programming problems. This program efficiently finds the optimal solution to a given set of linear constraints and an objective function using the **tableau method**.
---
## ** Features**
✅ Implements the **Simplex Algorithm** for Linear Programming
✅ **Iterative approach** to ensure optimality
✅ **Detects unbounded solutions**
✅ **User-friendly output with formatted tableau representation**
✅ **Structured and modular code** for easy understanding and modification
---
## **Installation & Usage**
### **1️⃣ Compile the Program**
Ensure you have a C++ compiler installed (e.g., `g++` for GCC).
```sh
g++ simplex_solver.cpp -o simplex_solver
```
### **2️⃣ Run the Program**
```sh
./simplex_solver
```
---
## **Project Structure**
```
📁 Simplex Solver Project
│── simplex_solver.cpp # Main program implementing the Simplex method
│── README.md # Project documentation
```
---
## **How It Works**
1️⃣ **Initial Tableau Creation**: Represents the LP problem as a tableau.
2️⃣ **Pivot Column Selection**: Identifies the most negative coefficient in the objective function row.
3️⃣ **Pivot Row Selection**: Uses the minimum ratio test to determine the leaving variable.
4️⃣ **Pivoting Operation**: Converts the pivot element to 1 and other elements in the column to 0.
5️⃣ **Iteration Until Optimality**: The algorithm repeats until all coefficients in the last row are non-negative.
---
## **Example Output**
```
Initial Tableau:
2.00 3.00 1.00 0.00 0.00 100.00
4.00 1.00 0.00 1.00 0.00 80.00
3.00 2.00 0.00 0.00 1.00 60.00
-3.00 -5.00 0.00 0.00 0.00 0.00
Pivot Column: 1
Pivot Row: 1
Updated Tableau:
...
Optimal Solution:
Z = 166.67
```
---
## **Possible Future Improvements**
Allow **user input** for constraints and objective function
**Enhance output format** with better visualization
Implement
**Graphical Method** for 2-variable problems
---
## **Contributors**
This project was developed as part of an assignment given by **Mr. Rupert (GitHub: [@Waboke](https://github.com/Waboke))**.
### **Team Members:**
📌 U22CS1039
📌 U22CS1037
📌 U22CS1040
📌 U22CS1041
📌 U22CS1080
📌 U22CS1044
📌 U22CS1045
📌 U22CS1046
📌 U22CS1115
📌 U19CS1106
---
## **License**
This project is open-source and available under the **MIT License**.