We must know, we will know !
万物并作，吾以观复

This blog is talking about three different characterizations of the corners of a polyhedron, say ${ P }$, and then show that all three characterizations are equivalent.

This blog talks about a polynomial time algorithm to Max flow problem, called ${ \Delta }$-Ford-Fulkerson Algorithm.

This blog is talking about polyhedra and convex set. We will study the feasible set from geometric way. And utilize this properties to get algebra method to solve LO problem.

This blog is talking about how to solve linear optimization problems involving two decision variables graphically.

This blog talks about the Ford-Fulkerson Algorithm to solve the max flow problem.

This blog is still talking about how to reformulate the optimization problem with objective function including absolute values to linear programming problem.

This blog is still talking about Piecewise linear convex objective functions. And today we will give some examples of transformation.

The following lectures will talk about some algorithms on graphs. This blog is about Max flow and Min cut problem, and how can they transfer to each other.