No project description provided
Project description
Simplex
A python package that solve linear programming problems using the simplex method.
Features:
- The Problem is input into the program by a file containing python expression.
- Solves both min and max problems(duh!).
- Uses the big M method to find a basic feasible solution when there are none available in the original program.
- Handles adding slack variables to convert the problem into standard form.
- Uses the lexicographic rule to prevent ending up in a loop due to degenerate extreme points.
Run Help to get a list of available commandline options.
usage: simplex.py [-h] [--equs EQUS] [--slack SLACK] [--aux AUX] [--iter ITER]
[--min] [--verbose] [--debug] [--numba]
options:
-h, --help show this help message and exit
--equs EQUS, -e EQUS the file containing the equations
--slack SLACK, -s SLACK
slack variable base name, names are cretedby adding a
number to the string
--aux AUX, -a AUX aux variable base name, names are cretedby adding a
number to the string
--iter ITER, -i ITER maximum number of iterations
--min, -m determines whether its a minimization problem.if not,
its a maximization problem
--verbose, -v whether to print output verbosely
--debug, -d whether to print debug info
Example usage:
./simplex.py -e ./tests/equ6.py -a xa -v -s z -m
TODO
- Use numba
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
dsimplex-0.1.6.tar.gz
(21.5 kB
view hashes)
Built Distribution
dsimplex-0.1.6-py3-none-any.whl
(33.2 kB
view hashes)