Question:
Objective function of a linear programming problem is:
Objective function of a linear programming problem is:
Show Hint
In linear programming, the objective function is always linear. Non-linear objective functions are part of quadratic programming.
Updated On: Feb 2, 2026
- Always quadratic
- Always linear
- May be linear or quadratic depending on the problem
- May be cubic sometimes
Show Solution
Verified By Collegedunia
The Correct Option is B
Solution and Explanation
Step 1: Understanding the Objective Function.
The objective function in a linear programming problem is always a linear function. It is a mathematical function that needs to be maximized or minimized, subject to a set of linear constraints. The form of the objective function is always linear, hence option (B) is correct. Step 2: Conclusion.
Thus, the objective function in linear programming is always linear, corresponding to option (B).
The objective function in a linear programming problem is always a linear function. It is a mathematical function that needs to be maximized or minimized, subject to a set of linear constraints. The form of the objective function is always linear, hence option (B) is correct. Step 2: Conclusion.
Thus, the objective function in linear programming is always linear, corresponding to option (B).
Was this answer helpful?
0
0
Top PSEB Mathematics Questions
- Relation \( R = \{(x, y) : x<y^2 \text{ where } x, y \in \mathbb{R}\} \) is:
- Range of function \( \cos^{-1} x \) is:
- Principal value of \( \sin^{-1}(1) \) is:
- If \( A \) is a square matrix of order \( 2 \times 2 \) and \( |A| = 5 \), then \( |Adj(A)| \) is:
If
then \( y \) is equal to:
View More Questions
Top PSEB Linear Programming Questions
- Objective function of a linear programming problem is:
- Solve the following linear programming problem graphically: Maximize and minimize \( Z = 4x + 2y - 7 \) subject to the constraints \( x + 3y \le 60, x + y \ge 10, x - y \le 0, x \ge 0, y \ge 0 \).
Correct Answer: Max Value \( Z = 73 \) at \( (15, 15) \); Min Value \( Z = 13 \) at \( (5, 5) \). (Based on standard corner point analysis)
- Solve the following linear programming problem graphically: Maximise and minimise \( Z = 4x + 2y - 7 \) subject to the constraints: \[ x + 3y \leq 60, \quad x + y \geq 10, \quad x - y \leq 0, \quad x \geq 0, \quad y \geq 0 \]
- Maximum value of \( Z = 3x + y \) for the constraints \( x + y \leq 4, x \geq 0, y \geq 0 \) is:
- Objective function of a L.P.P is a function to be optimized.
Top PSEB Questions
- Under which method of valuation of Goodwill, normal rate of return is not required?
- An increase in the value of assets is recorded on which side of the Revaluation Account?
- J, K, L, M are in partnership sharing profits and losses in ratio of 9 : 6 : 5 : 5. 'N' joins the partnership for 20% share. J, K, L and M would in future share profits among themselves as 3 : 4 : 2 : 1. The new profit sharing ratio will be:
- X, Y and Z are three partners sharing profits in the ratio 10 : 7 : 7. Z retired. X and Y decided to share profits in equal ratio. Gaining ratio will be:
- Rent paid to a partner is _________ against profit. (charge/appropriation)
View More Questions