bounded variables – Optimization Online

On the Number of Solutions Generated by Dantzig’s Simplex Method for LP with Bounded Variables

Published: 2011/02/06, Updated: 2012/02/15

Linear Programming basic feasible solutions, bounded variables, linear programming, maximum flow problem, minimum cost flow problem, simplex method

We give an upper bound for the number of different basic feasible solutions generated by Dantzig’s simplex method (the simplex method with the most negative pivoting rule) for LP with bounded variables by extending the result of Kitahara and Mizuno (2010). We refine the analysis by them and improve an upper bound for a standard … Read more

A new adaptive algorithm for linear multiobjective programming problems

Published: 2006/11/19

M.O. Bibi

M.S Radjef

Sonia Radjef

Linear, Cone and Semidefinite Programming, Multi-Criteria Optimization bounded variables, direct support method, efficient point, linear multiobjective problem, mixed variables, suboptimality, weakly efficient point

In this paper, we present a new adaptive algorithm for defining the solution set of a multiobjective linear programming problem, where the decision variables are upper and lower bounded, using the direct support method. The principle particularitie of this method is the fact that it handles the bounds of variables such are they are initially … Read more