Home › Maharashtra HSC Class 12 (Commerce) › businessmathematics › Linear Programming › In a linear programming problem (LPP), the objec…
In a linear programming problem (LPP), the objective function is
AAlways quadratic (typical) (typical) (typical) (typical)
BA constraint (typical) (typical) (typical) (typical) (typical)
CExponential (typical) (typical) (typical) (typical) (typical)
DA linear function of decision variables to be maximised or minimised
Answer & Solution
Correct answer: D. A linear function of decision variables to be maximised or minimised
1. LPP optimises (max or min) a linear function of decision variables.
2. The decision variables are non-negative and subject to linear constraints.
3. Objective function takes the form Z = c₁x₁ + c₂x₂ + … + cₙxₙ.
4. Hence (B) is correct.
_Source: Maharashtra Balbharati Std XII Mathematics & Statistics (Commerce), Ch 6 "Linear Programming", §6.1 ¶§6.1_
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 isA linear program has an unbounded feasible region. The maximisation of the objective functThe non-negativity constraints in an LPP typically include: