Next Article in Journal
A Singular Tempered Sub-Diffusion Fractional Equation with Changing-Sign Perturbation
Next Article in Special Issue
Packing Spheres into a Minimum-Height Parabolic Container
Previous Article in Journal
Jordan-Type Inequalities and Stratification
Previous Article in Special Issue
An Efficient Penalty Method without a Line Search for Nonlinear Optimization
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Strict Vector Equilibrium Problems of Multi-Product Supply–Demand Networks with Capacity Constraints and Uncertain Demands

1
School of Preparatory Education, North Minzu University, Yinchuan 750021, China
2
School of Management, Hefei University of Technology, Hefei 230002, China
3
School of Mathematics and Information Science, North Minzu University, Yinchuan 750021, China
*
Author to whom correspondence should be addressed.
Axioms 2024, 13(4), 263; https://doi.org/10.3390/axioms13040263
Submission received: 6 March 2024 / Revised: 1 April 2024 / Accepted: 9 April 2024 / Published: 16 April 2024
(This article belongs to the Special Issue Numerical Analysis and Optimization)

Abstract

:
This paper considers a multi-product, multi-criteria supply–demand network equilibrium model with capacity constraints and uncertain demands. Strict network equilibrium principles are proposed both in the case of a single criterion and multi-criteria, respectively. Based on a single criterion, it proves that strict network equilibrium flows are equivalent to vector variational inequalities, and the existence of strict network equilibrium flows is derived by virtue of the Fan–Browder fixed point theorem. Based on multi-criteria, the scalarization of strict network equilibrium flows is given by using Gerstewitz’s function without any convexity assumptions. Meanwhile, the necessary and sufficient conditions of strict network equilibrium flows are derived in terms of vector variational inequalities. Finally, an example is given to illustrate the application of the derived theoretical results.

1. Introduction

The study of the supply–demand network equilibrium models has been the subject of great interest due to their theoretical challenges and practical application. The fundamental principle is Wardrop’s equilibrium principle [1], which states that users in transport networks choose one of the paths among all the paths joining the same origin–destination (OD) pair at minimum cost. After Wardrop, many scholars have proposed various network equilibrium models based on a single criterion. Dong et al. [2] considered a supply chain network equilibrium model with random demands. Meng et al. [3] proposed a note on supply chain network equilibrium models. Nagurney [4] presented a supply chain network equilibrium model and investigated the relationship between transportation and supply chain network equilibria. Nagurney et al. [5] developed an equilibrium model of a competitive supply chain network. Additionally, motivated by practical concerns, network equilibrium models based on multiple criteria cost functions have been studied; for example, Chen and Yen [6] were the first to propose a traffic network equilibrium model based on multiple criteria cost functions without capacity constraints, and present an equivalent relation between vector network equilibrium models and vector variational inequalities. Cheng and Wu [7] presented a multi-product supply–demand network equilibrium model with multiple criteria.
For a supply–demand network, it is well known that when the flows pass through two different paths which contain common arcs at the same time, the capacity constraints of the two paths may interact. So, the capacity constraints are important factors that affect the equilibrium states and the selection of the set of feasible network flows. Based on this cause, a substantial number of works have been devoted to studying the vector equilibrium principle [5,8,9,10,11,12,13,14] with capacity constraints of paths. In addition, considering that the data are uncertain in practice and are not known exactly, along with the change of network users’ demand preferences and the fluctuation of purchasing power, the demands of network flow should not be fixed, and the network equilibrium with uncertain demands have attracted much attention. Very recently, Cao et al. [15] focused on the traffic network equilibrium problem with uncertain demands, in which the uncertain set consisted of finite discrete scenarios. Subsequently, Wei et al. [16] assumed that the demands belonged to a closed interval and proposed (weak) vector equilibrium principles involving a single product. Proper efficiency is widely applied to solve vector optimization and vector equilibrium problems. It can help one to eliminate some abnormal efficient decisions and provide proper efficient decisions. Several classical proper efficiency measures, such as Benson efficiency [17], super efficiency [18], and Henig efficiency [19], have been applied to solve network equilibrium models. Cheng and Fu [20] introduced a kind of proper efficiency–strict efficiency, and it has been used to solve vector optimization models (for example, see Yu et al. [21]). On the other hand, variational inequality theory is an effective tool to solve equilibrium problems (for example, see Chen and Yen [6]).
In this paper, inspired by the work in [7,10,16,17], we consider strict vector equilibrium principles of a multi-product, multi-criteria supply–demand network with capacity constraints and uncertain demands, where the demands are assumed to belong to a closed interval and are irrelevant to the costs for all OD pairs. The main contribution is to derive the existence results of strict vector equilibrium flows of a multi-product supply–demand network with capacity constraints and uncertain demands by virtue of the Fan–Browder fixed point theorem and obtain the relations between the strict vector equilibrium flows and vector variational inequalities, with both a single criterion and multi-criteria cost functions, which, to the best of our knowledge have not been studied before.
The rest of this article is arranged as follows: in Section 2, some mathematical preliminaries are described. In Section 3, we propose a strict network equilibrium principle for a multi-product supply–demand network problem involving real-valued cost functions with capacity constraints and uncertain demands. The equivalence relation between the strict network equilibrium flow and the strictly efficient solution of variational inequalities is established. The existence of the strict network equilibrium flows is also derived by means of the Fan–Browder fixed point theorem. Section 4 proposes a strict network equilibrium principle for a multi-product supply–demand network problem with capacity constraints and uncertain demands involving vector-valued cost functions, and the similar equivalence relation of strict network equilibrium flows in terms of vector variational inequalities is deduced by using Gerstewitz’s scalarization function. Section 5 gives an illustrative example. Section 6 provides a brief summary of the paper.

2. Definition and Preliminaries

In this section, some notations are set and we recall the notions of efficient points of a nonempty set, and the variational inequality and strictly efficient points of a nonempty set. Throughout the paper, we suppose that the vectors are always row vectors unless otherwise stated. Let R n be the n-dimensional Euclidean space and R + n be its non-negative orthant. Let R n × n be the n × n matrix space and
R + n × n = { k = ( k 1 , , k n ) R n × n : k i = ( k i 1 , , k i n ) , k i j 0 , j = 1 , , n }
be its non-negative orthant, where ( k i 1 , , k i n ) denotes the transpose of the matrix ( k i 1 , , k i n ) . Given y , z R n × n , let y , z = y z represent the multiplication of matrix y and z. A pointed closed convex cone Γ R n induces the orderings in R n : for any x 1 , x 2 R n ,
x 1 x 2 iff x 2 x 1 Γ , x 1 < x 2 iff x 2 x 1 int Γ ,
where int Γ denotes the nonempty interior of Γ . For convenience of writing, let R n = X . Let Ξ X be a nonempty convex subset of the cone Γ and cl ( Ξ X ) be its closure. cone ( Ξ X ) = { σ x : σ R + 1 , x Ξ X } is the conic hull of the set Ξ X . If 0 cl ( Ξ X ) , Γ = cone ( Ξ X ) , then the set Ξ X is said to be a base of the cone Γ .
Let N be a nonempty subset of X; H : N R n is a mapping. The notion of efficient points of the set N is as follows.
Definition 1
(see [21]). A vector x ¯ N is said to be an efficient point of the set N if
( N x ¯ ) ( Γ { 0 } ) = .
Let EP(N) denote the set of the efficient points of the set N.
The variational inequality is to find a vector x ¯ N , such that
H ( x ¯ ) , x x ¯ 0 , x N .
The concept of strictly efficient points of the set N is as follows.
Definition 2
(see [21]). Suppose that Ξ X is a base of Γ. The vector x ¯ N is called a strictly efficient point of the set N with Ξ X if there is a neighborhood Θ X of 0, such that
cone ( N x ¯ + Γ ) ( Θ X Ξ X ) = .
Let SEP(N) denote the set of strictly efficient points of the set N.

3. Existence of Strict Vector Equilibrium Flows with Single Criterion

For a supply–demand network G = [ N , C , V , P , D ] , let N , C , P , and D denote the set of nodes, the set of arcs, the set of OD pairs, and the uncertain demand vectors, respectively. Let us suppose that there are m different kinds of products passing through the network and that a typical product is denoted by o. For each arc c C and product o, ϱ c o represents arc flow of product o between two different nodes. V = ( ϱ ¯ c o ) C denotes the capacity vector, where ϱ ¯ c o > 0 implies the capacity of arc c for the product o. The arc flow ϱ c o needs to satisfy the following capacity constraint:
0 ϱ c o ϱ ¯ c o .
Let us assume that there are s OD pairs in the set P . The available paths connecting OD pair p P form the set ω p , and let p P | ω p | = n , where n is a positive integer. For each acyclic path a ω p , we denote by ϱ a o 0 the path flow of the product o on path a. The relation between arc flows and path flows is as follows:
ϱ c o = p P a ω p δ c a ϱ a o ,
where
δ c a = 1 , i f c b e l o n g s t o p a t h a , 0 , o t h e r w i s e .
Let us suppose that μ a o and λ a o are the lower and upper capacity constraints on path a with product o, respectively, i.e.,
μ a o ϱ a o λ a o .
The matrix ϱ = ( ϱ a o ) m × n is called a network flow. Thus, each column vector ϱ a = ( ϱ a 1 , , ϱ a m ) of the matrix ϱ is the flow on path a, while the row vector ϱ o = ( ϱ 1 o , , ϱ n o ) is the network flow with product o.
We denote demand vectors of the network flow by D = ( d p o ( ε p o ) : p P , o = 1 , , m ) , where the component d p o ( ε p o ) denotes the uncertain demand for OD pair p and product o. Let us suppose that d p o ( ε p o ) belongs to a closed interval Δ p o , i.e., d p o ( ε p o ) Δ p o = [ d p o ε p o , d p o + ε p o ] , where d p o represents an appropriate fixed demand and ε p o 0 denotes a deviation. It is reasonable to assume that the values of d p o and ε p o that depend on p and o are different for each OD pair and product in practical supply–demand network problems. We would like to point out that the uncertain demand d p o ( ε p o ) that is irrelevant to the costs is significantly different from the one introduced in [12,22].
We say that the network flow ϱ satisfies the uncertain demands constraint if and only if
a ω p ϱ a o = d p o ( ε p o ) , p P , o = 1 , , m .
A network flow ϱ satisfying both the capacity constraints and the uncertain demands constraints is called a feasible flow. The set of all feasible flows is denoted by
Q = { ϱ : μ a o ϱ a o λ a o , 0 p P a ω p δ c a ϱ a o ϱ ¯ c o , c C , and
a ω p ϱ a o = d p o ( ε p o ) , p P , o = 1 , , m } .
Let Q . Clearly, Q is closed, convex, and compact.
For each product o, let h c o ( ϱ ) : R m × n R + be the cost function on arc c; the cost function on path a ω p is computed by
h a o ( ϱ ) = c a h c o ( ϱ ) .
The cost on the network is given as a form of matrix h ( ϱ ) = ( h a o ( ϱ ) ) m × n , where the ath column h a ( ϱ ) = ( h a 1 ( ϱ ) , , h a m ( ϱ ) ) represents the cost on path a; the oth row h o ( ϱ ) = ( h 1 o ( ϱ ) , , h n o ( ϱ ) ) represents the cost on the network with product o. In this paper, unless otherwise stated, we always assume that for any p P and a , b ω p ,
h b ( ϱ ) h a ( ϱ ) 0 , if b a ,
which has been also used in the literature [7].
Definition 3.
Supposing a flow ϱ Q ,
(i) 
 for an arc c C and product o = 1 , , m , if ϱ c o = ϱ ¯ c o , then c is called a saturated arc of product o and flow ϱ, or a nonsaturated arc of product o and flow ϱ.
(ii) 
for a path a p P ω p and product o = 1 , , m , if the path a contains a saturated arc c of product o and flow ϱ, then a is called a saturated path of product o and flow ϱ, otherwise, a nonsaturated path of product o and flow ϱ.
In the following content, we propose the concept of strict network equilibrium flow for a kind of multi-product supply–demand network involving real-valued cost functions with capacity constraints and uncertain demands, which has not been studied in the existing literature. In what follows, we always assume that Ξ is a base of R + m , Ξ ˜ is a base of R + m × m , Θ is a neighborhood of 0 in R m , and Θ ˜ is a neighborhood of 0 in R m × m .
Definition 4.
(Strict network equilibrium principle). A feasible network flow ϱ Q is a strict network equilibrium flow, if, for each p P , a , b ω p , o = 1 , , m , there is a neighborhood Θ of 0 in R m satisfying Θ Ξ int R + m , one has as an implication
cone ( h ω p ( ϱ ) + R + m h a ( ϱ ) ) ( cone ( Θ Ξ ) { 0 } ) = h b ( ϱ ) h a ( ϱ ) 0 }
ϱ b o = μ b o , b a , or ϱ a o = λ a o , or path a is a saturated path with product o and flow ϱ.
Now, let us review the concept of the strict efficiency of vector variational inequalities, which will be employed to derive the main conclusions.
Definition 5.
A flow ϱ Q is said to be a strictly efficient solution of the vector variational inequality if and only if there exist Ξ ˜ and Θ ˜ satisfying Θ ˜ Ξ ˜ int R + m × m ,
cone ( h ( ϱ ) , ( χ ϱ ) + R + m × m ) ( cone ( Θ ˜ Ξ ˜ ) { 0 } ) = , χ Q .
It is noteworthy that the vector ϱ Q is a strictly efficient solution of the following variational inequality:
cone ( h ( ϱ ) , ( χ ϱ ) + R + m × m ) ( cone ( Θ ˜ Ξ ˜ ) { 0 } ) = , χ Q ,
if the vector ϱ Q is a solution of the following variational inequality: find ϱ Q , satisfying
h ( ϱ ) , ( χ ϱ ) R + m × m { 0 } , χ Q ,
Next, we shall consider the relations between a strictly efficient solution of the vector variational inequality and the strict network equilibrium flow.
Theorem 1.
If the vector ϱ Q is a strict network equilibrium flow, then ϱ is a strictly efficient solution of the following variational inequality: find ϱ Q , satisfying
cone ( h ( ϱ ) , ( χ ϱ ) + R + m × m ) ( cone ( Θ ˜ Ξ ˜ ) { 0 } ) = , χ Q .
Proof. 
If the vector ϱ Q is a strict network equilibrium flow, for each p P , a , b ω p , o = 1 , , m , it has the following implication:
cone ( h ω p ( ϱ ) + R + m h a ( ϱ ) ) ( cone ( Θ Ξ ) { 0 } ) = h b ( ϱ ) h a ( ϱ ) 0 }
ϱ b o = μ b o , b a , or ϱ a o = λ a o , or path a is a saturated path of product o and flow ϱ .
We first show that
h ( ϱ ) , ( χ ϱ ) R + m × m , χ Q .
For any χ Q , it holds
h ( ϱ ) , ( χ ϱ ) = ( h 1 ( ϱ ) , , h n ( ϱ ) ) , ( χ 1 ϱ 1 , , χ n ϱ n ) = a ¯ = 1 n h a ¯ ( ϱ ) , ( χ a ¯ ϱ a ¯ ) = p = 1 s [ a ¯ ω p h a ¯ ( ϱ ) , ( χ a ¯ ϱ a ¯ ) ] .
Because h a ¯ ( ϱ ) , ( χ a ¯ ϱ a ¯ ) is an m × m matrix, the component is h a ¯ ρ ( ϱ ) ( χ a ¯ η ϱ a ¯ η ) , ρ , η = 1 , 2 , , m ; so, h ( ϱ ) , ( χ ϱ ) is also an m × m matrix, the component is p = 1 s [ a ¯ ω p h a ¯ ρ ( ϱ ) ( χ a ¯ η ϱ a ¯ η ) ] , ρ , η = 1 , 2 , , m . Let
p ( ϱ ) = { b ¯ ω p : h b ¯ ( ϱ ) SEP { h b ( ϱ ) : b ω p } } ω p .
Hence, for each b ¯ p ( ϱ ) ω p ,
cone ( h ω p ( ϱ ) + R + m h b ¯ ( ϱ ) ) ( cone ( Θ Ξ ) { 0 } ) = .
It follows from Definition 4 that for any b ω p , o = 1 , , m and b b ¯ , ϱ b o = μ b o , ϱ b ¯ o = λ b ¯ o , or path b ¯ is a saturated path of product o and flow ϱ . Because SEP { h b ( ϱ ) : b ω p } EP { h b ( ϱ ) : b ω p } , we obtain
h b ¯ ( ϱ ) EP { h b ( ϱ ) : b ω p } ,
that is,
h b ( ϱ ) h b ¯ ( ϱ ) R + m { 0 } , b ω p , p P   a n d   b b ¯ .
Due to h b ( ϱ ) h b ¯ ( ϱ ) 0 , one has
h b ( ϱ ) h b ¯ ( ϱ ) R + m , b ω p , p P   a n d   b b ¯ .
So there is an ρ ¯ = 1 , 2 , , m such that
h b ρ ¯ ( ϱ ) h b ¯ ρ ¯ ( ϱ ) > 0 .
Hence, one has
p = 1 s a ¯ ω p h a ¯ ρ ¯ ( ϱ ) ( χ a ¯ η ϱ a ¯ η ) = p = 1 s a ¯ ω p { b ¯ } h a ¯ ρ ¯ ( ϱ ) ( χ a ¯ η ϱ a ¯ η ) + h b ¯ ρ ¯ ( ϱ ) ( χ b ¯ η ϱ b ¯ η ) .
Because a ¯ ω p { b ¯ } , we have ϱ a ¯ η = μ a ¯ η , ϱ b ¯ η = λ b ¯ η for each η = 1 , 2 , , m ,
p = 1 s a ¯ ω p h a ¯ ρ ¯ ( ϱ ) ( χ a ¯ η ϱ a ¯ η ) = p = 1 s a ¯ ω p { b ¯ } h a ¯ ρ ¯ ( ϱ ) ( χ a ¯ η μ a ¯ η ) + h b ¯ ρ ¯ ( ϱ ) ( χ b ¯ η λ b ¯ η ) .
And, because a ¯ ω p { b ¯ } , it holds that h a ¯ ρ ¯ ( ϱ ) > h b ¯ ρ ¯ ( ϱ ) . Due to χ Q , there must exist η ¯ = 1 , 2 , , m satisfying χ a ¯ η ¯ μ a ¯ η ¯ > 0 . Hence, we obtain
p = 1 s a ¯ ω p { b ¯ } h a ¯ ρ ¯ ( ϱ ) ( χ a ¯ η ¯ μ a ¯ η ¯ ) + h b ¯ ρ ¯ ( ϱ ) ( χ b ¯ η ¯ λ b ¯ η ¯ ) > p = 1 s h b ¯ ρ ¯ ( ϱ ) a ¯ ω p χ a ¯ η ¯ a ¯ ω p { b ¯ } μ a ¯ η ¯ + λ b ¯ η ¯ = p = 1 s h b ¯ ρ ¯ ( ϱ ) a ¯ ω p χ a ¯ η ¯ a ¯ ω p { b ¯ } ϱ a ¯ η ¯ + ϱ b ¯ η ¯ = p = 1 s h b ¯ ρ ¯ ( ϱ ) a ¯ ω p χ a ¯ η ¯ a ¯ ω p ϱ a ¯ η ¯ .
Since χ Q and ϱ Q , we obtain that
a ¯ ω p χ a ¯ η ¯ = d p η ¯ ( ε p η ¯ ) , a ¯ ω p ϱ a ¯ η ¯ = d p η ¯ ( ε p η ¯ ) .
Therefore, there exist ρ ¯ = 1 , 2 , , m and η ¯ = 1 , 2 , , m , satisfying
p = 1 s a ¯ ω p h a ¯ ρ ¯ ( ϱ ) ( χ a ¯ η ϱ a ¯ η ) > p = 1 s h b ¯ ρ ¯ ( ϱ ) d p η ¯ ( ε p η ¯ ) d p η ¯ ( ε p η ¯ ) = 0 .
Thus, inequation (1) holds.
Next, let
cone ( h ( ϱ ) , ( χ ϱ ) + R + m × m ) ( cone ( Θ ˜ Ξ ˜ ) { 0 } ) , χ Q .
Therefore, there must be an k ¯ 0 satisfying
k ¯ cone ( h ( ϱ ) , ( χ ϱ ) + R + m × m ) ( cone ( Θ ˜ Ξ ˜ ) { 0 } ) , χ Q .
We set k ¯ = δ ˜ k ˜ , where k ˜ h ( ϱ ) , ( χ ϱ ) + R + m × m , δ ˜ > 0 because of k ¯ 0 . Hence, δ ˜ k ˜ cone ( Θ ˜ Ξ ˜ ) { 0 } . Thus there are σ ˜ > 0 and r ˜ Θ ˜ Ξ ˜ satisfying δ ˜ k ˜ = σ ˜ r ˜ . Therefore, there are χ ˜ Q and θ R + m × m satisfying k ˜ = σ ˜ r ˜ δ ˜ = h ( ϱ ) , ( χ ˜ ϱ ) + θ , which is equivalent to
h ( ϱ ) , ( χ ˜ ϱ ) = σ ˜ r ˜ δ ˜ θ R + m × m ,
which contradicts (1). Hence, it holds that
cone ( h ( ϱ ) , ( χ ϱ ) + R + m × m ) ( cone ( Θ ˜ Ξ ˜ ) { 0 } ) = , χ Q .
Theorem 2.
The vector ϱ Q is a strict network equilibrium flow if ϱ is a solution of the following vector variational inequality: find ϱ Q satisfying
h ( ϱ ) , ( χ ϱ ) R + m × m { 0 } , χ Q .
Proof. 
Assume that ϱ Q satisfies inequality (2). For each p P and a , b ω p , b a , o = 1 , , m , if
cone ( h ω p ( ϱ ) + R + m h a ( ϱ ) ) ( cone ( Θ Ξ ) { 0 } ) = ,
h b ( ϱ ) h a ( ϱ ) 0 , and a is a nonsaturated path of product o and flow ϱ , we will deduce ϱ b o = μ b o or ϱ a o = λ a o . Let a = { c C : arc c belongs to path a } . We assume that the conclusion is false, i.e., ϱ b μ b or ϱ a λ a . Taking o = min min c a ( ϱ ¯ c o ϱ c o ) , ϱ b o μ b o , λ a o ϱ a o > 0 and = ( 1 , , o , , m ) , let χ be
χ a ¯ = ϱ a ¯ , i f a ¯ b o r a , ϱ b , i f a ¯ = b , ϱ a + , i f a ¯ = a .
Because ϱ Q , i.e., p P , o = 1 , 2 , , m , a ¯ ω p ϱ a ¯ o = d p o ( ε p o ) , one has
a ¯ ω p χ a ¯ o = a ¯ ω p { b , a } χ a ¯ o + χ b o + χ a o = a ¯ ω p { b , a } ϱ a ¯ o + ϱ b o o + ϱ a o + o = a ¯ ω p ϱ a ¯ o = d p o ( ε p o ) .
So, χ Q . Now,
h ( ϱ ) , ( χ ϱ ) = a ¯ = 1 n h a ¯ ( ϱ ) , ( χ a ¯ ϱ a ¯ ) = a ¯ b , a h a ¯ ( ϱ ) , ( ϱ a ¯ ϱ a ¯ ) + h b ( ϱ ) , ( ϱ b ϱ b ) + h a ( ϱ ) , ( ϱ a + ϱ a ) = , ( h a ( ϱ ) h b ( ϱ ) ) R + m × m { 0 } .
We know that h ( ϱ ) , ( χ ϱ ) is an m × m matrix; the component is ( h a ρ ( ϱ ) h b ρ ( ϱ ) ) ϱ b η , ρ , η = 1 , 2 , , m . If , ( h a ( ϱ ) h b ( ϱ ) ) 0 , then for each ρ , η = 1 , 2 , , m ,
( h a ρ ( ϱ ) h b ρ ( ϱ ) ) η 0 ,
with strict inequality holding for some ρ , η = 1 , 2 , , m . By η 0 , one has
h a ρ ( ϱ ) h b ρ ( ϱ ) 0 ,
that is,
h a ( ϱ ) h b ( ϱ ) R + m { 0 } ,
which is equivalent to
h b ( ϱ ) h a ( ϱ ) R + m { 0 } .
Noticing that
R + m { 0 } ( cone ( Θ Ξ ) { 0 } ) ,
and
h b ( ϱ ) h a ( ϱ ) cone ( h ω i ( ϱ ) + R + m h a ( ϱ ) ) ,
we get
h b ( ϱ ) h a ( ϱ ) cone ( Θ Ξ ) { 0 } .
By Equations (3) and (4) and h b ( ϱ ) h a ( ϱ ) 0 , we obtain
h b ( ϱ ) h a ( ϱ ) cone ( h ω p ( ϱ ) + R + m h a ( ϱ ) ) ( cone ( Θ Ξ ) { 0 } ) ,
a contradiction. Thus, the conclusion ϱ b = μ b or ϱ a = λ a holds. □
We now propose the existence of strict network equilibrium flow by virtue of an equivalent form of Fan–Browder’s fixed point theorem ([23,24]), which is formulated in the following lemma.
Lemma 1
(see [10]). Let ℧ denote a Hausdorff topological vector space; K is a nonempty compact convex subset of ℧. Assume that the set-valued map g : K 2 K { } has the following conditions:
(i) 
  for any ς K , g ( ς ) is a convex set;
(ii) 
 for any ς K , ς g ( ς ) ;
(iii) 
for any ι K , g 1 ( ι ) = { ς K : ι g ( ς ) } is an open set in K .
Then, there exists ς ˜ K satisfying g ( ς ˜ ) = .
Theorem 3.
Consider a multi-product supply–demand network equilibrium problem with capacity constraints and uncertain demands G = [ N , C , V , P , D ] . Let ϱ ¯ int R + m × m be given. If, for any χ Q , the function ϱ ¯ , h ( ϱ ) , ( χ ϱ ) is continuous on Q. Then, the network G exists as a strict vector equilibrium flow.
Proof. 
Consider the following variational inequality: find ϱ Q satisfying
ϱ ¯ , h ( ϱ ) , ( χ ϱ ) R + m × m , χ Q .
Firstly, we will show that the variational inequality (5) admits a solution. We define a set-valued map Ω : Q 2 Q { } as Ω ( ϱ ) = χ Q : ϱ ¯ , h ( ϱ ) , ( χ ϱ ) int ( R + m × m ) . Then, one has the following results:
(i)
   Ω ( ϱ ) is convex;
(ii)
 for each ϱ Q , ϱ Ω ( ϱ ) ;
(iii)
if χ Ω ( ϱ ) , one has ϱ ¯ , h ( ϱ ) , ( χ ϱ ) int ( R + m × m ) , which implies that there exists a ξ R + m × m such that ϱ ¯ , h ( ϱ ) , ( χ ϱ ) + ξ int ( R + m × m ) . Since ϱ ¯ , h ( ϱ ) , ( χ ϱ ) is continuous on Q by hypothesis, one can reach that there exists an open neighborhood Θ ( ϱ ) of ϱ such that
ϱ ¯ , h ( ϱ ^ ) , ( χ ϱ ^ ) < ϱ ¯ , h ( ϱ ) , ( χ ϱ ) + ξ int ( R + m × m ) , ϱ ^ Θ ( ϱ )
which implies that
Θ ( ϱ ) Ω 1 ( χ ) = { ϱ Q : ϱ ¯ , h ( ϱ ) , ( χ ϱ ) int ( R + m × m ) ,
i.e., Ω 1 ( χ ) is open.
By Lemma 1, we obtain that the variational inequality (5) has a solution ϱ ˜ Q . Next, we prove that ϱ ˜ is a strict network equilibrium flow. According to Theorem 2, we needs to prove that ϱ ˜ is a solution to the following vector variational inequality:
h ( ϱ ) , ( χ ϱ ) R + m × m { 0 } , χ Q .
Let us suppose to the contrary that ϱ ˜ is not a solution; then, there is χ ˜ Q , such that h ( ϱ ˜ ) , ( χ ˜ ϱ ˜ ) R + m × m { 0 } . For ϱ ¯ int R + m × m , we obtain
ϱ ¯ , h ( ϱ ˜ ) , ( χ ˜ ϱ ˜ ) R + m × m { 0 } ,
a contradiction. □

4. Strict Vector Equilibrium Flows with Multi-Criteria via Scalarization

It seems unreasonable for network users to choose a path based on a single criterion. In fact, the network users need to consider time, tariffs, fuel, and other relevant cost factors simultaneously. That is, the cost function is a multi-criteria one. In the following sections, the equilibrium model of the multi-product supply–demand network G = [ N , C , V , P , D ] based on multi-criteria cost functions is investigated. Let us suppose that the cost on arc c C with product o is: H c o ( ϱ ) : R m × n R + e , where e > 1 is a positive integer. The cost on the path a ω p , p P with product o is computed by
H a o ( ϱ ) = c a H c o ( ϱ ) .
Hence, H a o ( ϱ ) : R m × n R + e and we set it in the form
H a o ( ϱ ) = u a o ( ϱ ) ϑ 0 , a ω p , p P and o = 1 , , m ,
where u a o ( ϱ ) : R m × n R + , ϑ 0 int R + e .
The cost on the network concerning product o is denoted by H o ( ϱ ) = ( H 1 o ( ϱ ) , , H n o ( ϱ ) ) , the cost on path a is denoted by H a ( ϱ ) = ( H a 1 ( ϱ ) , , H a o ( ϱ ) , , H a m ( ϱ ) ) , and the cost of the network is denoted by H ( ϱ ) = ( H a ( ϱ ) : a ω p , p P ) .
In the following, Y = R e is a e-dimensional Euclidean space with the ordering cone R + e , where e > 1 is a positive integer. Ξ ¯ always denotes a base of R + m × e , and Θ ¯ denotes a neighborhood of 0 in R m × e . Firstly, we introduce the concept of strict network equilibrium flow for a multi-product, multi-criteria supply–demand network with capacity constraints and uncertain demands.
Definition 6.
The feasible network flow ϱ Q is called a strict network equilibrium flow for a multi-product, multi-criteria supply–demand network with capacity constraints and uncertain demands, if, for any p P , a , b ω p , o = 1 , , m , there is a neighborhood Θ ¯ of 0 in R m × e , such that Θ ¯ Ξ ¯ i n t R + m × e , one has the implication
cone ( H ω p ( ϱ ) + R + m × e H a ( ϱ ) ) ( cone ( Θ ¯ Ξ ¯ ) { 0 } ) = H b ( ϱ ) H a ( ϱ ) 0 }
ϱ b o = μ b o , b a , or ϱ a o = λ a o , or path a is a saturated path of product o and flow ϱ.
As we all know, a viable approach to solve vector problems is to convert them into scalar problems. In this paper, we use the following nonlinear scalarization function (i.e., Gerstewitz’s function) to scalarize the vector-valued strict network equilibrium flows without any assumptions about convexity.
Definition 7
(see [25]). For a given v int R + e , let ψ v : R e R be defined by
ψ v ( x ) = min { δ R : x δ v R + e } , x R e .
Lemma 2 and Lemma 3 provide some properties of the above function that we will use in the proof of Theorem 4.
Lemma 2
(see [26]). Let v int R + e . For each σ R and x R e , one has
(i) 
   ψ v ( x ) < σ x σ v int R + e ;
(ii) 
  ψ v ( x ) σ x σ v R + e ;
(iii) 
ψ v ( x ) σ x σ v int R + e ;
(iv) 
ψ v ( x ) > σ x σ v R + e ;
(v) 
  ψ v ( x ) = σ x σ v R + e , where R + e is the topological boundary of R + e .
Lemma 3
(see [7]). Given v int R + e , x R e , and σ R , one has
ψ v ( x ) ψ v ( x ) , ψ v ( σ x ) ψ v ( σ x ) ,
and
ψ v ( σ v ) = ψ v ( σ v ) = σ .
We denote
ψ v H a o ( ϱ ) = ψ v ( H a o ( ϱ ) ) = min { δ R : H a o ( ϱ ) δ v R + e } ,
for any ϱ Q , a ω p , p P , o = 1 , , m ;
ψ v H a ( ϱ ) = ( ψ v H a o ( ϱ ) : o = 1 , , m ) R m ;
and
ψ v ( ϱ ) = ψ v H ( ϱ ) = ( ψ v H a ( ϱ ) : a ω p , p P ) R m × n .
Definition 8.
The feasible network flow ϱ Q is called in ψ v -strict vector equilibrium for a multi-product supply–demand network involving vector-valued cost functions, if, for any p P , a , b ω p , o = 1 , , m , there exist v int R + e and a neighborhood Θ of 0 in R m satisfying Θ Ξ int R + m , one has the implication
cone ( ψ v H ω p ( ϱ ) + R + m ψ v H a ( ϱ ) ) ( cone ( Θ Ξ ) { 0 } ) = ψ v H b ( ϱ ) ψ v H a ( ϱ ) 0 }
ϱ b o = μ b o , b a , or ϱ a o = λ a o , or path a is a saturated path of product o and flow ϱ.
Now, we will scalarize strict vector equilibrium problems for a multi-product supply–demand network involving vector-valued cost functions.
Theorem 4.
Let us suppose that H a o ( ϱ ) is defined as in (6) for each a ω p , p P , and o = 1 , , m . The feasible network flow ϱ Q is a strict network equilibrium flow for a multi-product, multi-criteria supply–demand network with capacity constraints and uncertain demands if and only if ϱ is in ψ ϑ 0 -strict vector equilibrium.
Proof. 
Necessity: suppose that ϱ Q is a strict network equilibrium flow for a multi-product, multi-criteria supply–demand network with capacity constraints and uncertain demands. For any p P , a , b ω p and o = 1 , , m , it is necessary to verify the following implication:
cone ( ψ ϑ 0 H ω p ( ϱ ) + R + m ψ ϑ 0 H a ( ϱ ) ) ( cone ( Θ Ξ ) { 0 } ) = ψ ϑ 0 H b ( ϱ ) ψ ϑ 0 H a ( ϱ ) 0 }
ϱ b o = μ b o , b a , or ϱ a o = λ a o , or path a is a saturated path of product o and flow ϱ .
Firstly, it holds that
{ cone ( ψ ϑ 0 H ω p ( ϱ ) + R + m ψ ϑ 0 H a ( ϱ ) ) ( cone ( Θ Ξ ) { 0 } ) = ψ ϑ 0 H b ( ϱ ) ψ ϑ 0 H a ( ϱ ) 0
implies
{ cone ( H ω p ( ϱ ) + R + m × e H a ( ϱ ) ) ( cone ( Θ ¯ Ξ ¯ ) { 0 } ) = H b ( ϱ ) H a ( ϱ ) 0 .
Indeed, from ψ ϑ 0 H b ( ϱ ) ψ ϑ 0 H a ( ϱ ) 0 , we have
H b ( ϱ ) H a ( ϱ ) 0 , a , b ω p , b a .
From (6), one has H ω p ( ϱ ) = u ω p ( ϱ ) ϑ 0 , where u ω p ( ϱ ) = u b ( ϱ ) : b ω p , u b ( ϱ ) = ( u b 1 ( ϱ ) , , u b o ( ϱ ) , , u b m ( ϱ ) ) . By Lemma 3, it holds that
ψ ϑ 0 H ω p ( ϱ ) = { ψ ϑ 0 H b ( ϱ ) : b ω p } = { ( ψ ϑ 0 H b 1 ( ϱ ) , ψ ϑ 0 H b 2 ( ϱ ) , , ψ ϑ 0 H b m ( ϱ ) ) : b ω p } = { ( u b 1 ( ϱ ) , , u b m ( ϱ ) ) : b ω p } = u ω p ( ϱ ) .
Therefore, cone ( ψ ϑ 0 H ω p ( ϱ ) + R + m ψ ϑ 0 H a ( ϱ ) ) ( cone ( Θ Ξ ) { 0 } ) = turns into
cone ( u ω p ( ϱ ) + R + m u a ( ϱ ) ) ( cone ( Θ Ξ ) { 0 } ) = .
That is, u a ( ϱ ) SEP { u b ( ϱ ) : b ω p } . Due to SEP { u b ( ϱ ) : b ω p } EP { u b ( ϱ ) : b ω p } , so u a ( ϱ ) EP { u b ( ϱ ) : b ω p } , that is,
u b ( ϱ ) u a ( ϱ ) R + m { 0 } , b ω p .
Let us suppose that
cone ( H ω p ( ϱ ) + R + m × e H a ( ϱ ) ) ( cone ( Θ ¯ Ξ ¯ ) { 0 } ) ,
there is a k ¯ 0 satisfying k ¯ cone ( H ω p ( ϱ ) + R + m × e H a ( ϱ ) ) ( cone ( Θ ¯ Ξ ¯ ) { 0 } ) . We set k ¯ = δ ˜ k ˜ , where k ˜ H ω p ( ϱ ) + R + m × e H a ( ϱ ) , δ ˜ > 0 . Because δ ˜ k ˜ cone ( Θ ¯ Ξ ¯ ) { 0 } , there exist σ ˜ > 0 and r ˜ Θ ¯ Ξ ¯ satisfying δ ˜ k ˜ = σ ˜ r ˜ . So k ˜ = σ ˜ r ˜ δ ˜ H ω i ( ϱ ) + R + m × e H a ( ϱ ) ( Θ ¯ Ξ ¯ ) , k ˜ 0 . Hence, there are b ˜ ω p , θ ˜ R + m × e satisfying
k ˜ = H b ˜ ( ϱ ) + θ ˜ H a ( ϱ ) ,
equivalently,
H b ˜ ( ϱ ) H a ( ϱ ) = k ˜ θ ˜ R + m × e .
i.e.,
H b ˜ o ( ϱ ) H a o ( ϱ ) R + e , o = 1 , , m .
It follows from Lemma 2 that
ψ ϑ 0 ( H b ˜ o ( ϱ ) H a o ( ϱ ) ) 0 .
By (6) and Lemma 3, one has
u b ˜ o ( ϱ ) u a o ( ϱ ) 0 , o = 1 , , m ,
i.e.,
u b ˜ ( ϱ ) u a ( ϱ ) R + m .
If u b ˜ ( ϱ ) u a ( ϱ ) = 0 , H b ˜ ( ϱ ) H a ( ϱ ) = 0 , so k ˜ = θ ˜ , which contradicts k ˜ Θ ¯ Ξ ¯ and θ ˜ R + m × e . Hence,
u b ˜ ( ϱ ) u a ( ϱ ) R + m { 0 } ,
which leads to a contradiction with (7). Therefore, one has the implication:
{ cone ( ψ ϑ 0 H ω p ( ϱ ) + R + m ψ ϑ 0 H a ( ϱ ) ) ( cone ( Θ Ξ ) { 0 } ) = ψ ϑ 0 H b ( ϱ ) ψ ϑ 0 H a ( ϱ ) 0
{ cone ( H ω p ( ϱ ) + R + m × e H a ( ϱ ) ) ( cone ( Θ ¯ Ξ ¯ ) { 0 } ) = H b ( ϱ ) H a ( ϱ ) 0 .
Since ϱ Q is a strict network equilibrium flow, for any p P , a , b ω p , o = 1 , , m , one has
cone ( H ω p ( ϱ ) + R + m × e H a ( ϱ ) ) ( cone ( Θ ¯ Ξ ¯ ) { 0 } ) = H b ( ϱ ) H a ( ϱ ) 0 }
ϱ b o = μ b o , b a , or ϱ a o = λ a o , or path a is a saturated path of product o and flow ϱ . Hence, we obtain that
cone ( ψ ϑ 0 H ω i ( ϱ ) + R + m ψ ϑ 0 H a ( ϱ ) ) ( cone ( Θ Ξ ) { 0 } ) = ψ ϑ 0 H b ( ϱ ) ψ ϑ 0 H a ( ϱ ) 0 }
ϱ b o = μ b o , b a , or ϱ a o = λ a o , or path a is a saturated path of product o and flow ϱ , for any p P , a , b ω p and o = 1 , , m .
Sufficiency: assume that ϱ Q is in ψ ϑ 0 -strict vector equilibrium for a multi-product supply–demand network involving vector-valued cost functions. We first verify the implication
{ cone ( H ω p ( ϱ ) + R + m × e H a ( ϱ ) ) ( cone ( Θ ¯ Ξ ¯ ) { 0 } ) = H b ( ϱ ) H a ( ϱ ) 0
{ cone ( ψ ϑ 0 H ω p ( ϱ ) + R + m ψ ϑ 0 H a ( ϱ ) ) ( cone ( Θ Ξ ) { 0 } ) = ψ ϑ 0 H b ( ϱ ) ψ ϑ 0 H a ( ϱ ) 0 .
If
cone ( ψ ϑ 0 H ω p ( ϱ ) + R + m ψ ϑ 0 H a ( ϱ ) ) ( cone ( Θ Ξ ) { 0 } ) .
The following is similar to the proof of necessity. There is a r ˜ ( ψ ϑ 0 H ω p ( ϱ ) + R + m ψ ϑ 0 H a ( ϱ ) ) ( Θ Ξ ) satisfying r ˜ 0 . Therefore, there are b ˜ ω p and θ ^ R + m satisfying
r ˜ = ψ ϑ 0 H b ˜ ( ϱ ) + θ ^ ψ ϑ 0 H a ( ϱ ) .
i.e.,
ψ ϑ 0 H b ˜ ( ϱ ) ψ ϑ 0 H a ( ϱ ) = r ˜ θ ^ R + m .
Together (6) with Lemma 3, one has
u b ˜ ( ϱ ) u a ( ϱ ) R + m .
Hence, it holds that
H b ˜ ( ϱ ) H a ( ϱ ) R + m × e .
If H b ˜ ( ϱ ) H a ( ϱ ) = 0 , r ˜ = θ ^ , which leads to a contradiction with r ˜ Θ Ξ and θ ^ R + m . Therefore,
H b ˜ ( ϱ ) H a ( ϱ ) R + m × e { 0 } .
Because cone ( H ω p ( ϱ ) + R + m × e H a ( ϱ ) ) ( cone ( Θ ¯ Ξ ¯ ) { 0 } ) = , then H a ( ϱ ) SEP { H b ( ϱ ) : b ω p } . Therefore, H a ( ϱ ) EP { H b ( ϱ ) : b ω p } , i.e.,
H b ( ϱ ) H a ( ϱ ) R + m × e { 0 } , b ω p ,
which leads to a contradiction with (8). Hence, it holds that
cone ( ψ ϑ 0 H ω p ( ϱ ) + R + m ψ ϑ 0 H a ( ϱ ) ) ( cone ( Θ Ξ ) { 0 } ) = .
Additionally, due to H b ( ϱ ) H a ( ϱ ) 0 , one has ψ ϑ 0 H b ( ϱ ) ψ ϑ 0 H a ( ϱ ) 0 . It follows from Definition 8 that ϱ b o = μ b o , b a , or ϱ a o = λ a o , or path a is a saturated path of product o and flow ϱ , for any p P , a , b ω p and o = 1 , , m . Therefore, ϱ Q is a strict network equilibrium flow for a multi-product, multi-criteria supply–demand network with capacity constraints and uncertain demands. This completes the proof. □
It should be noted that the relations among strict network equilibrium flows involving real-valued cost functions, ψ ϑ 0 -strict vector equilibrium flows, and vector variational inequalities have been investigated in Theorems 1, 2, and 4. Then, strict network equilibrium flows for a multi-product supply–demand network involving vector-valued cost functions can be replaced by the following corresponding vector variational inequality: find ϱ Q satisfying
ψ ϑ 0 ( ϱ ) , ( χ ϱ ) R + m × m { 0 } , χ Q .
Additionally, it was shown in [7] (see Theorem 3.2 and Theorem 3.3) that the variational inequality (9) is equivalent to the following variational inequality: find ϱ Q satisfying
H ( ϱ ) , ( χ ϱ ) ( R + e ) m × m { 0 } , χ Q .
These approaches allow us to obtain strict network equilibrium flows for a multi-product supply–demand network involving vector-valued cost functions.

5. An Illustrative Example

In this section, an example is provided to demonstrate the application of the obtained theoretical results. The example has the network topology depicted in Figure 1. Table 1 summarizes the constituent paths of each OD pair.
The network consists of four nodes: N = { N 1 , N 2 , N 3 , N 4 } and five arcs: C = { c 1 , c 2 , c 3 , c 4 , c 5 } . We assume that V = { ϱ ¯ c 1 1 , ϱ ¯ c 2 1 , ϱ ¯ c 3 1 , ϱ ¯ c 4 1 , ϱ ¯ c 5 1 } = { 5 , 4 , 3 , 6 , 4 } , P = { { N 1 , N 4 } , { N 3 , N 4 } } , m = 1 , e = 2 , and D = { d 1 1 ( ε 1 1 ) , d 2 1 ( ε 2 1 ) } , where d 1 1 = 5 , d 2 1 = 5 , ε 1 1 = 5 2 , ε 2 1 = 3 2 , then d 1 1 ( ε 1 1 ) [ 5 2 , 15 2 ] , d 2 1 ( ε 2 1 ) [ 7 2 , 13 2 ] . Let ( μ 1 1 , μ 2 1 , μ 3 1 , μ 4 1 ) = ( 2 , 3 2 , 1 2 , 1 ) and ( λ 1 1 , λ 2 1 , λ 3 1 , λ 4 1 ) = ( 5 , 4 , 3 , 6 ) . The costs on each arc are chosen as follows:
H c 1 1 ( ϱ 1 1 ) = ( ϱ 1 1 , ϱ 1 1 ) , H c 2 1 ( ϱ 2 1 ) = ( 4 ϱ 2 1 , 5 ϱ 2 1 ) , H c 3 1 ( ϱ 3 1 ) = ( 2 ϱ 3 1 , 3 ϱ 3 1 ) , H c 4 1 ( ϱ 4 1 ) = ( 5 ϱ 4 1 , 6 ϱ 4 1 ) , H c 5 1 ( ϱ 1 1 ) = ( ϱ 1 1 , 2 ϱ 1 1 ) , H c 5 1 ( ϱ 3 1 ) = ( ϱ 3 1 , 2 ϱ 3 1 ) .
By a direct calculation, we derive the costs on four different paths:
H 1 1 ( ϱ 1 1 ) = H a 1 1 ( ϱ 1 1 ) + H a 5 1 ( ϱ 1 1 ) = ( 2 ϱ 1 1 , 3 ϱ 1 1 ) , H 2 1 ( ϱ 2 1 ) = H a 2 1 ( ϱ 2 1 ) = ( 4 ϱ 2 1 , 5 ϱ 2 1 ) , H 3 1 ( ϱ 3 1 ) = H a 3 1 ( ϱ 3 1 ) + H a 5 1 ( ϱ 3 1 ) = ( 3 ϱ 3 1 , 5 ϱ 3 1 ) , H 4 1 ( ϱ 4 1 ) = H a 4 1 ( ϱ 4 1 ) = ( 5 ϱ 4 1 , 6 ϱ 4 1 ) .
Setting ϱ = ( ϱ 1 1 , ϱ 2 1 , ϱ 3 1 , ϱ 4 1 ) = ( 3 , 2 , 1 , 4 ) . Obviously, ϱ Q is a feasible network flow. Thus,
H 1 1 ( ϱ 1 1 ) = ( 6 , 9 ) , H 2 1 ( ϱ 2 1 ) = ( 8 , 10 ) , H 3 1 ( ϱ 3 1 ) = ( 3 , 5 ) , H 4 1 ( ϱ 4 1 ) = ( 20 , 24 ) .
Now, we verify that the feasible flow ϱ is a strict vector equilibrium flow. For OD pairs { N 1 , N 4 } , { N 3 , N 4 } , we choose Θ ¯ = ( 0 , 1 ) and Ξ ¯ = ( 1 , 1 ) ; it holds that
{ cone ( H 2 1 ( ϱ 2 1 ) + R + 2 H 1 1 ( ϱ 1 1 ) ) ( cone ( Θ ¯ Ξ ¯ ) { 0 } ) = H 2 ( ϱ ) H 1 ( ϱ ) 0
and
{ cone ( H 4 1 ( ϱ 4 1 ) + R + 2 H 3 1 ( ϱ 3 1 ) ) ( cone ( Θ ¯ Ξ ¯ ) { 0 } ) = H 4 ( ϱ ) H 3 ( ϱ ) 0
Since the arc flow ϱ c 5 1 is
ϱ c 5 1 = i I k ω i δ c k ϱ k j = ϱ 1 1 + ϱ 3 1 = 4 = ϱ ¯ c 5 1 ,
it follows from Definition 3 that arc c 5 is a saturated arc of flow ϱ , paths 3 and 5 are saturated paths of flow ϱ . Hence, by Definition 6, we obtain that ϱ is a strict vector equilibrium flow.
Next, we show that ϱ = ( ϱ 1 1 , ϱ 2 1 , ϱ 3 1 , ϱ 4 1 ) = ( 3 , 2 , 1 , 4 ) is a solution of the following variational inequality:
H ( ϱ ) , ( χ ϱ ) R + 2 { 0 } , χ Q .
We take χ = ( χ 1 1 , χ 2 1 , χ 3 1 , χ 4 1 ) = ( 3 , 3 , 1 , 4 ) ; it is obvious that χ Q . Direct computation shows that
H ( ϱ ) , ( χ ϱ ) = ( H 1 1 ( ϱ 1 1 ) , H 2 1 ( ϱ 2 1 ) , H 3 1 ( ϱ 3 1 ) , H 4 1 ( ϱ 4 1 ) ) , ( χ 1 1 ϱ 1 1 , χ 2 1 ϱ 2 1 , χ 3 1 ϱ 3 1 , χ 4 1 ϱ 4 1 ) = 2 ϱ 1 1 4 ϱ 2 1 3 ϱ 3 1 5 ϱ 4 1 3 ϱ 1 1 5 ϱ 2 1 5 ϱ 3 1 6 ϱ 4 1 , 3 ϱ 1 1 , 3 ϱ 2 1 , 1 ϱ 3 1 , 4 ϱ 4 1 = 2 ϱ 1 1 ( 3 ϱ 1 1 ) + 4 ϱ 2 1 ( 3 ϱ 2 1 ) + 3 ϱ 3 1 ( 1 ϱ 3 1 ) + 5 ϱ 4 1 ( 4 ϱ 4 1 ) 3 ϱ 1 1 ( 3 ϱ 1 1 ) + 5 ϱ 2 1 ( 3 ϱ 2 1 ) + 5 ϱ 3 1 ( 1 ϱ 3 1 ) + 6 ϱ 4 1 ( 4 ϱ 4 1 ) = 8 , 10 R + 2 { 0 } .
Therefore, the strict vector equilibrium flow ϱ = ( 3 , 2 , 1 , 4 ) is a solution of variational inequality (10).

6. Conclusions

This paper considered the strict network equilibrium flows for a multi-product supply–demand network with capacity constraints and uncertain demands, where the uncertain demands were assumed to be in a closed interval. The main contribution is theoretical in nature, in that we derived the existence results of strict network equilibrium flows by virtue of the Fan–Browder fixed point theorem based on a single criterion cost function and showed that such a strict network equilibrium flow for a multi-product supply–demand network with capacity constraints and uncertain demands is equivalent to a vector variational inequality when considering both real value and vector value cost function, and we developed a scalarization method for strict vector equilibrium flows based on vector-valued cost functions by using Gerstewitz’s function. The results obtained in this paper provide a viable approach to solving the multi-product, multi-criteria supply–demand network equilibrium model with capacity constraints and uncertain demands.
In this paper, we presented an analytical framework based on the concept of network equilibrium to attain optimal performance for a multi-product supply–demand network with capacity constraints and uncertain demands. In future research, designing concrete simulation experiments and developing substantial areas of applications of the theory presented in our paper should be considered as a potential research project.

Author Contributions

Conceptualization, R.L. and G.Y.; methodology, R.L. and G.Y.; writing—original draft preparation, R.L.; writing—review and editing, R.L. and G.Y. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by the National Natural Science Foundation of China (No.12361062;No.62366001) and the Natural Science Foundation of the Ningxia Province of China (No.2023AAC02053).

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Wardrop, J.G. Some theoretical aspects of road traffic research. Proc. Inst. Civ. Eng. 1952, 1, 325–378. [Google Scholar] [CrossRef]
  2. Dong, J.; Zhang, D.; Nagurney, A. A supply chain network equilibrium model with random demands. Eur. J. Oper. Res. 2004, 156, 194–212. [Google Scholar] [CrossRef]
  3. Meng, Q.; Huang, Y.K.; Chen, R.L. A note on supply chain network equilibrium models. Transport. Res. E 2008, 184, 13–23. [Google Scholar] [CrossRef]
  4. Nagurney, A. On the relationship between supply chain and transportation network equilibria: A supernetwork equivalence with computations. Transport. Res. E 2006, 42, 293–316. [Google Scholar] [CrossRef]
  5. Nagurney, A.; Dong, J.; Zhang, D. A supply chain network equilibrium model. Transport. Res. E 2002, 38, 281–303. [Google Scholar] [CrossRef]
  6. Chen, G.Y.; Yen, N.D. On the Variational Inequality Model for Network Equilibrium; Internal Report 196; Department of Mathematics, University of Pisa: Pisa, Italy, 1993; pp. 724–735. [Google Scholar]
  7. Cheng, T.C.E.; Wu, Y.N. A multi-product, multi-criterion supply-demand network equilibrium model. Oper. Res. 2006, 54, 544–554. [Google Scholar] [CrossRef]
  8. Khanh, P.O.; Luu, L.M. On the existence of solutions to vector quasivariational inequalities and quasicomplementarity problems with applications to traffic network equilibria. J. Optimiz. Theory Appl. 2004, 123, 533–548. [Google Scholar] [CrossRef]
  9. Khanh, P.O.; Luu, L.M. Some existence results for quasi-variational inequalities involving multifunctions and applications to traffic equilibrium problems. J. Global Optim. 2005, 32, 551–568. [Google Scholar] [CrossRef]
  10. Lin, Z. The study of traffic equilibrium problems with capacity constraints of arcs. Nonlinear Anal. Real World Appl. 2010, 11, 2280–2284. [Google Scholar] [CrossRef]
  11. Lin, Z. On existence of vector equilibrium flows with capacity constraints of arcs. Nonlinear Anal. Theory Methods Appl. 2010, 72, 2076–2079. [Google Scholar] [CrossRef]
  12. Li, S.J.; Teo, K.L.; Yang, X.Q. Vector equilibrium problems with elastic demands and capacity constraints. J. Global Optim. 2007, 37, 647–660. [Google Scholar] [CrossRef]
  13. Li, S.J.; Teo, K.L.; Yang, X.Q. A remark on a standard and linear vector network equilibriium problem with capacity constraints. Eur. J. Oper. Res. 2008, 184, 13–23. [Google Scholar] [CrossRef]
  14. Li, S.J.; Yang, X.Q.; Chen, G.Y. A note on vector network equilibrium principles. Math. Methods Oper. Res. 2008, 184, 13–23. [Google Scholar] [CrossRef]
  15. Cao, J.D.; Li, R.X.; Huang, W.; Guo, J.H.; Wei, Y. Traffic network equilibrium problems with demands uncertainty and capacity constraints of arcs by scalarization approaches. Sci. China Technol. Sci. 2018, 61, 1642–1653. [Google Scholar] [CrossRef]
  16. Wei, H.Z.; Chen, C.R.; Wu, B.W. Vector network equilibrium problems with uncertain demands and capacity constraints of arcs. Optim. Lett. 2021, 15, 1113–1131. [Google Scholar] [CrossRef]
  17. Wu, Y.N.; Cheng, T.C.E. Benson efficiency of a multi-criterion network equilibrium model. Pac. J. Optim. 2009, 5, 443–458. [Google Scholar]
  18. Wu, Y.N.; Peng, Y.C.; Peng, L.; Xu, L. Super efficiency of multicriterion network equilibrium model and vector variational inequality. J. Optim. Theory App. 2012, 153, 485–496. [Google Scholar] [CrossRef]
  19. Gong, X.H. Efficiency and Hening efficiency for vector equilibrium problems. J. Optimiz. Theory App. 2001, 108, 139–154. [Google Scholar] [CrossRef]
  20. Cheng, Y.H.; Fu, W.T. Strong efficiency in a locally convex space. Math. Methods Oper. Res. 1999, 50, 373–384. [Google Scholar] [CrossRef]
  21. Yu, G.L.; Zhang, Y.; Liu, S.Y. Strong duality with strict efficiency in vector optimization involving nonconvex set-valued maps. J. Math. 2017, 37, 223–230. [Google Scholar]
  22. Konnov, I.V. Vector network equilibrium problems with elastic demands. J. Global Optim. 2013, 57, 521–531. [Google Scholar] [CrossRef]
  23. Browder, F.E. The fixed point theory of multi-valued mappings in topological vector spaces. Math. Ann. 1968, 177, 283–301. [Google Scholar] [CrossRef]
  24. Fan, K. A generalization of Tychonoffs fixed point theorem. Math. Ann. 1961, 142, 305–310. [Google Scholar] [CrossRef]
  25. Chen, G.Y.; Goh, C.J.; Yang, X.Q. Vector network equilibrium problems and nonlinear scalarization methods. Math. Methods Oper. Res. 1999, 49, 239–253. [Google Scholar]
  26. Chen, G.Y.; Yang, X.Q. Characterizations of variable domination structures via nonlinear scalarization. J. Optim. Theory App. 2002, 112, 97–110. [Google Scholar] [CrossRef]
Figure 1. Network topology of the example.
Figure 1. Network topology of the example.
Axioms 13 00263 g001
Table 1. OD pairs and paths.
Table 1. OD pairs and paths.
p OD p ω p
1 N 1 N 4 a 1 ( c 1 , c 5 )
a 2 ( c 2 )
2 N 3 N 4 a 3 ( c 3 , c 5 )
a 4 ( c 4 )
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Li, R.; Yu, G. Strict Vector Equilibrium Problems of Multi-Product Supply–Demand Networks with Capacity Constraints and Uncertain Demands. Axioms 2024, 13, 263. https://doi.org/10.3390/axioms13040263

AMA Style

Li R, Yu G. Strict Vector Equilibrium Problems of Multi-Product Supply–Demand Networks with Capacity Constraints and Uncertain Demands. Axioms. 2024; 13(4):263. https://doi.org/10.3390/axioms13040263

Chicago/Turabian Style

Li, Ru, and Guolin Yu. 2024. "Strict Vector Equilibrium Problems of Multi-Product Supply–Demand Networks with Capacity Constraints and Uncertain Demands" Axioms 13, no. 4: 263. https://doi.org/10.3390/axioms13040263

APA Style

Li, R., & Yu, G. (2024). Strict Vector Equilibrium Problems of Multi-Product Supply–Demand Networks with Capacity Constraints and Uncertain Demands. Axioms, 13(4), 263. https://doi.org/10.3390/axioms13040263

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop