We propose a polynomial algorithm for linear feasibility problems. The algorithm represents a linear problem in the form of a system of linear equations and non-negativity constraints. Then it uses aâ€¦ (More)

We propose a polynomial algorithm for linear programming. The algorithm represents a linear optimization or decision problem in the form of a system of linear equations and non-negativityâ€¦ (More)

This paper proposes a strongly polynomial algorithm which either finds a solution of a linear system Ax = b,0 â‰¤ x â‰¤ 1, or correctly decides that the system has no 0,1-solutions. The algorithm can beâ€¦ (More)

The paper proposes a polynomial algorithm for solving systems of linear inequalities. The algorithm uses a polynomial relaxation-type procedure which either finds a solution for Ax = b,0 â‰¤ x â‰¤ 1, orâ€¦ (More)

We present a fully polynomial time approximation scheme (FPTAS) for a capacitated economic lot-sizing problem with a monotone cost structure. An FPTAS delivers a solution with a given relative errorâ€¦ (More)

We propose a polynomial algorithm for a separable convex optimization problem with linear constraints. We do not make any additional assumptions about the structure of the objective function exceptâ€¦ (More)

We consider the problem of finding nonzero vectors in full-dimensional polyhedral cones given by systems of linear inequalities. It is assumed that there is a separation oracle which, given a vector,â€¦ (More)

We consider a linear problem whose feasible set is a finite set of integer vectors. We assume that there is a verification oracle, which is an algorithm being able to verify whether a given vectorâ€¦ (More)

We consider a production model with two facilities sharing a resource during a time horizon consisting of a number of time periods. Cumulative production levels at the ends of consecutive periods areâ€¦ (More)