Example 1
Question: In a Linear Programming Problem, a manufacturer wants to maximise profit \( Z = 5x + 8y \), where \( x \) and \( y \) are the number of units of two products, subject to certain production constraints. The expression \( Z = 5x + 8y \) that the manufacturer wants to maximise is called: (A) a constraint (B) a feasible function (C) an objective function (D) an optimal solution
Solution: In a Linear Programming Problem, we always have a function of the decision variables that needs to be either maximised or minimised. This specific function is defined as the Objective Function. Here, the expression to be maximised is \( Z = 5x + 8y \). Let us analyse each option: Option (A) — A constraint is a linear inequality or equation that restricts the values of the decision variables (for example, \( 2x + 3y \le 120 \)). So \( Z = 5x + 8y \) is not a constraint. Option (B) — There is no standard term called a 'feasible function' in LPP. The feasible region is the set of all points satisfying the constraints, but 'feasible function' is not a recognised term. Option (C) — The Objective Function is exactly the linear function of decision variables that is to be maximised or minimised. Here, \( Z = 5x + 8y \) fits this definition perfectly. Option (D) — An optimal solution is the specific point (value of \( x \) and \( y \)) at which the objective function attains its maximum or minimum value. It is a point, not the function itself. Therefore, \( Z = 5x + 8y \) is the Objective Function.
Answer: (C) an objective function
Example 2
Question: A transport company wishes to minimise the total cost \( C = 3x + 7y \), where \( x \) and \( y \) represent the number of trips made by two types of vehicles, subject to the conditions \( x + y \ge 10 \), \( x \ge 0 \), \( y \ge 0 \). In this Linear Programming Problem, which of the following correctly identifies the role of \( C = 3x + 7y \)? (A) It is a constraint of the problem. (B) It is the objective function to be minimised. (C) It represents the feasible region. (D) It is the optimal value of the problem.
Solution: To answer this, we recall the standard structure of a Linear Programming Problem. A Linear Programming Problem consists of: 1. Decision variables — here \( x \) and \( y \). 2. Objective Function — the linear function to be maximised or minimised. 3. Constraints — linear inequalities/equations restricting the variables. 4. Feasible Region — the graphical region satisfying all constraints. 5. Optimal Value — the maximum or minimum value of the objective function over the feasible region. Now let us examine each option for \( C = 3x + 7y \): Option (A) — The constraints here are \( x + y \ge 10 \), \( x \ge 0 \), \( y \ge 0 \). The expression \( C = 3x + 7y \) is not among the constraints. So Option (A) is incorrect. Option (B) — The problem explicitly states that \( C = 3x + 7y \) is to be minimised. Since it is a linear function of the decision variables \( x \) and \( y \) that needs to be minimised, it is by definition the Objective Function. So Option (B) is correct. Option (C) — The feasible region is the set of all points \( (x, y) \) satisfying all the constraints simultaneously; it is a region in the coordinate plane, not a function. So Option (C) is incorrect. Option (D) — The optimal value is the actual minimum value of \( C \) (a number), not the function \( C = 3x + 7y \) itself. So Option (D) is incorrect. Therefore, \( C = 3x + 7y \) is the objective function to be minimised.
Answer: (B) It is the objective function to be minimised.