Constraints
Trending Questions
If , then the value of at is equal to
The linear inequalities or equations or restrictions on the variables of a linear programming problem are called...... The conditions x ≥ 0, y ≥ 0 are called.......
Objective functions, non-negative restrictions
Constraints, non-negative restrictions
Objective functions, optimal value
Constraints, negative restrictions
A merchant plans to sell two types of personal computers a desktop model and a portable model that will cost Rs. 25000 and Rs. 40000 respectively. He estimates that the total monthly demand of computers will not exceed 250 units. Determine the number of units of each type of computers which the merchant should stock to get maximum profit, if he does not want to invest more than Rs. 70 lakh and if his profit on the desktop model Rs. 4500 and on portable model is Rs. 5000.
Why is it called linear programming?
The feasible region for an LPP is shown in the following figure. Let F=3x-4y be the objective function. Maximum value of F is
(a)0
(b)8
(c)12
(d)-18
- (0, 2) only
- (3, 0) only
- the mid-point of the line segment joining the points (0, 2) and (3, 0) only
- any point on the line segment joining the points (0, 2) and (3, 0)
- Zmax=1
- Zmin=−1
- Zmin=0
- No feasible solution is possible.
- Less than 5
- Less than 72
- Less than 512
- Unlimited
- Less than 1, 024
- 10
- 9
- 23519
- 25519
- 12
- 16
- 20
- 24
- 5p=2q
- 2p=5q
- p=2q
- q=3p
Which of the term is not used in a linear programming problem?
Optimal solution
Feasible solution
Concave region
Objective function
- p=q
- p=2q
- p=3q
- q=3p
Minimum z = x + 2y subject to x ≤ 20, y ≥ 10, x ≥ 0, y ≥ 0
40
20
30
10
Vitamin A |
Vitamin B |
Vitamin |
Vitamin D |
|
Food X Food Y |
1 2 |
1 1 |
1 3 |
2 1 |