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

This blog is talking about how to move to another basic feasible solution and how to judge the basic feasible solution is optimal.

This blog will talking about a randomized rounding algorithm.

This blog is talking about the relation between extreme points and optimality of LO Problem.

This blog will talking about the gready algorithm to solve unweighted and weighted set cover problem. And in the end we will show how to use dual problem to analyze to get better approximation bound.

This blog talks about Out-of-Order (OoO) Superscalar pipeline. We will give what hardware do in each stage.

This blog will talking about an algorithm that construct a solution for LP instead of solving LP.

This blog is talking about the when there exists extreme points. The key idea of solving LP problem is optimal solution will be at basic feasible solution. But, some polyhedron have no extreme point. This blog will introduce how to tell a polyhedron processes at least one extreme point.

This blog will talking about the rounding algorithm of set cover problem.