In a Linear Programming Problem How Can the Optimum, Minimising

In a linear programming problem how can the optimum, minimising, solution be identified?

A) The point within the feasibility region, intersecting the line defining the objective function, furthest up the vertical (y) axis
B) The point within the feasibility region, intersecting the line defining the objective function, furthest along the horizontal (x) axis
C) The point within the feasibility region, intersecting the line defining the objective function, that is closest to the origin
D) The point within the feasibility region, intersecting the line defining the objective function, that is furthest away from the origin