An improved Greub–Rheinboldt inequality

In this paper, by using linear programming under weak conditions, we improve the Greub–Rheinboldt inequality and obtain the best known bound. An application is also given.