主办单位：数学与财经学院

报告时间：2019年6月22日、23日

报告地点：红河B区 知行楼A510

报告一

报告题目：The optimal solutions and dual problem of linear programming

报告人：西南财经大学经济数学学院  孟开文 副教授

报告时间：2019年6月22日 9:00-12:00

内容简介：

A linear mathematical programming problem is a problem of finding a maximum or minimum of a linear functional over a convex polyhedron. The functional to optimize is called an objective or cost function, and the linear equalities and linear inequalities that define the polyhedron are called constraints. This talk mainly consider the optimal solutions and dual problem of linear programming.

报告二

报告题目：The simplex method of linear programming

报告人：西南财经大学经济数学学院  朱胜坤 副教授

讲座时间：2019年6月22日 14:30-17:30

内容简介：

The simplex method is aimed at solving the linear problem. Its strategy is to start with a feasible vertex and search an adjacent vertex that increases the value of the objective function until either a ray on which the objective function is unbounded is identified or an optimal vertex is found.

报告三

报告题目：The simplex method of multiobjective linear programming

报告人：9455澳门新葡萄娱乐场大厅数学与财经学院  薛小维 博士

讲座时间：2019年6月23日 9:00-12:00

内容简介：

The simplex method is the first method to solve linear programming problems and one of the most popular methods in computing mathematics. In this talk we present an extension of it to multiobjective problems.

报告四

报告题目：The multiobjective simplex tableau

报告人：重庆交通大学数学与统计学院  李小兵 教授

讲座时间：2019年6月23日 14:30-17:30

内容简介：

This talk mainly gives the simplex tableau of multiobjective linear programming. Due to the arcwise connectedness of the efficient solution set of (MOLP), all efficient basic solutions can be generated by exploring adjacent vertices.