Zaymiey

📐 Mathematics  ·  Linear Programming  ·  JEE

A diet problem in linear programming typically aims to:

Answer: Minimize cost while meeting nutritional requirements.

  • A Maximize the number of distinct food items selected
  • B Minimize cost while meeting nutritional requirements
  • C Maximize the total transportation distance covered
  • D Minimize the number of nutrients tracked in the constraints

Correct answer: B. Minimize cost while meeting nutritional requirements

Explanation: In a diet problem, the objective is usually to minimize the cost of a diet while satisfying minimum requirements of nutrients like proteins and vitamins.

Feasible Region and Corner PointsxyOABCfeasible regionZ = ax+by is evaluated ONLY at corners O, A, B, C - the optimum is always at one of these

The feasible region (shaded) is bounded by the constraint lines; the fundamental theorem of LPP guarantees the optimal value of the objective function occurs at one of the corner points (O, A, B, C), so only these need to be checked, not the entire region.

Concept context

Optimizing a linear objective function subject to linear constraints using the graphical corner point method.

Read the full Linear Programming notes →