5. Any feasible solution which optimizes the objective function of a General linear
programming problem is called an ___________ to the General linear programming
problem.
a) Solution b) Optimum solution c) feasible solution d) basic solution.
Answers
Answered by
1
Answer:
Option (b) is correct answer of this Question .
Answered by
0
The correct answer is OPTION B: Optimum Solution
- In some cases, a solution is already known; in others, the most difficult part of the task is finding a practical answer.
- An optimal solution achieves the objective function's greatest or minimum value, such as the highest profit or the lowest cost.
- Other globally optimal solutions with greater objective function values do not exist.
- Because there are no "nearby" possibilities with higher objective function values, the solution is local optimum.
Similar questions