The parallel complexity of positive linear programming
In 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...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 1998 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/114140 |
| Acceso en línea: | https://hdl.handle.net/2117/114140 https://dx.doi.org/10.1142/S0129626498000511 |
| Access Level: | acceso abierto |
| Palabra clave: | Linear programming Parallel programming (Computer science) Computational complexity Parallel complexity Fractional packing/covering linear programs Logspace reduction Programació lineal Programació en paral·lel (Informàtica) Complexitat computacional Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Sumario: | In 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. |
|---|