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.
后又进一步推广了基于相关机会规划的运输问题，将目标规划引入，建立起基于相关机会目标规划的运输问题的数学模型。