Zaprezentowano dalsze rozwiniecie podejscia proponowanego przez Profesora Stefana Chakasa i Dorote Kuchte w rozwiazaniu problemu transportowego w przypadku zastosowania rozmytych wspolczynnikow. Zagadnienie optymalizacji decyzji dystrybutora zostalo sformulowane jako uogolnienie klasycznego...

The dual simplex algorithm is the method of choice when linear programs have to be reoptimized after adding constraints or fixing variables. In this paper we discuss a modication of the standard dual simplex which allows for taking longer steps when proceeding from one dual feasible solution to...

The dual simplex algorithm is the method of choice when linear programs have to be reoptimized after adding constraints or fixing variables. In this paper we discuss a modication of the standard dual simplex which allows for taking longer steps when proceeding from one dual feasible solution to...

The dual simplex algorithm is the method of choice when linear programs have to be reoptimized after adding constraints or fixing variables. In this paper we discuss a modication of the standard dual simplex which allows for taking longer steps when proceeding from one dual feasible solution to...

We propose a new approach to combine linear programming (LP) interior-point and simplex pivoting algorithms. In any iteration of an interior-point algorithm we construct a related LP problem, which approximates the original problem, with a known (strictly) complementary primal-dual solution...