Methods of dual simplex type for linear optimization problems of flow

Methods of dual simplex type for linear optimization problems of flow

0.00 Avg rating0 Votes
Article ID: iaor2009623
Country: Brazil
Volume: 25
Issue: 3
Start Page Number: 349
End Page Number: 382
Publication Date: Sep 2005
Journal: Pesquisa Operacional
Authors: , ,
Keywords: programming: linear
Abstract:

In this paper we study the linear optimization problem lower and upper constrained (i.e., there are lower and upper bounds on constraints and variables) and develop dual simplex methods that explore the dual problem, which is piecewise linear, in some sense nonlinear. Different one-dimensional searches were examined. Computational experiments showed that the exact one-dimensional search in the dual simplex direction has the best performance.

Reviews

Required fields are marked *. Your email address will not be published.