It is known that Linear Programming (LP) is P-complete. I am interested in approximation algorithms for LP.
There are numerous inapproximability results for NP optimization problems, e.g. it is NP-hard to achieve approximation ratio better than 7/8 for MAX-3SAT.
Are there similar P-hardness results for approximation optimization problems in P?
In particular, is it known if LP is P-hard to approximate?