{"id":15533083,"url":"https://github.com/michaelstott/simplexsolver","last_synced_at":"2025-09-02T17:15:15.751Z","repository":{"id":53711499,"uuid":"109752561","full_name":"MichaelStott/SimplexSolver","owner":"MichaelStott","description":"Python script that solves standard linear programs with the Simplex algorithm and outputs step-by-step LaTeX instructions.","archived":false,"fork":false,"pushed_at":"2024-09-18T00:27:55.000Z","size":178,"stargazers_count":79,"open_issues_count":0,"forks_count":25,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-09T02:13:40.188Z","etag":null,"topics":["algorithms","homework-exercises","homework-helper","latex","problem-solving","simplex","simplex-algorithm","tutorial"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/MichaelStott.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-11-06T21:34:32.000Z","updated_at":"2025-03-03T12:08:42.000Z","dependencies_parsed_at":"2024-10-31T08:04:22.997Z","dependency_job_id":"b9a098b9-811c-4daf-8caf-050b54791a26","html_url":"https://github.com/MichaelStott/SimplexSolver","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/MichaelStott/SimplexSolver","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MichaelStott%2FSimplexSolver","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MichaelStott%2FSimplexSolver/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MichaelStott%2FSimplexSolver/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MichaelStott%2FSimplexSolver/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MichaelStott","download_url":"https://codeload.github.com/MichaelStott/SimplexSolver/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MichaelStott%2FSimplexSolver/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":273318303,"owners_count":25084168,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-09-02T02:00:09.530Z","response_time":77,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","homework-exercises","homework-helper","latex","problem-solving","simplex","simplex-algorithm","tutorial"],"created_at":"2024-10-02T11:34:33.191Z","updated_at":"2025-09-02T17:15:15.703Z","avatar_url":"https://github.com/MichaelStott.png","language":"Python","readme":"# Simplex Solver\n\nExample code for solving linear equations using simplex.\n\n- Provides step-by-step instrucitons for solving LPs using simplex algorithm (tableau method).\n- Outputs raw LaTeX file.\n\nLaTeX files can be compiled [here].\n\nNote: Currently, only LPs in standard form are supported.\n\n### Examples\n\n###### 1. Standard Form Maximization LP\n\nConsider the following objective function and constraints:\n\n\u003cp align=\"center\"\u003e\n\u003cimg src=\"https://raw.githubusercontent.com/MichaelStott/SimplexSolver/master/img/example1a.png\"\u003e\n\u003c/p\u003e\n\u003cp align=\"center\"\u003e\n\u003cimg src=\"https://raw.githubusercontent.com/MichaelStott/SimplexSolver/master/img/example1b.png\"\u003e\n\u003c/p\u003e\nThis problem can be solved by running the script with the following parameters:\n\n```sh\n$ python simplex.py -A \"[[2,1],[1,2]]\" -b \"[4,3]\" -c \"[1,1]\" -p max\n```\n\n###### 2. Standard Form Minimization LP\n\nConsider the following objective function and constraints:\n\n\u003cp align=\"center\"\u003e\n\u003cimg src=\"https://raw.githubusercontent.com/MichaelStott/SimplexSolver/master/img/example2a.png\"\u003e\n\u003c/p\u003e\n\u003cp align=\"center\"\u003e\n\u003cimg src=\"https://raw.githubusercontent.com/MichaelStott/SimplexSolver/master/img/example2b.png\"\u003e\n\u003c/p\u003e\nThis problem can be solved by running the script with the following parameters:\n\n```sh\n$ python simplex.py -A \"[[2,1],[1,1]]\" -b \"[6,4]\" -c \"[3,2]\" -p min\n```\n\n[here]: \u003chttps://latexbase.com/\u003e\n\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmichaelstott%2Fsimplexsolver","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmichaelstott%2Fsimplexsolver","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmichaelstott%2Fsimplexsolver/lists"}