Next Article in Journal
A New Subclass of H-Matrices with Applications
Previous Article in Journal
The Wasserstein Metric between a Discrete Probability Measure and a Continuous One
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On a Weighting Technique for Multiple Cost Optimization Problems with Interval Values

by
Savin Treanţă
1,2,3,* and
Omar Mutab Alsalami
4
1
Faculty of Applied Sciences, National University of Science and Technology Politehnica Bucharest, 060042 Bucharest, Romania
2
Academy of Romanian Scientists, 54 Splaiul Independentei, 050094 Bucharest, Romania
3
Fundamental Sciences Applied in Engineering—Research Center, National University of Science and Technology Politehnica Bucharest, 060042 Bucharest, Romania
4
Department of Electrical Engineering, College of Engineering, Taif University, Taif 21944, Saudi Arabia
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(15), 2321; https://doi.org/10.3390/math12152321
Submission received: 12 July 2024 / Revised: 23 July 2024 / Accepted: 24 July 2024 / Published: 24 July 2024
(This article belongs to the Special Issue New Aspects of Differentiable and Not Differentiable Function Theory)

Abstract

:
This paper deals with a weighting technique for a class of multiple cost optimization problems with interval values. More specifically, we introduce a multiobjective interval-valued controlled model and investigate it by applying the weighting method. In this regard, several characterization theorems are derived. Moreover, a numerical example is formulated. Based on the provided illustrative example and performing a comparative analysis of the results obtained using the weighting technique versus traditional optimization methods, we can easily conclude the effectiveness of the weighting technique in solving multiple cost optimization problems, that is, the conversion of a vector problem to a scalar one.

1. Introduction

As is well known, optimization theory has various and multiple applications in real-world problems. Over time, several techniques and methods associated with optimization and control theories have been introduced and studied by researchers working in different scientific areas. Salehnia et al. [1], by using Multi-Level Thresholding Image Segmentation (MTIS) methods, established the threshold vector that gives the best performance of the image segmentation system. Moore [2,3,4] showed that interval analysis provides a powerful and important set of ingredients with direct applicability to various problems in scientific computing. Also, Charnes et al. [5] formulated an algorithm for solving interval-valued linear programming problems. Later, interval analysis attracted more and more researchers. Thus, Alefeld and Herzberge [6] presented an introduction to interval computations. Since interval analysis has applications in optimization theory, many optimality and duality criteria have been established by various authors. Therefore, Giannessi [7] presented alternative theorems associated with generalized systems. Ishibuchi and Tanaka [8] studied multiobjective optimization governed by interval-valued objective functions. Pereira [9] established a control design for autonomous vehicles by providing a dynamic optimization perspective. About ten years ago, Jana and Panda [10] considered a vector optimization problem in an uncertain environment, where the objective and constraint functions were interval-valued functions. Relatively recently, Ahmad et al. [11] formulated optimality conditions associated with a class of multiobjective programming problems determined by interval-valued objective functions. Moreover, Ahmad et al. [12] reported sufficiency and duality results for interval-valued variational models. Debnath and Pokharna [13] investigated optimality and duality in interval-valued variational problems with B-(p, r)-invexity assumptions. Wu [14] analyzed some interval-valued optimization problems based on the null set notion. Jha et al. [15] established a characterization of L U -efficiency and formulated saddle-point criteria for F-approximated multiple-objective interval-valued optimization problems. Guo et al. [16] solved a nonsmooth interval-valued extremization problem by considering interval-valued symmetric invexity hypotheses. Rani and Kummari [17] formulated duality theorems for fractional variational problems with interval values via convexificators. Treanţă and Ciontescu [18] considered a family of optimal control problems generated by generalized invariant convex interval-valued functionals. Ye [19] formulated necessary and sufficient conditions of optimality for a mathematical program with equilibrium constraints. Joshi [20] presented optimality and duality associated with a nonsmooth semi-infinite mathematical program with equilibrium constraints involving generalized invexity of the order σ > 0 . Su [21] established optimality and duality results for nonsmooth mathematical programming problems under equilibrium constraints.
In this paper, based on the previously mentioned research works, we apply a weighting technique for a class of multiple cost optimization problems with interval values. More specifically, we introduce a multiobjective interval-valued controlled model and investigate it by applying the weighting method. In this regard, several characterization theorems are derived. The efficiency and effectiveness of the proposed technique is demonstrated by a numerical example. The main novel elements included in this study are given by the new family of optimization problems, the concept of convexity associated with interval-valued controlled multiple integral functionals, and the innovative proofs associated with the principal results. The weighting method (for the first time applied to the considered class of optimization problems) must be understood as follows: given a vector-valued functional, having multiple integrals as components and each component is an interval-valued controlled multiple integral functional, our aim is to minimize it by using the weighting technique, namely, by minimizing a scalar multiple integral functional defined as a sum of the lower and upper ends of the considered intervals multiplied by some positive scalars (weights). Thus, since the limitations of previous studies and these gaps are addressed by this study, we can easily conclude the effectiveness of the weighting technique in solving multiple cost optimization problems, that is, the conversion of a vector problem to a scalar one.

2. Preliminary Results

This section focuses on basic definitions, notations, and basic calculus in interval analysis, which are used in the following sections. In this regard, let R r be the classical Euclidean space of dimension r, together with its non-negative orthant, denoted by R + r . For any vectors α = α 1 , α 2 , , α r T and β = β 1 , β 2 , , β r T in R r , we define them as follows:
(i)
α = β α l = β l , l Ω r ;
(ii)
α < β α l < β l , l Ω r ;
(iii)
α β α l β l , l Ω r ;
(iv)
α β α β and α β ,
where Ω r = { 1 , 2 , , r } is an index set. We consider K as a compact set in R w with a , b K two arbitrary fixed points, and Z is a family of piecewise smooth functions μ : K R n (state variable), and Π is the family of all piecewise continuous functions π : K R s (control variables). Furthermore, consider X : K × Z × Π R r , Y : K × Z × Π R m and H : K × Z × Π R n as vector-valued functionals that possess continuous differentiability concerning each of their inputs. The functional X = X ( ϵ , μ ( ϵ ) , π ( ϵ ) ) is defined for an independent variable ϵ K , with μ : K R n as an n-dimensional piecewise smooth function of ϵ ( μ γ ( ϵ ) denoting the partial derivative of μ ( ϵ ) with respect to ϵ γ , γ = 1 , w ¯ ), and π : K R s is a s-dimensional piecewise continuous function of ϵ . To make the notation less complex, we will denote μ ( ϵ ) , π ( ϵ ) and μ γ ( ϵ ) as μ , π and μ γ , respectively. If X l , l = 1 , , r are the components of the above-mentioned vector-valued function X, the partial derivatives of X l with respect to ϵ ,   μ , and π are denoted as X ϵ l ,   X μ l , and X π l , respectively. More precisely, X μ l and X π l are defined as the vectors X l μ 1 , , X l μ n T and X l π 1 , , X l π s T , respectively. Similarly, the first-order partial derivatives g μ , h μ and g π , h π of the vector-valued functionals Y and H, respectively, can be expressed using matrices with m ( n ) rows instead of a single row.
Consider the family J ( R ) of all compact (bounded and closed) real intervals. Further, when we refer to a compact real interval, we represent it as R = r ̲ L , r ¯ U , where r ̲ L and r ¯ U represent the lower and upper bounds of R , respectively. To clarify, if R = r ̲ L , r ¯ U J ( R ) , then R = r ̲ L , r ¯ U = ϵ R : r ̲ L ϵ r ¯ U . If r ̲ L = r ¯ U = r , then R = [ r , r ] = r is a real number. Let R = r ̲ L , r ¯ U and P = p ̲ L , p ¯ U in J ( R ) . Then, by definition, we have
(a)
R + P = { r + p : r R and p P } = r ̲ L + p ̲ L , r ¯ U + p ¯ U ;
(b)
R = { r : r R } = r ¯ U , r ̲ L ;
(c)
R P = R + ( P ) = { r p : r R and p P } = r ̲ L p ¯ U , r ¯ U p ̲ L ;
(d)
ζ + R = { ζ + r : r R } = ζ + r ̲ L , ζ + r ¯ U , where ζ is a real number;
(e)
ζ R = ζ r ̲ L , ζ r ¯ U if ζ > 0 , ζ r ¯ U , ζ r ̲ L if ζ 0 , where ζ is a real number.
Interval analysis (see, for example, Moore [2,3], Moore et al.[4], and Alefeld and Herzberger [6]) commonly uses an order relation to establish a ranking among real intervals. This fact means that one interval is superior to another, but it does not imply that one is larger than the other. Thus, for R = r ̲ L , r ¯ U and P = p ̲ L , p ¯ U in J ( R ) , we write
R L U P if and only if r ̲ L p ̲ L r ¯ U p ¯ U .
The fact that L U is a partial ordering on J ( R ) is readily apparent. This implies that R is inferior to P , or P is superior to R . Moreover, R < L U P can be expressed if and only if R L U P and R P , or, equivalently,
R < L U P if and only if r ̲ L < p ̲ L r ¯ U p ¯ U , or r ̲ L p ̲ L r ¯ U < p ¯ U , or r ̲ L < p ̲ L r ¯ U < p ¯ U .
A vector of compact real intervals, denoted as R = R 1 , , R p , is defined as a vector where each component R l is a compact real interval r ̲ l L , r ¯ l U . Denote by J ( R p ) the family of all vectors of compact real intervals. For two vectors of compact real intervals, R = R 1 , , R p and P = P 1 , , P p , we will use the notation R L U P to indicate that R l L U P l , for all l Ω p . Similarly, we will use R < L U P to indicate that R l L U P l , for all l Ω p , and R l * < L U P l * , for at least one l * Ω p .
Now, we will formulate the convexity concept associated with an interval-valued controlled multiple integral functional. In particular, we use the very straightforward concept of convexity introduced by Wu [22] and Treanţă [23,24].
Definition 1.
Let Φ : Z × Π J ( R ) be defined by
Φ ( μ , π ) = K X ( ϵ , μ , μ γ , π ) d ϵ = K X L ( ϵ , μ , μ γ , π ) d ϵ , K X U ( ϵ , μ , μ γ , π ) d ϵ ,
with X : K × Z × Z × Π J ( R ) and X L , X U : K × Z × Z × Π R continuously differentiable functionals. Then, Φ ( μ , π ) = K X ( ϵ , μ , μ γ , π ) d ϵ is said to be a convex interval-valued controlled multiple integral functional on Z × Π if the inequalities
K X L ( ϵ , μ , μ γ , π ) d ϵ K X L ( ϵ , μ ¯ , μ ¯ γ , π ¯ ) d ϵ K { ( μ μ ¯ ) T X μ L ( ϵ , μ ¯ , μ ¯ γ , π ¯ ) + ( μ γ μ ¯ γ ) T X μ γ L ( ϵ , μ ¯ , μ ¯ γ , π ¯ ) + ( π π ¯ ) T X π L ( ϵ , μ ¯ , μ ¯ γ , π ¯ ) } d ϵ , K X U ( ϵ , μ , μ γ , π ) d ϵ K X U ( ϵ , μ ¯ , μ ¯ γ , π ¯ ) d ϵ K { ( μ μ ¯ ) T X μ U ( ϵ , μ ¯ , μ ¯ γ , π ¯ ) + ( μ γ μ ¯ γ ) T X μ γ U ( ϵ , μ ¯ , μ ¯ γ , π ¯ ) + ( π π ¯ ) T X π U ( ϵ , μ ¯ , μ ¯ γ , π ¯ ) } d ϵ
hold for all μ , μ ¯ Z , π , π ¯ Π .
The alternative lemma presented below is a specific case of the more general results established in Giannessi [7] and Giorgi [25] for convex vector optimization problems.
Lemma 1.
Let Z × Π be a convex set and ϕ : K × Z × Π J ( R p ) and ψ : K × Z × Π I ( R q ) be convex interval-valued controlled multiple integral functionals. If the system
K ϕ l ( ϵ , μ , π ) d ϵ = K ϕ l L ( ϵ , μ , π ) d ϵ , K ϕ l U ( ϵ , μ , π ) d ϵ < L U [ 0 , 0 ] l Ω p K ψ j ( ϵ , μ , π ) d ϵ = K ψ j L ( ϵ , μ , π ) d ϵ , K ψ j U ( ϵ , μ , π ) d ϵ L U [ 0 , 0 ] , j Ω q
has no solution, then there exists δ = δ L , δ U 0 , where δ L , δ U R p , and ξ = ξ L , ξ U 0 , where ξ L , ξ U R q , such that
K l = 1 p δ l L ϕ l L ( ϵ , μ , π ) + δ l U ϕ l U ( ϵ , μ , π ) d ϵ + K j = 1 q ξ j L ψ j L ( ϵ , μ , π ) + ξ j U ψ j U ( ϵ , μ , π ) d ϵ 0 .

3. Main Results

In this section, we investigate the following multiple cost interval-valued extremization problem formulated as follows:
( P ) min ( μ , π ) K X ( ϵ , μ , π ) d ϵ = min ( μ , π ) K X 1 ( ϵ , μ , π ) d ϵ , , K X r ( ϵ , μ , π ) d ϵ subject to Y ( ϵ , μ , π ) 0 , ϵ K , ( H γ ( ϵ , μ , π ) ) = ( μ γ ) , γ = 1 , w ¯ , ϵ K , μ ( a ) = a 0 , μ ( b ) = b 0 ,
where K X l ( ϵ , μ , π ) d ϵ = K X l L ( ϵ , μ , π ) d ϵ , K X l U ( ϵ , μ , π ) d ϵ for each l Ω r , a 0 , b 0 R n are given, and X l L , X l U : I × Z × Π R , l Ω r , Y : I × Z × Π R m and H : I × Z × Π R w are C 1 -class functionals. Let
F = { ( μ , π ) Z × Π : Y ( ϵ , μ , π ) 0 , ( H γ ( ϵ , μ , π ) ) = ( μ γ ) , γ = 1 , w ¯ , ϵ K ,
μ ( a ) = a 0 , μ ( b ) = b 0 }
be the set of all feasible solutions in (P).
The optimal solutions for multiple-objective interval-valued extremization problems are defined in terms of weakly L U -efficient and L U -efficient points, as below.
Definition 2.
A feasible solution ( μ ¯ , π ¯ ) F is said to be a weakly L U -efficient point of (P) if and only if there exists no other ( μ , π ) F such that
K X l ( ϵ , μ , π ) d ϵ < L U K X l ( ϵ , μ ¯ , π ¯ ) d ϵ , l Ω r .
Definition 3.
A feasible solution ( μ ¯ , π ¯ ) F is said to be an L U -efficient point of (P) if and only if there exists no other ( μ , π ) F , such that
K X l ( ϵ , μ , π ) d ϵ L U K X l ( ϵ , μ ¯ , π ¯ ) d ϵ , l Ω r K X i 0 ( ϵ , μ , π ) d ϵ < L U K X i 0 ( ϵ , μ ¯ , π ¯ ) d ϵ , for some i 0 Ω r .
In this section, to investigate a weakly L U -efficient point and/or an L U -efficient point of (P), we use the weighting approach (see Antczak [26]). Thus, for this purpose, an auxiliary weighting control problem is introduced for the considered multiple cost interval-valued extremization problem as follows:
( weight-P ) v min ( μ , π ) Γ ( μ , π ) = min ( μ , π ) K l = 1 r v l L X l L ( ϵ , μ , π ) + l = 1 r v l U X l U ( ϵ , μ , π ) d ϵ
subject to Y ( ϵ , μ , π ) 0 , ϵ K , ( H γ ( ϵ , μ , π ) ) = ( μ γ ) , γ = 1 , w ¯ , ϵ K , μ ( a ) = a 0 , μ ( b ) = b 0 ,
where v = ( v L , v U ) , with v L = v 1 L , , v r L 0 , v U = v 1 U , , v r U 0 .
Definition 4.
A feasible solution ( μ ¯ , π ¯ ) F is said to be an optimal solution of ( w e i g h t - P ) v if the inequality
K l = 1 r v l L X l L ( ϵ , μ ¯ , π ¯ ) + l = 1 r v ¯ l U X l U ( ϵ , μ ¯ , π ¯ ) d ϵ K l = 1 r v l L X l L ( ϵ , μ , π ) + l = 1 r v l U X l U ( ϵ , μ , π ) d ϵ
holds for all ( μ , π ) F .
Theorem 1.
Let ( μ ¯ , π ¯ ) F be an optimal solution of ( w e i g h t - P ) v ¯ . Further, assume that v ¯ = v ¯ L , v ¯ U = v ¯ 1 L , v ¯ 2 L , , v ¯ r L , v ¯ 1 U , v ¯ 2 U , , v ¯ r U 0 with v ¯ i 0 L , v ¯ i 0 U > 0 for some i 0 Ω r . Then ( μ ¯ , π ¯ ) F is a weakly L U -efficient point of (P).
Proof. 
By assumption, ( μ ¯ , π ¯ ) F is an optimal solution of ( weight-P ) v ¯ . We assume, on the contrary, that ( μ ¯ , π ¯ ) F is not a weakly L U -efficient point to (P). Therefore, according to Definition 2, it follows that there exists another ( μ ˜ , π ˜ ) F , such that
K X l ( ϵ , μ ˜ , π ˜ ) d ϵ < L U K X l ( ϵ , μ ¯ , π ¯ ) d ϵ , l Ω r .
According to the definition of the order relation < L U , it follows that, for any l Ω r , we have
K X l L ( ϵ , μ ˜ , π ˜ ) d ϵ < K X l L ( ϵ , μ ¯ , π ¯ ) d ϵ K X l U ( ϵ , μ ˜ , π ˜ ) d ϵ K X l U ( ϵ , μ ¯ , π ¯ ) d ϵ , or K X l L ( ϵ , μ ˜ , π ˜ ) d ϵ K X l L ( ϵ , μ ¯ , π ¯ ) d ϵ K X l U ( ϵ , μ ˜ , π ˜ ) d ϵ < K X l U ( ϵ , μ ¯ , π ¯ ) d ϵ , or K X l L ( ϵ , μ ˜ , π ˜ ) d ϵ < K X l L ( ϵ , μ ¯ , π ¯ ) d ϵ K X l U ( ϵ , μ ˜ , π ˜ ) d ϵ < K X l U ( ϵ , μ ¯ , π ¯ ) d ϵ .
Since v ¯ = v ¯ L , v ¯ U = v ¯ 1 L , , v ¯ r L , v ¯ 1 U , , v ¯ r U 0 with v ¯ i 0 L , v ¯ i 0 U > 0 , for some i 0 Ω r , the above system of inequalities yields that the inequality
K l = 1 r v ¯ l L X l L ( ϵ , μ ˜ , π ˜ ) + l = 1 r v ¯ l U X l U ( ϵ , μ ˜ , π ˜ ) d ϵ < K l = 1 r v ¯ l L X l L ( ϵ , μ ¯ , π ¯ ) + l = 1 r v ¯ l U X l U ( ϵ , μ ¯ , π ¯ ) d ϵ
holds. This contradicts the assumption that ( μ ¯ , π ¯ ) F is an optimal solution of ( weight-P ) v ¯ . Hence, ( μ ¯ , π ¯ ) F is a weakly L U -efficient point of the considered control problem (P), which completes the proof of the theorem. □
Theorem 2.
Let ( μ ¯ , π ¯ ) F be an optimal solution of ( weight-P ) v ¯ . Further, assume that v ¯ = v ¯ L , v ¯ U = v ¯ 1 L , , v ¯ r L , v ¯ 1 U , , v ¯ r U 0 with v ¯ L 0 and v ¯ U 0 . Then ( μ ¯ , π ¯ ) F is an L U -efficient point of (P).
Proof. 
By assumption, ( μ ¯ , π ¯ ) F is an optimal solution of ( weight-P ) v ¯ . We assume, contrary to the result, that ( μ ¯ , π ¯ ) F is not an L U -efficient point to (P). Therefore, according to Definition 3, it follows that there exists another ( μ ˜ , π ˜ ) F , such that
K X l ( ϵ , μ ˜ , π ˜ ) d ϵ L U K X l ( ϵ , μ ¯ , π ¯ ) d ϵ , l Ω r K X i 0 ( ϵ , μ ˜ , π ˜ ) d ϵ < L U K X i 0 ( ϵ , μ ¯ , π ¯ ) d ϵ , for some i 0 Ω r .
According to the definition of the order relation L U , it follows that, for any l Ω r , we have
K X l L ( ϵ , μ ˜ , π ˜ ) d ϵ K X l L ( ϵ , μ ¯ , π ¯ ) d ϵ K X l U ( ϵ , μ ˜ , π ˜ ) d ϵ K X l U ( ϵ , μ ¯ , π ¯ ) d ϵ .
According to the definition of the relation < L U , it follows that, for any l Ω r ,
K X l L ( ϵ , μ ˜ , π ˜ ) d ϵ < K X l L ( ϵ , μ ¯ , π ¯ ) d ϵ K X l U ( ϵ , μ ˜ , π ˜ ) d ϵ K X l U ( ϵ , μ ¯ , π ¯ ) d ϵ , or K X l L ( ϵ , μ ˜ , π ˜ ) d ϵ K X l L ( ϵ , μ ¯ , π ¯ ) d ϵ K X l U ( ϵ , μ ˜ , π ˜ ) d ϵ < K X l U ( ϵ , μ ¯ , π ¯ ) d ϵ , or K X l L ( ϵ , μ ˜ , π ˜ ) d ϵ < K X l L ( ϵ , μ ¯ , π ¯ ) d ϵ K X l U ( ϵ , μ ˜ , π ˜ ) d ϵ < K X l U ( ϵ , μ ¯ , π ¯ ) d ϵ .
Since v ¯ = v ¯ L , v ¯ U = v ¯ 1 L , , v ¯ r L , v ¯ 1 U , , v ¯ r U 0 with v ¯ L 0 and v ¯ U 0 , (1) and (2) imply that the inequality
K l = 1 r v ¯ l L X l L ( ϵ , μ ˜ , π ˜ ) + l = 1 r v ¯ l U X l U ( ϵ , μ ˜ , π ˜ ) d ϵ < K l = 1 r v ¯ l L X l L ( ϵ , μ ¯ , π ¯ ) + l = 1 r v ¯ l U X l U ( ϵ , μ ¯ , π ¯ ) d ϵ
holds. This contradicts the assumption that ( μ ¯ , π ¯ ) F is an optimal solution of ( weight-P ) v ¯ . Hence, ( μ ¯ , π ¯ ) F is an L U -efficient point of (P), which completes the proof of the theorem. □
Now, we give an example of a multiple cost interval-valued extremization problem, which we solve using the weighting method to support our result established in Theorem 2.
Example 1.
Let K = [ 0 , 1 ] × [ 0 , 1 ] = [ 0 , 1 ] 2 , n = s = m = 1 , r = w = 2 , and consider the following multiple cost interval-valued minimization problem (P1), defined as
( P 1 ) min ( μ , π ) K X ( ϵ , μ , π ) d ϵ = min ( μ , π ) K X 1 ( ϵ , μ , π ) d ϵ , K X 2 ( ϵ , μ , π ) d ϵ = min ( μ , π ) [ 0 , 1 ] 2 ( 2 arcsin μ ( ϵ ) + μ ( ϵ ) ) d ϵ , [ 0 , 1 ] 2 ( 2 arcsin μ ( ϵ ) + μ ( ϵ ) + 1 ) d ϵ , [ 0 , 1 ] 2 e μ ( ϵ ) d ϵ , [ 0 , 1 ] 2 ( e μ ( ϵ ) + μ ( ϵ ) ) d ϵ
subject to μ ( ϵ ) + μ 2 ( ϵ ) 0 , ϵ K ,
π ( ϵ ) μ γ ( ϵ ) = 0 , γ = 1 , 2 , ϵ K ,
μ ( 0 , 0 ) = μ ( 1 , 1 ) = 0 .
As it follows from the formulation of (P1), we have
X 1 L ( ϵ , μ , π ) = 2 arcsin μ ( ϵ ) + μ ( ϵ ) , X 1 U ( ϵ , μ , π ) = 2 arcsin μ ( ϵ ) + μ ( ϵ ) + 1 , X 2 L ( ϵ , μ , π ) = e μ ( ϵ ) , X 2 U ( ϵ , μ , π ) = e μ ( ϵ ) + μ ( ϵ ) .
We now use the weighting method for solving (P1). Let v ¯ 1 = v ¯ 1 L , v ¯ 1 U = 1 2 , 1 2 > 0 and v ¯ 2 = v ¯ 2 L , v ¯ 2 U = 1 2 , 0 0 . The associated auxiliary weighting control problem ( W P 1 ) v ¯ is defined by
( W P 1 ) v ¯ min ( μ , π ) Γ ( μ , π ) = min ( μ , π ) K l = 1 2 v l L X l L ( ϵ , μ , π ) + l = 1 2 v l U X l U ( ϵ , μ , π ) d ϵ
= min ( μ , π ) [ 0 , 1 ] 2 2 arcsin μ ( ϵ ) 1 2 e μ ( ϵ ) + μ ( ϵ ) + 1 2 d ϵ
subject to μ ( ϵ ) + μ 2 ( ϵ ) 0 , ϵ K ,
π ( ϵ ) μ γ ( ϵ ) = 0 , γ = 1 , 2 , ϵ K ,
μ ( 0 , 0 ) = μ ( 1 , 1 ) = 0 .
The set of all feasible solutions of ( W P 1 ) v ¯ is given by
F = { μ ( ϵ ) R : μ ( 0 , 0 ) = μ ( 1 , 1 ) = 0 , 0 μ ( ϵ ) 1 ,
π ( ϵ ) μ γ ( ϵ ) = 0 , γ = 1 , 2 , ϵ [ 0 , 1 ] 2 }
and ( μ ¯ ( ϵ ) , π ¯ ( ϵ ) ) = ( 0 , 0 ) is an optimal solution in ( W P 1 ) v ¯ . Further, since all the hypotheses of Theorem 2 are satisfied, ( μ ¯ ( ϵ ) , π ¯ ( ϵ ) ) = ( 0 , 0 ) is an L U -efficient point of (P1).
Now, under suitable convexity hypotheses, we prove the converse result to those established in Theorems 1 and 2.
Theorem 3.
Let each objective multiple integral functional
K X l ( ϵ , μ , π ) d ϵ , l Ω r
be a convex interval-valued controlled multiple integral functional on the convex set Z × Π . If ( μ ¯ , π ¯ ) F is a weakly L U -efficient point in (P), then there exists v ¯ = v ¯ L , v ¯ U 0 , where v ¯ L = v ¯ 1 L , , v ¯ r L , v ¯ U = v ¯ 1 U , , v ¯ r U R r , such that ( μ ¯ , π ¯ ) F is an optimal solution of the auxiliary weighting control problem ( weight-P ) v ¯ .
Proof. 
Let ( μ ¯ , π ¯ ) F be a weakly L U -efficient point in (P). Then, according to Definition 2, there is no other feasible solution ( μ , π ) F such that
K X l ( ϵ , μ , π ) d ϵ < L U K X l ( ϵ , μ ¯ , π ¯ ) d ϵ , l Ω r .
From the definition of the order relation < L U , it follows that, for every l Ω r , we have
K X l L ( ϵ , μ , π ) d ϵ < K X l L ( ϵ , μ ¯ , π ¯ ) d ϵ K X l U ( ϵ , μ , π ) d ϵ K X l U ( ϵ , μ ¯ , π ¯ ) d ϵ , or K X l L ( ϵ , μ , π ) d ϵ K X l L ( ϵ , μ ¯ , π ¯ ) d ϵ K X l U ( ϵ , μ , π ) d ϵ < K X l U ( ϵ , μ ¯ , π ¯ ) d ϵ , K X l L ( ϵ , μ , π ) d ϵ < K X l L ( ϵ , μ ¯ , π ¯ ) d ϵ K X l U ( ϵ , μ , π ) d ϵ < K X l U ( ϵ , μ ¯ , π ¯ ) d ϵ .
By assumption, each objective multiple integral functional K X l ( ϵ , μ , π ) d ϵ , l Ω r is a convex interval-valued controlled multiple integral functional on F. Then, according to Definition 1, it follows that the multiple integral functionals K X l L ( ϵ , μ , π ) d ϵ and K X l U ( ϵ , μ , π ) d ϵ , l Ω r , are convex on F. Since the system of inequalities (3) has no solution for ( μ ¯ , π ¯ ) F , consequently, by Lemma 1, there exist v ¯ L , v ¯ U R r with
v ¯ L , v ¯ U = v ¯ 1 L , , v ¯ r L , v ¯ 1 U , , v ¯ r U 0
such that the inequality
K l = 1 r v ¯ l L X l L ( ϵ , μ , π ) + l = 1 r v ¯ l U X l U ( ϵ , μ , π ) d ϵ K l = 1 r v ¯ l L X l L ( ϵ , μ ¯ , π ¯ ) + l = 1 r v ¯ l U X l U ( ϵ , μ ¯ , π ¯ ) d ϵ
holds for all ( μ , π ) F . This means, according to Definition 4, that ( μ ¯ , π ¯ ) F is an optimal solution of the auxiliary weighting control problem ( weight-P ) v ¯ , which completes the proof of this theorem. □

4. Discussion of Technical and Distinguished Issues

In this study, we introduced a multiobjective interval-valued controlled model and investigated it by applying the weighting method. In this regard, various characterization theorems have been formulated and proved. The efficiency and effectiveness of the proposed technique has been illustrated by a numerical example. Based on the previous illustrative example, performing a comparative analysis of the results obtained using the weighting technique versus traditional optimization methods, we can easy conclude the effectiveness of the weighting technique in solving multiple cost optimization problems, that is, the conversion of a vector problem to a scalar one. The weighting method (for the first time applied to the considered class of optimization problems) must be understood as follows: given a vector-valued functional, having multiple integrals as components and each component being an interval-valued controlled multiple integral functional, our aim is to minimize it by using the weighting technique, namely, by minimizing a scalar multiple integral functional defined as a sum of the lower and upper ends of the considered intervals multiplied by some positive scalars (weights).

5. Conclusions and Future Research Directions

In this paper, the authors applied a weighting technique for a class of multiple cost optimization problems with interval values. More specifically, the authors introduced a multiobjective interval-valued controlled model and solved it by using the weighting method. In this regard, several characterization theorems have been established. Moreover, to illustrate the theoretical developments, an illustrative example was formulated.
As potential extensions of the proposed weighting technique for different types of optimization problems or domains, we should mention the study of well-posedness associated with similar classes of extremization problems governed by path-independent curvilinear integral functionals. This is a specific research question or unresolved issue that could be addressed in future studies to build upon the current findings. Consequently, we note the applicability of the weighting technique to larger or more complex optimization problems.

Author Contributions

Conceptualization, S.T. and O.M.A.; formal analysis, S.T. and O.M.A.; funding acquisition, S.T. and O.M.A.; investigation, S.T. and O.M.A.; methodology, S.T. and O.M.A.; validation, S.T. and O.M.A.; visualization, S.T. and O.M.A.; writing—original draft, S.T. and O.M.A.; writing—review and editing, S.T. and O.M.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by TAIF University, TAIF, Saudi Arabia, Project No. (TU-DSPP-2024-258).

Data Availability Statement

The original contributions presented in the study are included in the article, further inquiries can be directed to the corresponding author.

Acknowledgments

The authors would like to thank the referees for their constructive remarks and suggestions. The authors extend their appreciation to TAIF University, Saudi Arabia, for supporting this work through project number (TU-DSPP-2024-258).

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Salehnia, T.; MiarNaeimi, F.; Izadi, S.; Ahmadi, M.; Montazerolghaem, A.; Mirjalili, S.; Abualigah, L. A MTIS method using a combined of whale and moth-flame optimization algorithms. In Handbook of Whale Optimization Algorithm; Academic Press: New York, NY, USA, 2024; pp. 625–651. [Google Scholar]
  2. Moore, R.E. Interval Analysis; Prentice-Hall: Englewood Cliffs, NJ, USA, 1966. [Google Scholar]
  3. Moore, R.E. Methods and Applications of Interval Analysis; SIAM: Philadelphia, PA, USA, 1979. [Google Scholar]
  4. Moore, R.E.; Kearfott, R.B.; Cloud, M.J. Introduction to Interval Analysis; SIAM: Philadelphia, PA, USA, 2009. [Google Scholar]
  5. Charnes, A.; Granot, F.; Phillips, F. An algorithm for solving interval linear programming problems. Oper. Res. 1977, 25, 688–695. [Google Scholar] [CrossRef]
  6. Alefeld, G.; Herzberger, J. Introduction to Interval Computations; Academic Press: New York, NY, USA, 1983. [Google Scholar]
  7. Giannessi, F. Theorems of the alternative and optimality conditions. J. Optim. Theory Appl. 1984, 42, 331–365. [Google Scholar] [CrossRef]
  8. Ishibuchi, H.; Tanaka, H. Multiobjective programming in optimization of the interval objective function. Eur. J. Oper. Res. 1990, 48, 219–225. [Google Scholar] [CrossRef]
  9. Pereira, F.L. Control design for autonomous vehicles: A dynamic optimization perspective. Eur. J. Control 2001, 7, 178–202. [Google Scholar] [CrossRef]
  10. Jana, M.; Panda, G. Solution of nonlinear interval vector optimization problem. Oper. Res. 2014, 14, 71–85. [Google Scholar]
  11. Ahmad, I.; Singh, D.; Dar, B.A. Optimality conditions in multiobjective programming problems with interval-valued objective functions. Control. Cybern. 2015, 44, 19–45. [Google Scholar]
  12. Ahmad, I.; Jayswal, A.; Al-Homidan, S.; Banerjee, J. Sufficiency and duality in interval-valued variational programming. Neural Comput. Appl. 2019, 31, 4423–4433. [Google Scholar] [CrossRef]
  13. Debnath, I.P.; Pokharna, N. On optimality and duality in interval-valued variational problem with B-(p,r)-invexity. RAIRO—Oper. Res. 2021, 55, 1909–1932. [Google Scholar] [CrossRef]
  14. Wu, H.C. Solving the interval-valued optimization problems based on the concept of null set. J. Ind. Manag. Optim. 2018, 14, 1157–1178. [Google Scholar] [CrossRef]
  15. Jha, S.; Das, P.; Bandhyopadhyay, S. Characterization of LU-efficiency and saddle-point criteria for F-approximated multiobjective interval-valued variational problems. Results Control Optim. 2021, 4, 100044. [Google Scholar] [CrossRef]
  16. Guo, Y.; Ye, G.; Liu, W.; Zhao, D.; Treanţă, S. Solving nonsmooth interval optimization problems based on interval-valued symmetric invexity. Chaos, Solitons Fractals 2023, 174, 113834. [Google Scholar] [CrossRef]
  17. Rani, B.J.; Kummari, K. Duality for fractional interval-valued optimization problem via convexificator. Opsearch 2023, 60, 481–500. [Google Scholar] [CrossRef]
  18. Treanţă, S.; Ciontescu, M. On optimal control problems with generalized invariant convex interval-valued functionals. J. Indust. Manag. Optim. 2024, 20, 3317–3336. [Google Scholar] [CrossRef]
  19. Ye, J.J. Necessary and sufficient optimality conditions for mathematical program with equilibrium constraints. J. Math. Anal. Appl. 2005, 307, 350–369. [Google Scholar] [CrossRef]
  20. Joshi, B.C. Optimality and duality for nonsmooth semi-infinite mathematical program with equilibrium constraints involving generalized invexity of order σ>0. RAIRO Oper. Res. 2021, 55, 2221–2240. [Google Scholar] [CrossRef]
  21. Su, T.V. Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints. J. Glob. Optim. 2023, 85, 663–685. [Google Scholar] [CrossRef]
  22. Wu, H.C. The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions. Eur. J. Oper. Res. 2009, 196, 49–60. [Google Scholar] [CrossRef]
  23. Treanţă, S. On a class of interval-valued optimization problems. Contin. Mech. Thermodyn. 2022, 34, 617–626. [Google Scholar] [CrossRef]
  24. Treanţă, S. Characterization results of solutions in interval-valued optimization problems with mixed constraints. J. Glob. Optim. 2022, 82, 951–964. [Google Scholar] [CrossRef]
  25. Giorgi, G. Again on the Farkas Theorem and the Tucker Key Theorem Proved Easily; DEM Working Paper Series; University of Pavia, Department of Economics and Management: Pavia, Italy, 2014; Volume 94. [Google Scholar]
  26. Antczak, T. Weighting method for convex vector interval-valued optimization problems. Sci. Bull. Ser. A Appl. Math. Phys. 2022, 84, 155–162. [Google Scholar]
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

Treanţă, S.; Alsalami, O.M. On a Weighting Technique for Multiple Cost Optimization Problems with Interval Values. Mathematics 2024, 12, 2321. https://doi.org/10.3390/math12152321

AMA Style

Treanţă S, Alsalami OM. On a Weighting Technique for Multiple Cost Optimization Problems with Interval Values. Mathematics. 2024; 12(15):2321. https://doi.org/10.3390/math12152321

Chicago/Turabian Style

Treanţă, Savin, and Omar Mutab Alsalami. 2024. "On a Weighting Technique for Multiple Cost Optimization Problems with Interval Values" Mathematics 12, no. 15: 2321. https://doi.org/10.3390/math12152321

APA Style

Treanţă, S., & Alsalami, O. M. (2024). On a Weighting Technique for Multiple Cost Optimization Problems with Interval Values. Mathematics, 12(15), 2321. https://doi.org/10.3390/math12152321

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