Update Beyond_Linear_Programming.ipynb
parent
f1f5a6311f
commit
12c696da32
|
@ -162,7 +162,7 @@
|
|||
"\n",
|
||||
"<p>\n",
|
||||
"<ul>\n",
|
||||
"<img src = \"https://ibmdecisionoptimization.github.io/tutorials/jupyter/training/1_8.png?raw=true \" >\n",
|
||||
"<img src = \"https://ibmdecisionoptimization.github.io/tutorials/jupyter/training/1_8.png?raw=true\" >\n",
|
||||
"</ul> \n",
|
||||
"\n",
|
||||
"The LP formulation involves one type of variable, namely x(i,j) representing the quantity transported from supply node i to demand node j. The objective is to minimize the total transportation cost across all arcs. The constraints are flow conservation constraints. The first two constraints state that the outflow from each supply node should be less than or equal to the supply capacity. The next three constraints state that the inflow into each demand node should equal the demand at that node. The domain for the shipments on the allowable arcs is set to be greater than or equal to zero, while the shipment quantities on the disallowed arcs are set to zero. \n",
|
||||
|
|
Loading…
Reference in New Issue