transportation programming problem

基本解釋

Expected value goal programming, chance constrained goal programming model and dependent-chance goal programming model of rough transportation problem are constructed;
建立了粗糙運輸問題目標規(guī)劃的期望值模型、機會約束規(guī)劃模型、相關機會規(guī)劃模型；
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.
然后按線性規(guī)劃中運輸問題的解法，尋求最小線損網架的優(yōu)化電流潮流，從而定出合理的線損最小網架。
At last transportation problem based on DCP is generalized by introducing goal programming, and transportation problem based on dependent chance goal programming is modeled.
后又進一步推廣了基于相關機會規(guī)劃的運輸問題，將目標規(guī)劃引入，建立起基于相關機會目標規(guī)劃的運輸問題的數(shù)學模型。