In order to solve linear interaction programming, the vertex-searching method is proposed in this paper. First, the existence of equilibrium is analyzed for the model of linear interaction programming. Then the conclu...In order to solve linear interaction programming, the vertex-searching method is proposed in this paper. First, the existence of equilibrium is analyzed for the model of linear interaction programming. Then the conclusion is obtained in which the equi- librium is in the boundary of the restriction region of linear interaction programming. Also, a searching equilibrium solution is deduced from the conclusion.展开更多
基金Supported by the National Soft Science Research Project of China (2006GXSZD085)
文摘In order to solve linear interaction programming, the vertex-searching method is proposed in this paper. First, the existence of equilibrium is analyzed for the model of linear interaction programming. Then the conclusion is obtained in which the equi- librium is in the boundary of the restriction region of linear interaction programming. Also, a searching equilibrium solution is deduced from the conclusion.
