$21.$ What is the primary advantage of interior$-$point methods, such as Karmarkar's algorithm, over simplex methods for solving linear programming problems?

a$)$ They are easier to implement

b$)$ They always find the optimal solution

c$)$ They have polynomial$-$time complexity

d$)$ They do not require initialization