An optimal solution of a linear programming problem is related to : (A) Logarithmic function (B) Linear functi

Question

Q. An optimal solution of a linear programming problem is related to : (A) Logarithmic function (B) Linear function (C) Quadratic function (D) Exponential function

CBSECBSE Class XII Board 2024MCQ· 1mImportance★★★★★

🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

Concept understanding — Linear Programming Constraints

Linear Programming Constraints

Imagine you run a small workshop making chairs and tables. You have only so much wood, so many labour hours, and so much machine time. You would love to make everything at once, but the resources are finite. Those limits are your constraints — the rules that decide what is actually possible.

A constraint says, in effect: you cannot use more of a resource than you have. In a linear programming (LP) problem, every such rule is written as a linear inequality in the decision variables.

What a constraint looks like

Suppose $x$ and $y$ are your decision variables (say, acres of wheat and barley). A typical constraint has the form

a_1 x + a_2 y \leq b \qquad\text{or}\qquad a_1 x + a_2 y \geq b,

where the $a_i$ are the coefficients (how much of a resource each unit consumes) and $b$ is the amount available. For example, if wheat needs $2$ bags of fertiliser per acre, barley needs $1$ , and you have $200$ bags:

2x + y \leq 200.

Important

Every constraint must be linear — no $x^2$ , no $\sin x$ , no $xy$ . Variables appear only to the first power, multiplied by constants and added. That is exactly what makes it linear programming.

Types you will meet

Type	Symbol	Meaning
Upper bound	$\leq$	cannot exceed a limit (e.g. labour $\leq 300$ )
Lower bound	$\geq$	must meet a minimum (e.g. protein $\geq 50$ )
Non-negativity	$x,\,y \geq 0$	quantities cannot be negative

Watch out

The non-negativity constraints $x \geq 0,\ y \geq 0$ are almost always required — you cannot make a negative number of chairs — yet they are the ones students most often forget to write.

How constraints shape the problem

Each linear inequality divides the plane into two halves — a half-plane. The set of points satisfying all the constraints at once is their common region, called the feasible region. Any point inside it is an allowed plan; any point outside breaks at least one rule. …

Start your 14-day free trial to unlock the full solution →

Linear programming problems are about optimizing (maximizing or minimizing) a linear function (the objective) subject to linear constraints. The optimal solution is always tied to this linear objective, so the correct answer is (B) Linear function.

The heart of linear programming is the word linear. Every part of the problem — the goal you're trying to achieve and the rules you must follow — is expressed as a straight-line relationship. There are no curves, no exponents, no logs.

Think of it this way: you have a budget to buy two types of items. Your total cost is price_A × quantity_A + price_B × quantity_B. That's a linear function. You also have constraints like "I can't carry more than 10 kg" — that's another linear inequality. The best combination (the optimal solution) is found at a corner of the feasible region, and that corner is determined entirely by these straight-line equations.

Identify the objective function. In any linear programming problem, you are trying to maximize or minimize something — profit, cost, time, etc. This "something" is always a linear function of the decision variables. For example: $Z = 3x + 5y$ .
Constraints are also linear. All the restrictions (like $x + 2y \leq 10$ , $x \geq 0$ , $y \geq 0$ ) are linear inequalities or equations. They form a straight-edged polygon (or polyhedron in higher dimensions) called the feasible region.
The optimal solution lives at a vertex. Because the objective function is linear, its value changes at a constant rate as you move in any direction. The maximum or minimum of such a function over a convex polygon always occurs at one of the corners (vertices) of the feasible region — never at a point where the function curves.
Why not the other options? …

Start your 14-day free trial to unlock the full solution →

Same / Similar Concept — real previous-year questions on the same or a closely similar concept, not this exact question.

Showing the 12 most recent of 14 on this concept.

CBSE 2024Set 65/1/11 markMCQ
$Q. An optimal solution of a linear programming problem is related to : (A) Logarithmic function (B) Linear function (C) Quadratic function (D) Exponential function$
›Reveal solutionSolution
Linear programming problems are about optimizing (maximizing or minimizing) a linear function (the objective) subject to linear constraints. The optimal solution is always tied to this linear objective, so the correct answer is (B) Linear function.

The heart of linear programming is the word linear. Every part of the problem — the goal you're trying to achieve and the rules you must follow — is expressed as a straight-line relationship. There are no curves, no exponents, no logs.

Think of it this way: you have a budget to buy two types of items. Your total cost is price_A × quantity_A + price_B × quantity_B. That's a linear function. You also have constraints like "I can't carry more than 10 kg" — that's another linear inequality. The best combination (the optimal solution) is found at a corner of the feasible region, and that corner is determined entirely by these straight-line equations.

Identify the objective function. In any linear programming problem, you are trying to maximize or minimize something — profit, cost, time, etc. This "something" is always a linear function of the decision variables. For example: $Z = 3x + 5y$ .

Constraints are also linear. All the restrictions (like $x + 2y \leq 10$ , $x \geq 0$ , $y \geq 0$ ) are linear inequalities or equations. They form a straight-edged polygon (or polyhedron in higher dimensions) called the feasible region.

The optimal solution lives at a vertex. Because the objective function is linear, its value changes at a constant rate as you move in any direction. The maximum or minimum of such a function over a convex polygon always occurs at one of the corners (vertices) of the feasible region — never at a point where the function curves.

Why not the other options? …
Start your 14-day free trial to see the full solution →
CBSE 2024Set 65/3/11 markMCQ
$Q. The restrictions imposed on decision variables involved in an objective function of a linear programming problem are called: (A) feasible solutions (B) constraints (C) optimal solutions (D) infeasible solutions$
›Reveal solutionSolution
In Linear Programming, the restrictions on decision variables are called constraints. They define the feasible region within which the optimal solution is found.

The core idea of Linear Programming (LP) is to optimize (maximize or minimize) a linear objective function, like profit or cost, subject to a set of linear restrictions. These restrictions are not optional — they are the boundaries of reality. For example, a factory cannot use more raw material than it has in stock, or a worker cannot work more than 24 hours a day.

These restrictions are what we call constraints. They are the mathematical inequalities or equations that limit the values the decision variables can take. Without constraints, the objective function could be made arbitrarily large (or small), and there would be no meaningful problem to solve.

The other options are related but distinct:

Feasible solutions are any points that satisfy all the constraints.

Optimal solutions are the feasible solutions that give the best value of the objective function.

Infeasible solutions violate at least one constraint.

So, the restrictions themselves are the constraints.

Identify the core concept: The question asks for the name of the "restrictions imposed on decision variables" in an LP problem. …
Start your 14-day free trial to see the full solution →
CBSE 2024Set A11 markMCQ
$Q. Which of the following is a non negative constraints in a Linear Programming Problem?$
(a) $x \geq 0,\ y \leq 0$
(b) $x \leq 0,\ y \leq 0$
(c) $x \geq 0,\ y \geq 0$
(d) $x \leq 0,\ y \geq 0$
›Reveal solutionSolution

The standard non-negative restriction is $x\ge0,\ y\ge0$ , so (c).

In a linear programming problem the decision variables cannot be negative, so the non-negative cons …
Start your 14-day free trial to see the full solution →
CBSE 2024Set ANNUAL1 mark
$x \ge 0, y \ge 0$
›Reveal solutionSolution

$x\ge0$ and $y\ge0$ together describe the first quadrant, including its boundary axes.

The inequation $x\ge0$ represents all points on or to the right of the $y$ -axis, and $y\ge0$ represents all points on or above the $x$ -axis. The intersection of these two half-planes is the region bounded by, and including, the non-negative $x$ -axis and non-nega …

Start your 14-day free trial to see the full solution →
CBSE 2023Set 65/3/11 markMCQ
$x + 2y = 4$
(a) $x + 2y \geq 4$ , $x + y \leq 3$ , $x \geq 0$ , $y \geq 0$
(b) $x + 2y \leq 4$ , $x + y \leq 3$ , $x \geq 0$ , $y \geq 0$
(c) $x + 2y \geq 4$ , $x + y \geq 3$ , $x \geq 0$ , $y \geq 0$
(d) $x + 2y \geq 4$ , $x + y \geq 3$ , $x \leq 0$ , $y \leq 0$
›Reveal solutionSolution
The feasible region is the intersection of the half-planes that lie above $x+2y=4$ and below $x+y=3$ , together with the first quadrant. This matches option (a).

The key to this problem is understanding how a linear inequality translates into a half-plane on the graph. Every line $ax+by=c$ splits the plane into two halves: one where $ax+by \ge c$ and the other where $ax+by \le c$ . The feasible region is the overlap of all such half-planes, plus the non-negativity constraints $x\ge0$ , $y\ge0$ (which restrict us to the first quadrant).

The figure shows a triangular region bounded by the two given lines and the axes. Let’s work out which side of each line contains the shaded area.

Identify the line $x+2y=4$ .

This line meets the axes at $(4,0)$ and $(0,2)$ . The shaded region lies above this line — for example, the point $(0,3)$ is inside the shaded area. Check: $0+2(3)=6 \ge 4$ . So the inequality is $x+2y \ge 4$ .

Identify the line $x+y=3$ .

This line meets the axes at $(3,0)$ and $(0,3)$ . The shaded region lies below this line — the point $(0,0)$ is outside the shaded area, but a point like $(1,1)$ inside gives $1+1=2 \le 3$ . So the inequality is $x+y \le 3$ .

Non-negativity constraints.

The shaded region is entirely in the first quadrant: $x\ge0$ , $y\ge0$ . Any point with a negative coordinate (like $(-1,2)$ ) would lie outside the shaded area.

Match with the options.

Option (a): $x+2y \ge 4$ , $x+y \le 3$ , $x\ge0$ , $y\ge0$ — exactly what we found.

Option (b): $x+2y \le 4$ would put the region below that line, which is the opposite side. …
Start your 14-day free trial to see the full solution →
CBSE 2023Set M1 mark
$Q. Define feasible region in a linear programming problem.$
›Reveal solutionSolution

Tests an LPP definition: the feasible region is the set of all points satisfying every constraint.

Definition. In a linear programming problem, the feasible region is the common region determined by all the constraints together with the non-negativity restrictions $x\ge 0,\;y\ge 0$ . Every point in this region is a feasible solution, and points outside it are infeasible. …
Start your 14-day free trial to see the full solution →
CBSE 2022Set M1 mark
$Q. Define feasible region in a linear programming problem.$
›Reveal solutionSolution

The feasible region is the set of all points satisfying every constraint of the LPP.

In a linear programming problem, the feasible region is the common region determined by all the constraints, including the non-negativity restrictions $x\ge 0,\ y\ge 0$ . Every point of this region …
Start your 14-day free trial to see the full solution →
CBSE 2020Set HE8231 mark
$x\ge 0$
›Reveal solutionSolution

This common region is called the feasible region of the LPP.

In a Linear Programming Problem, each constraint (including the non-negativity restrictions $x\ge0,\,y\ge0$ ) defines a half-plane. The set of points $(x,y)$ satisfying every constraint simultaneously — i.e. the intersection of all these half-planes — is called the feasible region. Every point of this region is called a feasible s …

Start your 14-day free trial to see the full solution →
CBSE 2020Set HE8231 mark
$Q. Write true or false: Any point outside the feasible region is the feasible solution.$
›Reveal solutionSolution

The statement is False.

The feasible region of an LPP is precisely the set of all points satisfying every constraint of the problem; these points (and only these) are called feasible solutions. Any point lying outside the feasible region fails to satisfy at least one constraint, and is therefore cal …

Start your 14-day free trial to see the full solution →
CBSE 2020Set ANNUAL1 mark
$Q. Define the feasible solution of the Linear Programming problem.$
›Reveal solutionSolution

A feasible solution is simply any point that lies inside (or on the boundary of) the feasible region.

In a linear programming problem, a feasible solution is any set of values of the decision variables (e.g. $x,y$ ) that satisfies ALL the given constraints (including the non-negativity restrictions $x\ge0,y\ge0$ ) simultaneously. The collection of all feasible solutions is called the feasible region. Every feasible solution is a candidate for the optimal solution, but not every fe …

Start your 14-day free trial to see the full solution →
CBSE 2019Set HE1 mark
$Q. Write True or False: The feasible region of a Linear Programming Problem is always a linear polygon.$
›Reveal solutionSolution

The feasible region is always convex, but calling it "always a linear polygon" is false since it can be an unbounded region.

The feasible region of an LPP is the set of points satisfying all the linear constraints simultaneously — it is always a convex set bounded by straight-line edges. However, it is not always a closed polygon: when the constraints don't fully enclose the region (e.g. only $\ge$ type c …

Start your 14-day free trial to see the full solution →
CBSE 2019Set ANNUAL1 mark
$2x + 3y \le 6$
›Reveal solutionSolution

Plot the line $2x+3y=6$ and shade the region satisfying all three constraints in the first quadrant.

The line $2x+3y=6$ meets the axes at $(3,0)$ (put $y=0$ ) and $(0,2)$ (put $x=0$ ).

Since $2x+3y\le6$ , the feasible side is towards the origin (test $(0,0)$ : $0\le6$ , true, so the origin's side is included).

…

Start your 14-day free trial to see the full solution →

Q.An optimal solution of a linear programming problem is related to : (A) Logarithmic function (B) Linear function (C) Quadratic function (D) Exponential function

🎓Unlock everything free for 14 days

Q.An optimal solution of a linear programming problem is related to :
(A) Logarithmic function
(B) Linear function
(C) Quadratic function
(D) Exponential function

Unlock everything free for 14 days