Which correctly defines a basic solution?

A basic solution, in the context of linear programming, refers to a feasible solution where the number of non-zero variables is equal to the number of constraints, and all constraints are satisfied. This solution is typically found at the vertices of the feasible region defined by the constraints. In simpler terms, a basic solution represents a corner point of the solution space where certain variables are set to zero while others take on positive values.