Lexicographic Maximum Solution of Min-Product Fuzzy Relation Inequalities for Modeling the Optimal Pricing With Fixed Priority Grade in Supply Chain | Zendy

Xuegang Zhou | Zendy; Xingyi Zhong | Zendy; Haitao Lin | Zendy; Zejian Qin | Zendy; Xiaopeng Yang | Zendy

Open Access

Lexicographic Maximum Solution of Min-Product Fuzzy Relation Inequalities for Modeling the Optimal Pricing With Fixed Priority Grade in Supply Chain

Author(s) -

Xuegang Zhou,

Xingyi Zhong,

Haitao Lin,

Zejian Qin,

Xiaopeng Yang

Publication year - 2018

Publication title -

ieee access

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.587

H-Index - 127

ISSN - 2169-3536

DOI - 10.1109/access.2018.2878748

Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation

Fuzzy relation inequalities composed by the min-product operation are established to model the pricing relation in a supply chain system. Basic properties of the min-product fuzzy relation inequalities are presented first, based on which the complete solution set could be characterized and obtained. In fact, each solution of the corresponding fuzzy relation inequalities is exactly a feasible price scheduling. Considering the fixed priority grade of the suppliers, the concept of lexicographic maximum solution is introduced and investigated, as an optimal price scheduling that maximizes the benefits. A detailed algorithm is developed to search the unique lexicographic maximum solution with a numerical illustrative example.

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