Linear Programming in Python

Solving optimization problems using the PuLP Python library.

Transshipment Example:

$Min~25x_{14}+25x_{15}+25x_{16}~\cdots~ 27.5x_{78}+25x_{79}+42.5x_{710}\\ \\ ~~~~~~s.t.~x_{14}+x_{15}+x_{16}+x_{17}\leq 350\\ ~~~~~~~~~~~x_{24}+x_{25}+x_{26}+x_{27}\leq 350\\ ~~~~~~~~~~~x_{34}+x_{35}+x_{36}+x_{37}\leq 700\\ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\vdots \\ ~~~~~~~~~~~x_{49}+x_{59}+x_{69}+x_{79}= 500\\ ~~~~~~~~~~~x_{410}+x_{510}+x_{610}+x_{710}= 650\\ ~~~~~~~~~~~x_{ij}\geq 0 ~~~ for~all~i~and~j$

Currently working on the following types of problems:

Transportation
Blending
Transshipment
Assignment
Shortest Route
Maximal Flow

Graphics built using Networkx