Zaymiey

📐 Mathematics  ·  Linear Programming  ·  JEE

A transportation problem in linear programming typically minimizes:

Answer: Total transportation cost while meeting supply and demand.

  • A Total profit earned across all supply routes
  • B Total transportation cost while meeting supply and demand
  • C The number of warehouses included in the supply network
  • D Travel time only, ignoring cost considerations entirely

Correct answer: B. Total transportation cost while meeting supply and demand

Explanation: A transportation problem minimizes the total cost of moving goods from sources (factories or warehouses) to destinations (markets), subject to supply and demand constraints.

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 →