A method of transferring polyhedron between the intersection-form and the sum-form

Quanling Wei, Hong Yan

Research output: Journal article publicationJournal articleAcademic researchpeer-review

20 Citations (Scopus)


A bounded polyhedron (or a polyhedral cone) can be given by either an intersection of linear inequalities, which is thus called intersection-form, or a convex combination (or nonnegative linear combination) of some given points, which is thus called sum-form. This paper first proposes a simple and effective method to transfer a bounded polyhedron or a polyhedral cone from the intersection-form to the sum-form. A new method is proposed to transfer a bounded polyhedron (or a polyhedral cone) from the sum-form to the intersection form. Both procedures can be completed in finite number of iterations. Numerical examples are given for illustration.
Original languageEnglish
Pages (from-to)1327-1342
Number of pages16
JournalComputers and Mathematics with Applications
Issue number10-11
Publication statusPublished - 1 May 2001


  • Convex combination
  • Intersection-form
  • Polyhedron
  • Sum-form

ASJC Scopus subject areas

  • Applied Mathematics
  • Computational Mathematics
  • Modelling and Simulation

Cite this