Add to ORKGIn this paper we study the parallel complexity of Positive Linear Programming (PLP), i.e. the special case of Linear Programming in packing/covering form where the input constraint matrix and constraint vector consist entirely of positive entries. We show that the problem of exactly solving PLP is P-complete.Peer Reviewe
A parallel method for globally minimizing a linear program with an additional reverse convex constra...
This study developed a parallel algorithm to efficiently solve linear programming models. The propos...
A simple but efficient algorithm is presented for linear programming. The algorithm computes the pro...
In this paper we study the parallel complexity of Positive Linear Programming (PLP), i.e. the specia...
In this paper we study the parallel complexity of Positive Linear Programming (PLP), i.e. the specia...
In this paper we study the parallel complexity of Positive Linear Programming (PLP), i.e. the specia...
Positive linear programs (LPs), or equivalently, mixed packing and covering LPs, are LPs formulated ...
. The linear multiplicative programming problem minimizes a product of two (positive) variables subj...
We study the design of nearly-linear-time algorithms for approximately solving positive linear progr...
AbstractThe complexity of linear programming and other problems in the geometry of d-dimensions is s...
In this paper we deal with the parallel approximability of a special class of Quadratic Programming ...
This paper introduces a new enumeration technique for (multi)parametric linear programs (pLPs) based...
In this paper we analyze the parallel approximability of two special classes of Quadratic Programmin...
Abstract — The linear complementarity problem (LCP) is a general problem that unifies linear and qua...
This paper studies the problem of finding a (1 + ε)-approximation to positive semidefinite programs....
A parallel method for globally minimizing a linear program with an additional reverse convex constra...
This study developed a parallel algorithm to efficiently solve linear programming models. The propos...
A simple but efficient algorithm is presented for linear programming. The algorithm computes the pro...
In this paper we study the parallel complexity of Positive Linear Programming (PLP), i.e. the specia...
In this paper we study the parallel complexity of Positive Linear Programming (PLP), i.e. the specia...
In this paper we study the parallel complexity of Positive Linear Programming (PLP), i.e. the specia...
Positive linear programs (LPs), or equivalently, mixed packing and covering LPs, are LPs formulated ...
. The linear multiplicative programming problem minimizes a product of two (positive) variables subj...
We study the design of nearly-linear-time algorithms for approximately solving positive linear progr...
AbstractThe complexity of linear programming and other problems in the geometry of d-dimensions is s...
In this paper we deal with the parallel approximability of a special class of Quadratic Programming ...
This paper introduces a new enumeration technique for (multi)parametric linear programs (pLPs) based...
In this paper we analyze the parallel approximability of two special classes of Quadratic Programmin...
Abstract — The linear complementarity problem (LCP) is a general problem that unifies linear and qua...
This paper studies the problem of finding a (1 + ε)-approximation to positive semidefinite programs....
A parallel method for globally minimizing a linear program with an additional reverse convex constra...
This study developed a parallel algorithm to efficiently solve linear programming models. The propos...
A simple but efficient algorithm is presented for linear programming. The algorithm computes the pro...