Question:
In a linear programming problem, the linear function which has to be maximized or minimized is called:
In a linear programming problem, the linear function which has to be maximized or minimized is called:
Show Hint
An objective function is always expressed in terms of decision variables, usually written as $Z = cx + dy$.
Updated On: Jul 4, 2026
- a feasible function
- an objective function
- an optimal function
- a constraint
Show Solution
Verified By Collegedunia
The Correct Option is B
Solution and Explanation
Concept:
Linear Programming Problems (LPP) involve optimizing a linear mathematical relationship under specific limitations. Let us define the key terminology used in LPP:
• Objective Function: The linear function $Z = ax + by$ that needs to be maximized (e.g., maximizing profit) or minimized (e.g., minimizing costs).
• Constraints: The system of linear inequalities or equations that restrict the values of decision variables.
• Feasible Region: The common region determined by all given constraints.
Step 1: Analyze the definition of an objective function.
By definition, any optimization problem requires a target goal or function to measure performance. In LPP, this mathematical relation represents the core outcome we wish to drive to its best extreme (maximum or minimum). This function is universally called the Objective Function. Therefore, option (B) is the correct statement.
• Objective Function: The linear function $Z = ax + by$ that needs to be maximized (e.g., maximizing profit) or minimized (e.g., minimizing costs).
• Constraints: The system of linear inequalities or equations that restrict the values of decision variables.
• Feasible Region: The common region determined by all given constraints.
Step 1: Analyze the definition of an objective function.
By definition, any optimization problem requires a target goal or function to measure performance. In LPP, this mathematical relation represents the core outcome we wish to drive to its best extreme (maximum or minimum). This function is universally called the Objective Function. Therefore, option (B) is the correct statement.
Was this answer helpful?
0
0
Top CBSE CLASS XII Mathematics Questions
- 2, b, c are in A.P. and the range of determinant $\begin{vmatrix}1&1&1\\ 2&b&c\\ 4&b^{2}&c^{2}\end{vmatrix}$ is [2, 16]. Then find range of c is
- A committee of 11 members is to be formed from 8 males and 5 females. Let m denotes the number of ways of selecting committee having atleast 6 males and n denotes the number of ways of selecting atleast 3 females then
Determine whether each of the following relations are reflexive, symmetric, and transitive.
- Relation R in the set A={1,2,3,...13,14} defined as R={(x,y): 3x-y=0}.
- Relation R in the set of N natural numbers defined as R={(x,y): y=x+5 and x<4}.
- Relation R in the set A={1,2,3,4,5,6} defined as R={(x,y): y is divisible by x}.
- Relation R in the set of Z integers defined as R={(x,y): x-y is an integer}
- Relation R in the set of human beings in a town at a particular time given by
- R={(x,y): x and y work at same place}
- R={(x,y): x and y live in the same locality}
- R={(x,y): x is exactly 7 am taller that y}
- R={(x,y): x is wife of y}
- R={(x,y):x is father of y}
Show that the relation R in the set R of real numbers, defined as
R = {(a, b): a ≤ b2 } is neither reflexive nor symmetric nor transitive.Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as
R = {(a, b): b = a + 1} is reflexive, symmetric or transitive.
View More Questions
Top CBSE CLASS XII Linear Programming Questions
- In a linear programming problem, the linear function which has to be maximized or minimized is called
For the feasible region shown below, the non-trivial constraints of the linear programming problem are
- Solve the following linear programming problem graphically:
Maximize \[ Z = 8000x + 12000y \] Subject to the constraints
\[ 3x + 4y \le 60 \] \[ x + 3y \le 30 \] \[ x \ge 0,\; y \ge 0 \] - For a feasible region bounded by the corner points $(0,3)$, $(3,2)$, and $(5,0)$ in the first quadrant, the non-trivial constraints of the linear programming problem are:
- Solve the following linear programming problem graphically: Maximize \( Z = 8000x + 12000y \) subject to the boundary constraints: \( 3x + 4y \le 60 \), \( x + 3y \le 30 \), with non-negativity restrictions \( x \ge 0, y \ge 0 \).
View More Questions
Top CBSE CLASS XII Questions
- 2, b, c are in A.P. and the range of determinant $\begin{vmatrix}1&1&1\\ 2&b&c\\ 4&b^{2}&c^{2}\end{vmatrix}$ is [2, 16]. Then find range of c is
- A boy of mass 50 kg is standing at one end of a, boat of length 9 m and mass 400 kg. He runs to the other, end. The distance through which the centre of mass of the boat boy system moves is
- A capillary tube of radius r is dipped inside a large vessel of water. The mass of water raised above water level is M. If the radius of capillary is doubled, the mass of water inside capillary will be
- A circular disc is rotating about its own axis. An external opposing torque 0.02 Nm is applied on the disc by which it comes rest in 5 seconds. The initial angular momentum of disc is
- A circular disc is rotating about its own axis at uniform angular velocity \(\omega.\) The disc is subjected to uniform angular retardation by which its angular velocity is decreased to \(\frac {\omega}{2}\) during 120 rotations. The number of rotations further made by it before coming to rest is
View More Questions