Greedy Principle Preview is a result in [matroid theory](/page/Matroid%20Theory). It formalizes the assertion that let be a finite set and let be a nonempty hereditary family, whose maximal members under inclusion are called bases. For a weight function , consider any ordering of by nonincreasing weight and let the greedy algorithm successively add an.