Home › JEE Main › mathematics › Linear Programming › In a linear programming problem, the linear func…
In a linear programming problem, the linear function $Z = ax + by$ to be optimised is called the:
Aobjective function
Bconstraint
Ccorner point
Dfeasible region
Answer & Solution
Correct answer: A. objective function
The linear function Z = ax + by to be maximised or minimised is the objective function.
Related questions
If a feasible region of an LPP is empty, the problem isHungarian method for assignment problem requires the cost matrix to beAssignment problem is a special case ofMaximise Z = 3x + 2y subject to x + y ≤ 4, x ≥ 0, y ≥ 0. Maximum value of Z isIn LPP, optimal solution (if it exists) is found atThe feasible region of an LPP isIn a linear programming problem (LPP), the objective function isA linear program has an unbounded feasible region. The maximisation of the objective funct