scholarly journals A dual simplex-type algorithm for the smallest enclosing ball of balls

2021 ◽  
Author(s):  
Marta Cavaleiro ◽  
Farid Alizadeh
Keyword(s):  
Type Algorithm ◽  
Dual Simplex

Improving a primal–dual simplex-type algorithm using interior point methods

Optimization ◽  
2018 ◽  
Vol 67 (12) ◽  
pp. 2259-2274 ◽  
Author(s):  
T. Glavelis ◽  
N. Ploskas ◽  
N. Samaras
Keyword(s):  
Interior Point ◽  
Interior Point Methods ◽  
Type Algorithm ◽  
Primal Dual ◽  
Dual Simplex

scholarly journals A dual exterior point simplex type algorithm for the minimum cost network flow problem

2009 ◽  
Vol 19 (1) ◽  
pp. 157-170 ◽  
Author(s):  
George Geranis ◽  
Konstantinos Paparizzos ◽  
Angelo Sifaleras
Keyword(s):  
Network Flow ◽  
Feasible Solution ◽  
Flow Problem ◽  
Minimum Cost ◽  
Simplex Algorithm ◽  
Network Flow Problem ◽  
Basic Point ◽  
Type Algorithm ◽  
Dual Simplex ◽  
Minimum Cost Network Flow

A new dual simplex type algorithm for the Minimum Cost Network Flow Problem (MCNFP) is presented. The proposed algorithm belongs to a special 'exterior- point simplex type' category. Similarly to the classical network dual simplex algorithm (NDSA), this algorithm starts with a dual feasible tree-solution and reduces the primal infeasibility, iteration by iteration. However, contrary to the NDSA, the new algorithm does not always maintain a dual feasible solution. Instead, the new algorithm might reach a basic point (tree-solution) outside the dual feasible area (exterior point - dual infeasible tree).

Sign in / Sign up

Export Citation Format

Share Document