Sample Complexity and Performance Bounds for Non-Parametric Approximate Linear Programming