Question:
Fill in the blanks
$ (i)$ In a $LPP$, the objective function is always
$(ii)$ The feasible region for a $LPP$ is always a polygon.
$(iii)$ A feasible region of a system of linear inequalities is said to be , if it can be enclosed within a circle.
$(iv)$ In a $LPP$, if the objective function $Z = ax + by$
has the same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same value.
Fill in the blanks
$ (i)$ In a $LPP$, the objective function is always
$(ii)$ The feasible region for a $LPP$ is always a polygon.
$(iii)$ A feasible region of a system of linear inequalities is said to be , if it can be enclosed within a circle.
$(iv)$ In a $LPP$, if the objective function $Z = ax + by$
has the same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same value.
Updated On: Jul 6, 2022
- a
- b
- c
- d
Hide Solution
Verified By Collegedunia
The Correct Option is D
Solution and Explanation
$(i)$ In a $LPP$, objective function is always linear.
$(ii)$ The feasible region for a $LPP$ is always a convex polygon.
$(iii)$ A feasible region of a system of linear inequalities is said to be bounded, if it can be enclosed within a circle.
$ (iv)$ In a $LPP$, if the objective function $Z = ax + by$ has the same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same maximum value.
Was this answer helpful?
0
0
Top Questions on Linear Programming Problem
- Solve the following linear programming problem graphically: \[ \text{Minimise } Z = 2x + y \] subject to the constraints: \[ 3x + y \geq 9, \] \[ x + y \geq 7, \] \[ x + 2y \geq 8, \] \[ x, y \geq 0. \]
- CBSE CLASS XII - 2025
- Mathematics
- Linear Programming Problem
- Assertion (A): Every point of the feasible region of a Linear Programming Problem is an optimal solution.
Reason (R): The optimal solution for a Linear Programming Problem exists only at one or more corner point(s) of the feasible region.- CBSE CLASS XII - 2025
- Mathematics
- Linear Programming Problem
- A factory produces two products X and Y. The profit earned by selling X and Y is represented by the objective function \( Z = 5x + 7y \), where \( x \) and \( y \) are the number of units of X and Y respectively sold. Which of the following statements is correct?
- CBSE CLASS XII - 2025
- Mathematics
- Linear Programming Problem
- Corner points of the feasible region for an LPP are $(0, 2), (3, 0), (6, 0), (6, 8)$ and $(0, 5)$. Let $z = 4x + 6y$ be the objective function. The minimum value of $z$ occurs at:
- KCET - 2024
- Mathematics
- Linear Programming Problem
Given the Linear Programming Problem:
Maximize \( z = 11x + 7y \) subject to the constraints: \( x \leq 3 \), \( y \leq 2 \), \( x, y \geq 0 \).
Then the optimal solution of the problem is:- KEAM - 2024
- Mathematics
- Linear Programming Problem
View More Questions
Notes on Linear Programming Problem
Concepts Used:
Linear Programming
Linear programming is a mathematical technique for increasing the efficiency and effectiveness of operations under specific constraints. The main determination of linear programming is to optimize or minimize a numerical value. It is built of linear functions with linear equations or inequalities restricting variables.
Characteristics of Linear Programming:
- Decision Variables: This is the first step that will determine the output. It provides the final solution to the problem.
- Constraints: The mathematical form in which drawbacks are expressed, regarding the resource.
- Data: They are placeholders for known numbers to make writing complex models simple. They are constituted by upper-case letters.
- Objective Functions: Mathematically, the objective function should be quantitatively defined.
- Linearity: The function's relation between two or more variables must be straight. It indicates that the variable's degree is one.
- Finiteness: Input and output numbers must be finite and infinite. The best solution is not possible if the function consists infinite components.
- Non-negativity: The value of the variable should be either positive (+ve) or 0. It can't be a negative (-ve) number.