{"id":23360086,"url":"https://github.com/manuelalferez/linear-programming-solver","last_synced_at":"2025-09-02T13:03:58.261Z","repository":{"id":102644479,"uuid":"307948551","full_name":"manuelalferez/linear-programming-solver","owner":"manuelalferez","description":"Method to achieve the best result in a mathematical model whose requirements are represented by linear relationships.","archived":false,"fork":false,"pushed_at":"2020-11-01T09:53:57.000Z","size":117,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-09-02T13:02:53.869Z","etag":null,"topics":["cplusplus","linear-programming"],"latest_commit_sha":null,"homepage":"","language":"C++","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/manuelalferez.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":"2020-10-28T08:16:10.000Z","updated_at":"2020-11-03T10:07:25.000Z","dependencies_parsed_at":null,"dependency_job_id":"dd50268c-0ed5-4dd6-b1ed-c96c1daa2694","html_url":"https://github.com/manuelalferez/linear-programming-solver","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/manuelalferez/linear-programming-solver","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/manuelalferez%2Flinear-programming-solver","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/manuelalferez%2Flinear-programming-solver/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/manuelalferez%2Flinear-programming-solver/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/manuelalferez%2Flinear-programming-solver/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/manuelalferez","download_url":"https://codeload.github.com/manuelalferez/linear-programming-solver/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/manuelalferez%2Flinear-programming-solver/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":273287682,"owners_count":25078575,"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":["cplusplus","linear-programming"],"created_at":"2024-12-21T11:13:00.698Z","updated_at":"2025-09-02T13:03:58.251Z","avatar_url":"https://github.com/manuelalferez.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Linear programming solver \n\n[**Linear programming**](https://en.wikipedia.org/wiki/Linear_programming) is an **optimization** technique for a system of **linear** constraints and a **linear** objective function. An objective function defines the quantity to be optimized, and the goal of **linear programming** is to find the values of the variables that maximize or minimize the objective function.\n\n\u003cp align=\"center\"\u003e\n    \u003cimg alt=\"Linear programming problem\" title=\"Linear programming problem\" src=\"http://i.imgur.com/BRgeCP6.png\" width=\"340\"\u003e\n\u003c/p\u003e\n\n\n\n## Goal 🏆\n\nDevelop an algorithm to solve problems of maximization in Linear Programming.\n\n\n\n## Guidelines 🧾\n\nImplement the `simplexTableu` method for maximization problems. Bliss\nimplementation should request the necessary information to resolve any\nmaximization linear programming problem. Once these values are obtained, the program should provide the solution to the problem.\n\nThe implemented simplex method can be executed in console or\nit can include a graphical interface with a minimum of functionalities. \n\nThe program must be able to:\n\n* insert the variables\n* the objective function \n* the constraints of the problem \n\nAdditional characteristics: Preloaded problems, via a configuration/data file.\n\n\n\n## Understanding the project \n\nTake a look at our [Wiki](https://github.com/manuelalferez/linear-programming-solver/wiki/Documentation) to understand how the project is composed. \n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmanuelalferez%2Flinear-programming-solver","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmanuelalferez%2Flinear-programming-solver","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmanuelalferez%2Flinear-programming-solver/lists"}