A NEW WAY IN LINEAR PROGRAMMING

摘要：

After a short course in order to situate our work, we propose a new way to study linear programming which is a major tool in logistic and optimization and we give a proposal of algorithm to solve linear programming problem in quadratic time from a basic idea which allow to obtain an approached solution with desired accuracy. For this problem we use some dichotomic translations of an hyperplane in the solutions hyperspace.

关键词： Logistic Optimization Algorithm Linear programming Polyhedron Polytop Hyperplan Dichotomy Optimization,Polynomial complexity

作者: I. Lavallée B. M. Ndiaye D. Seck

作者单位: C.N.R.S. UMI ESS 3189-Dakar-Ouagadougou-Bama ko, Dakar, Sénégal LaISC-CHArt Université Paris 8, Pari LMDAN UCAD, BP 45087, Dakar-Fann, Sénéngal LMDAN UCAD, BP 16 889, Dakar-Fann, Sénégal UMI UMMISCO, IRD 209, Bondy, France

会议类型: 国际会议

会议名称: 1st International Conference on Logistics,Informatics and Service Science(2011物流、信息化与服务科学国际会议 LISS 2011)

会议地点: 北京

会议语种:英文

页码: 448-455

在线出版日期: 2011-06-08（万方平台首次上网日期，不代表论文的发表时间）