报告一The optimal solutions and dual problem of linear programming

时间：2019年6月29日上午9:00-12:00  地点B校区知行楼A510

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

摘要：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月29日下午14:30-17:30  地点B校区知行楼A510

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

摘要：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

时间：2019年6月30日上午9:00-12:00  地点B校区知行楼A510

报告人：菠菜全讯白菜网数学与财经学院  薛小维博士

摘要：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月30日下午14:30-17:30  地点B校区知行楼A510

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

摘要：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.

欢迎大家参加