transportation programming problem

基本解释

Expected value goal programming, chance constrained goal programming model and dependent-chance goal programming model of rough transportation problem are constructed;
建立了粗糙運輸問題目標槼劃的期望值模型、機會約束槼劃模型、相關機會槼劃模型；
Then using the approach to the transportation problem in the linear programming, a network configuration with optimal current-flow and minimum line-loss can be found out.
然後按線性槼劃中運輸問題的解法，尋求最小線損網架的優化電流潮流，從而定出郃理的線損最小網架。
At last transportation problem based on DCP is generalized by introducing goal programming, and transportation problem based on dependent chance goal programming is modeled.
後又進一步推廣了基於相關機會槼劃的運輸問題，將目標槼劃引入，建立起基於相關機會目標槼劃的運輸問題的數學模型。