A linear programming problem deals with the optimization of a/an : (A)logarithmic function (B) linear function (C) quadratic function (D) exponential function
CBSE Class 12 Maths · Linear Programming
CBSE Class 12 Maths · Linear Programming
Imagine you want to earn as much pocket money as possible by selling lemonade and cookies. The rule is: your earnings must follow a straight, simple formula like \( Z = ax + by \). Nothing curvy, nothing fancy — just plain multiplying and adding. That kind of straight formula is called a linear function. In a Linear Programming Problem, we always try to make the best choice using exactly this type of simple, straight formula. Curvy or complicated formulas are not allowed here.
Answer: Option (B): a linear function. A Linear Programming Problem deals with the optimization (maximization or minimization) of a linear objective function such as \( Z = ax + by \) subject to linear constraints.
In a Linear Programming Problem (LPP), we try to find the maximum or minimum value of a certain quantity subject to some restrictions. The quantity we want to maximize or minimize is called the objective function, and the restrictions are called constraints. As the name 'Linear' Programming suggests, both the objective function and the constraints must be linear. A linear function is a function in which each variable appears only to the first power, with no products of variables, no squares, no logarithms, and no exponentials. For example, \( Z = 3x + 4y \) is a linear objective function. Since LPP requires linearity throughout, the function being optimized is always a linear function, not logarithmic, quadratic, or exponential.
Objective function: \( Z = ax + by \), where \( a \) and \( b \) are constants, to be maximized or minimized subject to linear constraints such as \( a_1 x + b_1 y \le c_1 \), \( x \ge 0 \), \( y \ge 0 \).
Option (B): a linear function. A Linear Programming Problem deals with the optimization (maximization or minimization) of a linear objective function such as \( Z = ax + by \) subject to linear constraints.
A common mistake is thinking that because feasible regions and corner points are involved, the objective function could be quadratic or curved. In reality, both the objective function and all the constraints in an LPP must be strictly linear.
Option (B): a linear function. A Linear Programming Problem deals with the optimization (maximization or minimization) of a linear objective function such as \( Z = ax + by \) subject to linear constraints.
One common mistake: students sometimes confuse the objective function with the constraints and assume the objective function can be non-linear as long as the constraints remain linear — but in a standard LPP, the objective function must also be strictly linear.
Answer: Option (B): a linear function. A Linear Programming Problem deals with the optimization (maximization or minimization) of a linear objective function such as \( Z = ax + by \) subject to linear constraints.
Question: A factory produces two types of items, P and Q. The profit from each unit of P is ₹5 and from each unit of Q is ₹8. If \( x \) and \( y \) denote the number of units of P and Q produced respectively, which of the following correctly describes the nature of the profit function \( Z \) that is to be optimized in this Linear Programming Problem? (A) \( Z = 5x^2 + 8y^2 \) — a quadratic function (B) \( Z = 5x + 8y \) — a linear function (C) \( Z = e^{5x} + e^{8y} \) — an exponential function (D) \( Z = \log(5x + 8y) \) — a logarithmic function
Solution: In a Linear Programming Problem (LPP), the goal is to optimize (maximize or minimize) an objective function subject to a set of linear constraints. The profit function here is formed by adding the profits from each item: Profit from item P: \( 5x \) Profit from item Q: \( 8y \) Total profit: \( Z = 5x + 8y \) This function is of the form \( Z = ax + by \), where \( a = 5 \) and \( b = 8 \). Since the decision variables \( x \) and \( y \) appear only to the first power and are not inside any logarithm, exponential, or squared term, \( Z \) is a linear function. Option (A) involves \( x^2 \) and \( y^2 \), making it quadratic — NOT used in LPP. Option (C) uses exponentials — NOT used in LPP. Option (D) uses a logarithm — NOT used in LPP. Option (B) is the correct linear objective function used in LPP. Therefore, the correct answer is (B).
Answer: (B) \( Z = 5x + 8y \) — a linear function
Question: A school wants to arrange two types of activities, sports (S) and cultural events (C), at a minimum total cost. The cost per unit of sports activity is ₹12 and for cultural events is ₹9. Let \( x \) and \( y \) represent the number of units of sports and cultural activities respectively. In the corresponding Linear Programming Problem, the objective function to minimize total cost \( Z \) is best described as: (A) An exponential function of \( x \) and \( y \) (B) A quadratic function of \( x \) and \( y \) (C) A linear function of \( x \) and \( y \) (D) A logarithmic function of \( x \) and \( y \)
Solution: In a Linear Programming Problem, the function to be optimized is called the objective function, and it must always be a linear function of the decision variables. Here, the total cost is calculated as: Cost of sports activities: \( 12x \) Cost of cultural events: \( 9y \) Total cost: \( Z = 12x + 9y \) Let us check the nature of \( Z = 12x + 9y \): The variables \( x \) and \( y \) appear only to the first power. There are no terms like \( x^2 \), \( y^2 \), \( xy \), \( e^x \), \( \log x \), or similar non-linear expressions. Hence \( Z = 12x + 9y \) is purely a linear function of \( x \) and \( y \). The definition of LPP itself states that the objective function must be linear. Options (A), (B), and (D) describe non-linear functions, which do not apply to LPP. Therefore, the correct answer is (C).
Answer: (C) A linear function of \( x \) and \( y \)
Question: In a Linear Programming Problem, the constraints are always expressed as: (A) Quadratic inequalities in two variables (B) Exponential equations (C) Linear inequalities or equations in the decision variables (D) Logarithmic inequalities
Answer: Option (C): Linear inequalities or equations in the decision variables. In every LPP, the constraints are of the form \( p_i x + q_i y \le r_i \) (or \( = \) or \( \ge \)), ensuring both the objective function and the feasible region are defined by linear expressions.