{"id":25324103,"url":"https://github.com/nielstron/symplex","last_synced_at":"2026-07-04T01:33:43.906Z","repository":{"id":91600811,"uuid":"285091400","full_name":"nielstron/symplex","owner":"nielstron","description":"Symbolic computation of the simplex algorithm for educational purposes","archived":false,"fork":false,"pushed_at":"2020-09-01T14:00:48.000Z","size":68,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2026-04-15T00:08:25.092Z","etag":null,"topics":["educational-project","simplex","symbolic-computation","tum"],"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/nielstron.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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2020-08-04T20:23:54.000Z","updated_at":"2023-01-04T18:46:26.000Z","dependencies_parsed_at":null,"dependency_job_id":"ab5ee6c1-e996-4721-83a7-7d02a0ae4120","html_url":"https://github.com/nielstron/symplex","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/nielstron/symplex","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nielstron%2Fsymplex","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nielstron%2Fsymplex/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nielstron%2Fsymplex/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nielstron%2Fsymplex/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nielstron","download_url":"https://codeload.github.com/nielstron/symplex/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nielstron%2Fsymplex/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":35107463,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-07-03T02:00:05.635Z","response_time":110,"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":["educational-project","simplex","symbolic-computation","tum"],"created_at":"2025-02-14T00:56:36.497Z","updated_at":"2026-07-04T01:33:43.901Z","avatar_url":"https://github.com/nielstron.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"Symplex\n-------\n\n\u003e Symbolic simplex for educational purposes\n\nThis repo contains a number of functions and scripts that\nimplement the simplex algorithm and various helper methods.\n\nAll computations are done symbolically and intermediate results in each step\nare stored explicitely to facilitate investigating the procedure i.e. via the debug view.\nThe focus of this project is to be educational, not to be fast or efficient.\n\nThe content is heavily based on the course \"Linear and Convex Optimization\" held by Prof. Dr. Peter Gritzmann in the summer term 2020 at the Technical University Munich.\nReferences to course content may occur.\n\n#### Usage\n\nNote that the only way to specify a linear problem is in natural form,\nthat is supplying a matrix _A_ and vectors _b_ and _c_ such that\nthe argument to _min c^T\\*x , A*x \u003c= b_ is searched.\n\nA number of example usages of the code is contained in `symples/test.py`.\nIt is at the same time a very small test suite for this package.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnielstron%2Fsymplex","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnielstron%2Fsymplex","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnielstron%2Fsymplex/lists"}