How can you formulate the 2-D proof of Sperner lemma as a linear programming problem?
I know that you have to divide the triangle up into smalled triangles with the original triangle having vertices labelled 0,1,2. However, I have no idea what to use as constraints or what to make the objective function. Please help answer this question.