MCP算法与计算实现:一个示例  

MCP Algorithm and Computation: An Example

作　　者：周建军[1] 王韬[1] 

机构地区：[1]华中科技大学管理学院,湖北武汉430074

出　　处：《工业工程与管理》2005年第1期119-122,共4页Industrial Engineering and Management

基　　金：国家自然科学基金资助项目(70173003)

摘　　要：混合互补问题(MCP)可以用来描述多种类型的经济模型。本文介绍了MCP的一般形式,及由一般形式推导出的几种常用MCP表达形式。在此基础上,针对一个运输问题,分别采用线性规划与MCP方法求解。特别地,给出了求解该运输问题两种算法的GAMS代码,供读者借鉴。TThe MCP (mixed complementary problem) is a natural format for expressing a variety of economic models. The general formulation and several common expressions of MCP were defined, and an application of MCP in an example of transportation problem is presented. Particularly, the GAMS codes for this transportation problem, both in linear programming and MCP formulation, were listed in this paper as readers' reference.

关 键 词：混合互补问题 线性规划 GAMS 

分 类 号：F224.3[经济管理—国民经济]