Corner points of the feasible region determined by the system of linear constraints are (0,3), (1,1) and (3,0). Let Z = 4x + 5y be the objective function. The minimum value of Z occurs at 

An objective function in linear programming is a mathematical expression representing the goal of the optimization problem. It defines what needs to be maximized or minimized such as profit cost or time. The objective function is optimized within the feasible region defined by the problem’s constraints.

Linear Programming is a method used to optimize a linear objective function subject to linear constraints. The feasible region is formed by the constraints and the optimal solution lies at one of the vertices of this region. It is applied in various fields like economics business and resource allocation for decision-making.