Finding a point in the relative interior of a polyhedron

A new initialization or `Phase I' strategy for feasible interior point methods for linear programming is proposed that computes a point on the primal-dual central path associated with the linear program. Provided there exist primal-dual strictly feasible points - an all-pervasive assumption in...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí: Cartis, C, Gould, N
Formáid: Report
Foilsithe / Cruthaithe: Unspecified 2007

Míreanna comhchosúla