Correct option is C
Given:
S is a convex region bounded by straight lines.
is a linear objective function.
Formula Used:
The fundamental theorem of linear programming states that if an optimum solution exists, it occurs at an extreme point (vertex) of the feasible region.
Solution:
S is a convex region bounded by straight lines.
is a linear objective function.
Formula Used:
The fundamental theorem of linear programming states that if an optimum solution exists, it occurs at an extreme point (vertex) of the feasible region.
Solution:
Since the feasible region is convex and bounded by straight lines, the optimum value of the linear objective function is attained at one or more vertices of the feasible region.
Hence, the correct option is the vertices.
The correct answer is (c) The vertices only.
Hence, the correct option is the vertices.
The correct answer is (c) The vertices only.