Семинар за рачунарство и примењену математику, 6. септембар 2013.

• 02. Септембар, 2013
• Коментари (0)

Наредни састанак Семинара биће одржан у петак, 6. септембра 2013. у 14:15, соба 301ф, Математичког института САНУ.

Предавач: Angelo Sifaleras, School of Information Sciences, University of Macedonia, Thessaloniki, Greece

Наслов предавања: EXTERIOR POINT SIMPLEX-TYPE ALGORITHMS FOR LINEAR AND NETWORK OPTIMIZATION PROBLEMS

Садржај: Two decades of research led to the development of a number of efficient algorithms that can be classified as exterior point simplex-type. This type of algorithms can cross over the infeasible region of the primal (dual) problem and find an optimal solution reducing the number of iterations needed. The main idea of exterior point simplex-type algorithms is to compute two paths/flows. Primal (dual) exterior point simplex-type algorithms compute one path/flow which is basic but not always primal (dual) feasible and the other is primal (dual) feasible but not always basic. The aim of this talk is to present the developments in exterior point simplex-type algorithms for linear and network optimization problems, over the recent years. We also present other approaches that, in a similar way, do not preserve primal or dual feasibility at each iteration such as the monotonic build-up Simplex algorithms and the criss-cross methods. Finally, we discuss about possible future research directions in these algorithmic approaches.