If the planning horizon is reduced to a one-year period, then there is a single constraint, and the one-constraint capital bud problem is called
a. Set covering problem
b. Fixed charge problem
c. Shortest path problem
d. Knapsack problem
e. Maximum flow problem