Mathematics · Linear Programming

For any Linear Programming Problem (LPP), consider the following statements: A. There exists only a finite number of basic feasible solutions to the LPP. B. Any convex combination of k different optimum solutions to an LPP is again an optimum solution to the problem. C. If an LPP has a feasible solution, then it also has a basic feasible solution. D. A basic solution to AX = b is degenerate if one or more of the basic variables vanish. Which of the statements are correct?