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...

पूर्ण विवरण

ग्रंथसूची विवरण
मुख्य लेखकों: Cartis, C, Gould, N
स्वरूप: Report
प्रकाशित: Unspecified 2007

समान संसाधन