You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
A repository dedicated to the mathematical modeling and solution of optimization problems, featuring practical examples in Stochastic Programming, Linear Programming (LP), and Mixed-Integer Linear Programming (MILP)
A collection of algorithms and methods for solving combinatorial optimization problems, including techniques for TSP, Knapsack, and other NP-hard problems using heuristics, metaheuristics, and exact methods
Solving Travelling Salesman / Salesperson ( TSP ) - using different algorithms such as Naive ( Brute Force ), Greedy and Integer Programming using Pulp
This project aims at providing the optimal solution for minimum transportation costing based on two decision variables along with a pictorial overview of the problem. The project uses Excel for dataset cleaning and manipulation as well as python programming for simplex solution and finally, SAS Visual Analytics for visualization.
Maximizing toy production profits with a linear programming approach using PuLP library in Python. Third project for Analysis and Synthesis of Algorithms class.
A streamlit application to automate the t-shirt distribution process at the Juegos Caribe at the Havana University. The python PuLP library is used to solve the optimization problem.