Vector equilibrium flows with nonconvex ordering relations

Research output: Journal article publicationJournal articleAcademic researchpeer-review

3 Citations (Scopus)


In this note we introduce the concept of vector network equilibrium flows when the ordering cone is the union of finitely many closed and convex cones. We show that the set of vector network equilibrium flows is equal to the intersection of finitely many sets, where each set is a collection of vector equilibrium flows with respect to a closed and convex cone. Sufficient and necessary conditions for a vector equilibrium flow are presented in terms of scalar equilibrium flows.
Original languageEnglish
Pages (from-to)537-542
Number of pages6
JournalJournal of Global Optimization
Issue number4
Publication statusPublished - 1 Apr 2010


  • Nonconvex ordering
  • Solution set
  • Vector network equilibrium flow
  • Vector variational inequality

ASJC Scopus subject areas

  • Computer Science Applications
  • Control and Optimization
  • Management Science and Operations Research
  • Applied Mathematics


Dive into the research topics of 'Vector equilibrium flows with nonconvex ordering relations'. Together they form a unique fingerprint.

Cite this