{"id":28379397,"url":"https://github.com/reusjimenez/simplex-method-java-desktop","last_synced_at":"2025-09-02T20:35:14.878Z","repository":{"id":283773972,"uuid":"952872868","full_name":"ReusJimenez/simplex-method-java-desktop","owner":"ReusJimenez","description":"Implementación del Método Simplex en Java para resolver problemas de programación lineal, permitiendo maximizar funciones objetivo con restricciones. 📊🔢","archived":false,"fork":false,"pushed_at":"2025-04-27T16:18:37.000Z","size":33,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-05-30T02:44:38.877Z","etag":null,"topics":["desktop-application","java","linear-programming","optimization","simplex-algorithm"],"latest_commit_sha":null,"homepage":"","language":"Java","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/ReusJimenez.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,"zenodo":null}},"created_at":"2025-03-22T03:47:57.000Z","updated_at":"2025-05-20T03:22:25.000Z","dependencies_parsed_at":"2025-05-30T02:44:41.711Z","dependency_job_id":"4ef88567-8a26-4a3d-9621-e6527b3a0fdd","html_url":"https://github.com/ReusJimenez/simplex-method-java-desktop","commit_stats":null,"previous_names":["reusjimenez/simplex-method-java","reusjimenez/simplex-method-java-desktop"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ReusJimenez/simplex-method-java-desktop","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ReusJimenez%2Fsimplex-method-java-desktop","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ReusJimenez%2Fsimplex-method-java-desktop/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ReusJimenez%2Fsimplex-method-java-desktop/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ReusJimenez%2Fsimplex-method-java-desktop/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ReusJimenez","download_url":"https://codeload.github.com/ReusJimenez/simplex-method-java-desktop/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ReusJimenez%2Fsimplex-method-java-desktop/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":261462184,"owners_count":23161896,"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","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":["desktop-application","java","linear-programming","optimization","simplex-algorithm"],"created_at":"2025-05-30T02:38:19.174Z","updated_at":"2025-09-02T20:35:14.859Z","avatar_url":"https://github.com/ReusJimenez.png","language":"Java","readme":"# 💻 Método Simplex Desktop en Java\n\nEste proyecto permite resolver problemas de optimización mediante el Método Simplex, un algoritmo eficiente para encontrar soluciones óptimas en programación lineal.\n\n\u003e 🚧 En construcción. El contenido seguirá creciendo conforme avance el aprendizaje.\n\n## 🚀 Características\n\n- Soporta problemas de maximización.\n- Permite ingresar cualquier cantidad de restricciones y variables de decisión.\n- Detecta soluciones múltiples, funciones no acotadas y casos degenerados.\n- Muestra tablas intermedias del proceso de iteración.\n\n## 📌 Ejemplo de Uso\n\n#### Ejecución:\n\n- En la terminal ejecutar: `java -cp bin App`\n\n#### Entrada:\n\n- Cantidad de restricciones: `2`\n- Cantidad de variables de decisión: `2`\n- Objetivo de la función: `Maximizar`\n- Coeficientes de la función objetivo: `3, 5`\n- Restricciones:\n- `1x₁ + 2x₂ ≤ 8`\n- `3x₁ + 2x₂ ≤ 12`\n\n#### Salida esperada:\n\n- Tablas iterativas del Método Simplex y la solución óptima (si existe).\n![Salida esperada](https://github.com/user-attachments/assets/c5fccc9e-fae4-441f-863f-b3ef82f157a7)\n\n## 🛠️ Tecnologías Utilizadas\n\n- Lenguaje: Java\n- Paradigma: Procedural\n- Interfaz: Consola\n\n## 📩 Contacto\n\nSi tienes alguna pregunta o sugerencia, contáctame por [LinkedIn](https://linkedin.com/in/roberto-eustaquio/)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Freusjimenez%2Fsimplex-method-java-desktop","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Freusjimenez%2Fsimplex-method-java-desktop","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Freusjimenez%2Fsimplex-method-java-desktop/lists"}