The complexity of linear programming in (γ,κ) form

Linear programming in (γ,κ)-form is a restricted class of linear programming (LP) introduced by Trevisan (1998). Since Trevisan (2000) the complexity of (γ,κ)-form LP is an open problem. In this work, we show that LP in (γ,κ)-form is P-Complete to be approximated within any constant factor. An immediate consequence is that the extension of Positive Linear Programming (PLP) where the coefficients (matrix A) can have negative values is also P-Complete to be approximated within any constant factor.