{"id":49878646,"url":"https://github.com/daisydaisyyy/optimization-solvers","last_synced_at":"2026-05-15T13:13:27.602Z","repository":{"id":329200860,"uuid":"1115182022","full_name":"daisydaisyyy/optimization-solvers","owner":"daisydaisyyy","description":"Python scripts to solve optimization problems step by step","archived":false,"fork":false,"pushed_at":"2026-01-11T09:14:30.000Z","size":128,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2026-01-11T14:54:15.872Z","etag":null,"topics":["linear-programming","non-linear-optimization","optimization","python"],"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/daisydaisyyy.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":"2025-12-12T13:13:12.000Z","updated_at":"2026-01-11T09:14:34.000Z","dependencies_parsed_at":null,"dependency_job_id":null,"html_url":"https://github.com/daisydaisyyy/optimization-solvers","commit_stats":null,"previous_names":["daisydaisyyy/optimization-solvers"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/daisydaisyyy/optimization-solvers","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/daisydaisyyy%2Foptimization-solvers","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/daisydaisyyy%2Foptimization-solvers/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/daisydaisyyy%2Foptimization-solvers/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/daisydaisyyy%2Foptimization-solvers/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/daisydaisyyy","download_url":"https://codeload.github.com/daisydaisyyy/optimization-solvers/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/daisydaisyyy%2Foptimization-solvers/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33067690,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-15T11:35:32.926Z","status":"ssl_error","status_checked_at":"2026-05-15T11:35:31.362Z","response_time":103,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["linear-programming","non-linear-optimization","optimization","python"],"created_at":"2026-05-15T13:13:21.893Z","updated_at":"2026-05-15T13:13:27.596Z","avatar_url":"https://github.com/daisydaisyyy.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"### optimization-solvers\n\nPython scripts to solve optimization problems step by step, covering linear, integer, network, and non-linear programming.\n\n**Linear Programming (LP):**\n- Compute the initial basis for the simplex algorithm given a specific point\n- Simplex algorithm, optimal solution\n- Gomory cuts to find integer solutions\n\n**Network Linear Programming:**\n- Compute flow and potential given a T, L, U partition\n- Simplex algorithm applied to capacitated networks\n- Dijkstra (shortest path tree)\n- Max-Flow / Min-Cut: find max flow and the corresponding min-cut\n\n**Integer Linear Programming (ILP):**\n- Knapsack problem\n- Traveling Salesman Problem (TSP)\n- Branch \u0026 Bound\n\n**Non-Linear Programming (NLP):**\n- Stationary points categorization\n- Projected gradient method\n- Karush-Kuhn-Tucker conditions (KKT)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdaisydaisyyy%2Foptimization-solvers","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdaisydaisyyy%2Foptimization-solvers","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdaisydaisyyy%2Foptimization-solvers/lists"}