  We show that finding lexicographically minimal $n$ bases in a matroid can be
done in polynomial time in the oracle model. This follows from a more general
result that the shifted problem over a matroid can be solved in polynomial time
as well.
