Home › Maharashtra HSC (Class 12) › 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
Two depots hold 180 and 250 tons; two customers order 200 and 150 tons. After the cheapestA gardener needs AT LEAST 10 units of chemical A. A jar gives 5 units and a carton 1 unit.A gardener needs at least 10, 12 and 12 units of chemicals A, B and C. Jars cost 3,000 andMine A gives 1, 3 and 5 tons of high, medium and low grade ore daily; mine B gives 2 tons Profit is Shs. 3000 on a ring and Shs. 1900 on a chain. With $x$ rings and $y$ chains, theA firm makes $x$ rings and $y$ chains, at most 24 items a day. A ring takes 1 hour, a chaiSome problems minimise a linear function subject to given:A linear programming problem must have constraints that are: