Skip to content

menaeffat/QBA-simplex

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Solving Linear problems using the Simplex Method/Big M Method

This project solves linear programming problems to optimality as taught to us by Prof. Assad El Nidani in the Quantitative Business Analysis course as part of the MBA program. I want to thank him personally for tolerating my endless questions and thoroughly answering them.

Disclaimer

This code is not a clean code, it's just something that I threw together in my spare time because I was bored and curious :D and was tested on very limited cases. so use it at your own risk

Example

Objective function and constraints

image

Entering the problem data

we need to set 3 variables:
m: determines wether our problem is a maximization of a minimization problem
z: used to assign the cooficients of the variables in the objective function
xs: used to define the constraint functions, by entering the cooficients of the variables in each function, then a number that represents the separator between the right hand side and the left hand side of the function, where 0 for <=, 1 for =, and 2 for >= , then the last item is the value of the right hand side
image

Result

image image image

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages