A FAST ALGORITHM FOR SOLVING OPTIMAL COMBINATION SOLUTIONS OF PAIRED LINEAR PROGRAMMING PROBLEMS

This paper considers an algorithm for solving optimal combination solutions of paired linear programming problems. It ingeniously changes the problems into one of seeking the distance between two convex-polyhedra and gives a fast algorithm to solve such a problem. Based on this algorithm, a series of optimal combination solutions of paired linear programming problems can be obtained in the time of O（log4 （m+n） ）.