线性规划基线算法群部分算法计算实验

本文简要介绍了基线算法的构思原理 ,对其中部分算法的具体实现形式进行了测试 ,并与单纯形法进行了比较 .理论和数值结果表明基线算法是一种可靠、有效的算法 .作者还给出了一些对其它算法在计算实践中的看法     

目标控制型线性三级规划的基本性质

本文讨论了一类以下级目标函数最优值为反馈的线性三级递阶优化问题，按照参数规划的方法给出了可行集、最优解等概念，得到了可靠集的弱拟凸性，连通性等性质，为算法设计了基础。     

线性规划的对偶基线算法

In this paper,we studied the dual form of the basic line algorthm for linear programs.It can be easily implemented in tableau that similar to the primal/dual simplex method.Different from primal simplex method or dual simplex method,the dual basic line algorithm can keep primal feasibility and dual feasibility at the same time in a tableau,which makes it more efficient than the former ones.Principles and convergence of dual basic line algorthm were discussed.Some examplex and computational experience were given to illustrate the efficiency of our method.