会议专题

Research of the inverse problem of Linear Programming on adjusting the coefficient A in the basic-changed situation

This paper will discuss a kind of mathematics model of generalized inverse problem according to the features of the optimal solution in the simplex table in linear programming for enterprises optimal production plan. Significantly, we will research that how to make some infeasible solutions become optimal solutions by adjusting the coefficient A in the basic-changed situation. This problem has important using value : It can not only solve the problems that enterprises couldnt response market require in time because of lacking productive ability caused by rigid treatment to resources restrain when we formulate enterprise optimal production plan,but also provide a reasonable model for enterprise production plan if enterprises want to change producing direction of the production. In addition, the model supports technology innovation and product updates of enterprises, simultaneously improves the ability of market adaptation and coordinates the whole optimization of enterprise and specific business process reengineering.

enterprise optimal production plan linear programming generalized inverse optimal model infeasible solutions the basic-changed situation

Zhang Xiangbin Li Yushi Ma Lin

Nanjing University of Posts and Telecommunications, College of Economics & Management, Nanjing 21004 Dalian University, College of Economic & Management,Dalian, China, 116622

国际会议

The 4th International Conference on Wireless Communications, Networking and Mobile Computing(第四届IEEE无线通信、网络技术及移动计算国际会议)

大连

英文

1-4

2008-10-12(万方平台首次上网日期,不代表论文的发表时间)