[Coin-lpsolver] What is the best way of getting out N feasible extreme points?

[Yiming Yao]

I want to get N (say N= 10) feasible extreme points during 
ClpSimple::primal() or ClpSimplex::dual(), before an optimal solution is 
found. Any suggestions?

Thanks,

Yiming