Which one is true for the problem complexity?

a$.$ All of the Linear Programming problems like Binary Knapsack are in NP$.$

b$.$ Some of the Integer Programming problems like Shortest Path are in P$.$

c$.$ Some of the Linear Programming problems like Facility Location is in NP$.$

d$.$ Some of the Integer Programming problems like Fractional Knapsack are in P$.$

Se$$imimi temizle