Loading...
A linear programming problem deals with the optimization of a/an :
The number of corner points of the feasible region determined by constraints x ≥ 0, y ≥ 0, x + y ≥ 4 is :
Solve the following linear programming problem graphically : Maximise z = 500x + 300y, subject to constraints x + 2y ≤ 12 2x + y ≤ 12 4x + 5y ≥ 20 x ≥ 0, y ≥ 0
The common region determined by all the constraints of a linear programming problem is called :
The month of September is celebrated as the Rashtriya Poshan Maah across the country. Following a healthy and well-balanced diet is crucial in order to supply the body with the proper nutrients it needs. A balanced diet also keeps us mentally fit and promotes improved level of energy. A dietician wishes to minimize the cost of a diet involving two types of foods, food X (x kg) and food Y (y kg) which are available at the rate of ₹ 16/kg and ₹ 20/kg respectively. The feasible region satisfying the constraints is shown in Figure-2. On the basis of the above information, answer the following questions :
Of the following, which group of constraints represents the feasible region given below?
© 2026 PadhAiPro. This question is provided for educational purposes.
