Applying the Lexicographic Maximum Solution of Min-Product Fuzzy Relational Inequalities for Finding the Optimal Pricing with a Fixed Priority in a Supply Chain System
preprint
OA: closed
CC-BY-4.0
Abstract
Fuzzy relational inequalities composed by the min-product operation are established to model the optimal pricing with fixed priority in a single product supply chain system. The solution algorithm has been proposed for solving such an optimization problem and finding the optimal solution (is called lexicographic maximum solution). In this study, a novel approach is proposed to finding the optimal pricing with fixed priority in a single product supply chain system. This approach is based on new properties of solution set in a min-product fuzzy relational inequality. These new properties allow us directly determine the optimal value of variable without many duplicate checks in the solution procedure. A numerical example is provided to illustrate the procedure.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00
- unpaywall
- last seen: 2026-05-30T02:00:01.510937+00:00
License: CC-BY-4.0