Some Characterizations of Ideal Points in Vector Optimization Problems | Zendy

Yanfei Chai | Zendy; Yeol Je Cho | Zendy; Jun Li | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Some Characterizations of Ideal Points in Vector Optimization Problems

Author(s) -

Yanfei Chai,

Yeol Je Cho,

Jun Li

Publication year - 2008

Publication title -

journal of inequalities and applications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.735

H-Index - 50

eISSN - 1029-242X

pISSN - 1025-5834

DOI - 10.1155/2008/231845

Subject(s) - mathematics , ideal (ethics) , cone (formal languages) , closure (psychology) , convex cone , regular polygon , normed vector space , algebraic number , space (punctuation) , pure mathematics , vector space , dual cone and polar cone , combinatorics , discrete mathematics , convex set , mathematical analysis , convex optimization , geometry , algorithm , computer science , philosophy , epistemology , economics , market economy , operating system

Several relations between (proper) ideal points and (weakly, positive proper, general positive) efficient points are derived in real linear spaces. Moreover, some sufficient conditions for the existence of proper ideal points and positive proper efficient points are proved under certain assumptions

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research