Skip to content

A collection of operational research and non-convex optimization algorithms, featuring dynamic programming, linear programming, and non-convex optimization.

Notifications You must be signed in to change notification settings

fardinabbasi/Optimization

Repository files navigation

Optimization

Implementation for multiple knapsack problem optimization using dynamic programming based on weight and price constraints.

Linear programming projects for network flow problem and routing problem using Pyomo and PuLP.

Implementation of Newton's method and simulated annealing for optimizing a non-linear cost function, showcasing different optimization techniques.

About

A collection of operational research and non-convex optimization algorithms, featuring dynamic programming, linear programming, and non-convex optimization.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published