{"id":25422377,"url":"https://github.com/lavantien/go-linear-programming","last_synced_at":"2025-10-08T20:50:24.898Z","repository":{"id":178758391,"uuid":"662278854","full_name":"lavantien/go-linear-programming","owner":"lavantien","description":"Linear Programming implement in Go","archived":false,"fork":false,"pushed_at":"2023-07-04T23:38:34.000Z","size":10,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-05-13T20:34:54.416Z","etag":null,"topics":["golang","knapsack","linear-programming"],"latest_commit_sha":null,"homepage":"","language":"HTML","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/lavantien.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2023-07-04T19:03:04.000Z","updated_at":"2023-07-04T22:56:28.000Z","dependencies_parsed_at":null,"dependency_job_id":"3a60355f-4ac0-4903-a487-bb2d1786341a","html_url":"https://github.com/lavantien/go-linear-programming","commit_stats":null,"previous_names":["lavantien/go-linear-programming"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/lavantien/go-linear-programming","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lavantien%2Fgo-linear-programming","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lavantien%2Fgo-linear-programming/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lavantien%2Fgo-linear-programming/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lavantien%2Fgo-linear-programming/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/lavantien","download_url":"https://codeload.github.com/lavantien/go-linear-programming/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lavantien%2Fgo-linear-programming/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279000638,"owners_count":26082819,"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-10-08T02:00:06.501Z","response_time":56,"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":["golang","knapsack","linear-programming"],"created_at":"2025-02-16T21:32:53.228Z","updated_at":"2025-10-08T20:50:24.894Z","avatar_url":"https://github.com/lavantien.png","language":"HTML","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Go Linear Programming\n\n![Coverage](coverage.svg)\n\n## Introduction\n\n- [Linear Programming](https://en.wikipedia.org/wiki/Linear_programming)\n- [The Art of Linear Programming](https://youtu.be/E72DWgKP_1Y)\n- Find a vector `[b1, b2, ..., bn]`\n- That dot product with a vector `[a1, a2, ..., an]` subject to the constraints\n- And dot product with a vector `[c1, c2, ..., cn]` maximize a function\n\n## Knapsack Problem\n\n- [Knapsack Problem](https://en.wikipedia.org/wiki/Knapsack_problem)\n- A list of objects where each object has a weight and a value: `Object{Weight, Value}`\n- Find a binary vector `[b1, b2, ..., bn]`\n- Then do dot product with the vector `objects.Weight` with the constraint: `b1 + b2 + ... + bn \u003c= capacity`\n- And maximize dot product with the vector `objects.Value`\n\n## Run\n\n```bash\nmake test\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flavantien%2Fgo-linear-programming","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flavantien%2Fgo-linear-programming","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flavantien%2Fgo-linear-programming/lists"}