In linear programming, if there are 'm' equations and 'n' variables, by making 'n-m' variables non basic(i.e. zero), we can get the corners of the feasible region. I could not understand how this works i.e., how we reach the corner points. Please explain.
Edited: I can understand that if the constraint coefficient matrix has full row rank ( m rows), keeping n-m variables zero will give a unique solution because 'm' independent vectors of 'm' dimensions combine to give a single vector of 'm' dimensions. But why should this unique solution (n dimension vector with at least n-m zero components) represent the corner point?