线性规划思想解指派问题

根据凸分析理论和单纯形法原理,提出了指派问题的一个线性规划解法。该方法的思想是将整数规划问题的离散的可行集填充成—个连续的单纯形,这样原指派问题就化为该单纯形上的一个新的线性规划问题。利用单纯形法求解线性规划问题,便可得到指派问题的最优解。并用WinQSB软件求解。

Linear programming thought solution assignment problem

According to the raised analysis theory and the simplex method principle,proposed an assignment problem linear programming solution.This method thought is fills a continual simplex the integer programming question separate feasible collection,like this originally assignment problem changes into on this simplex a new linear programming question.Using the simplex method solution linear programming question,then may obtain assignment problem the optimal solution. And solves with the WinQSB software.