We focus on the core of the simplex method. The first part includes the classic materials, such as simplex and dual simplex algorithms, duality, and optimality conditions. The second part involves our contributions supported by solid computational experiments, such as the double-phase simplex and dual simplex algorithms, the N-M rule, the simplex interior-point algorithm, and the optimal set.