![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
Abstract
As the development of a family of preinvex functions, we define the w-invex set and a class of real functions. These are functions with the names w-preinvex, w-strictly preinvex, w-prequasi-invex, w-strictly prequasi-invex, w-semi-strictly prequasi-invex, and w-pre-pseudo-invex. The fundamental characteristics of these functions are thoroughly examined. Several examples are provided here that serve to clarify the concept in this context. Several of these preinvex functions are addressed to investigate the optimization problems further.
1. Introduction
One analytical aspect of mathematical programming, dependent on convexity is the determination of appropriate optimality criteria. Among the various generalized convex functions, the invex functions stand out as a seminal contribution, pioneered by Hanson [Citation1]. Over time, this concept has undergone significant refinement and extension. Notably, Zalmai [Citation2] introduced the transformative -invex functions as a generalization of the invex functions.
The exploration of semistrictly preinvex functions on was initiated by Yang and Li [Citation3], while Rapcsak [Citation4] gave the idea of the geodesic convexity, particularly relevant in linear spaces and its extension to Riemannian manifolds. In the realm of Riemannian spaces, Udriste [Citation5] laid the foundation for convex programming as well as duality conditions, with Pini [Citation6] contributing to the development of invex functions in this context. Addressing vector programming problems on differentiable manifolds, Mititelu [Citation7] delineated necessary and sufficient conditions of Karush–Kuhn–Tucker (KKT) type, while Ferrara and Mititelu proposed the Mond-Weir form of duality for vector programming problems on such manifolds [Citation8].
The formulation of the Fritz-John condition for Inequality Constrained Optimization Problems (ICOP) was facilitated through the utilization of alternative theorems and assumptions concerning semi-preinvex functions, as introduced by Jeyakumar [Citation9]. Hanson, Mond, and Rueda established pivotal relationships between KKT points and mathematical programming problems [Citation1, Citation10].
Recent advancements include the introduction of generalized invexity by Caristi et al. [Citation11], the proposal of s-type preinvex functions by Ihsan et al. [Citation12], and the delineation of a new class of preinvex functions by Noor et al. [Citation13]. Additionally, Kiliçman et al. introduced generalized preinvex functions [Citation14], alongside several other notable generalizations proposed by various authors [Citation6, Citation7, Citation15–26].
In case X is not invex set w.r.t. a map η, then w.r.t. map η and another map w, we define a new set Y known as w-invex set. The motivation for defining such sets came due to the possibility of better results that were not usually obtained on invex sets. This w-invex set, a subset of , is a generalization of an invex set X (w.r.t. the map η). This special generalization arises in the situation when the results of optimizations are not evolved on proper invex sets, while in the case w-invex set, we get more fruitful results.
There is a connection between several tested generalizations discussed in this work and w-invexity. Generalized convexity and related ideas are introduced in Section 2. In Section 3, it is demonstrated that there is a very obvious method to follow w-prequasi-invexity, w-strictly prequasi-invexity, and w-semi-strictly prequasi-invexity for the real functions. Given that w-preinvex functions produce the necessary results, it is simple to convert these class functions into a class of regular invex functions.
2. Preliminaries
For our study, which is detailed in the following sections, we will mostly use the following definitions:
Definition 2.1
[Citation27, Citation28]
A non-empty subset X of is known as invex if ∃ a bi-function
such that ∀
and ∀
, we obtain
.
Definition 2.2
[Citation27, Citation28]
On a non-empty subset X of , a function
is known as preinvex if ∃
, a bi-function, such that ∀
and ∀
, we obtain
Definition 2.3
[Citation29]
On a non-empty subset X of , a function
is known as prequasi invex if ∃
, a bi-function, s.t., ∀
and ∀
, we obtain
Definition 2.4
[Citation25]
On a non-empty subset X of , a function
is known as strictly prequasi invex if ∃ a bi-function
such that ∀
,
and ∀
,we obtain
Definition 2.5
[Citation25]
On a non-empty subset X of , a function
is known as semi-strictly prequasi invex if ∃ a bi-function
such that ∀
,
and ∀
, we obtain
The following definitions and remarks are introduced in this paper
Definition 2.6
A non-empty subset X of is said to be w-invex if there exists map
and
such that
Remark 2.1
Every invex set is w-invex (as take w is an identity map) however converse isn't always true. See example (3.1).
Definition 2.7
Let X be a w-invex set. A function is said to be
w-preinvex if ∀ points
, and
, such that
w-strictly preinvex if ∀ points
,
and
, such that
w-prequasi-invex if ∀ points
, and
, such that
w-strictly prequasi-invex if ∀ points
,
and
, such that
w-semi-strictly prequasi-invex if ∀ points
,
and
, such that
Remark 2.2
In general, every w-strictly preinvex function is also a w-preinvex function; every w-preinvex function is also a w-prequasi-invex function; every preinvex function is also a w-preinvex function (as take w is an identity map); however, converse isn't always true. See examples (3.4) and (3.5).
3. w-invexity
We construct the following examples to verify/support the Definition (2.6) onwards
Example 3.1
Let be given by:
and let the function
be given by:
Then,
is not an invex set w.r.t. (w.r.t. referred to with respect to) map η but it is w-invex set w.r.t. the maps η and w.
Example 3.2
Consider be defined as:
where k is a constant.
Let the function be defined as:
and consider
as:
for all
. Then, the function h is w-preinvex function w.r.t. η and w.
Example 3.3
Consider be defined as:
where k is a constant.
Consider the function be defined as:
and consider
be defined as:
for all
. Then, the function h is w-preinvex function w.r.t. η and w, but not w-strictly preinvex and preinvex function.
Example 3.4
Consider be defined as:
. Consider the function
be defined as:
and consider
be defined as:
for all
. Then, the function h is w-prequasi-invex function w.r.t. η and w, but not w-preinvex function.
Example 3.5
Let be defined as:
where k is a constant. let the function
be defined as:
and consider
be defined as:
for all
. It is simple to demonstrate that while h is w-preinvex w.r.t. η and w and, it is not preinvex w.r.t. η.
Example 3.6
Let be defined as:
let the function
be defined as:
and consider
be defined as:
for all
. Then, the function h is w-prequasi-invex function w.r.t. η and w.
Now, consider the following main result
Theorem 3.1
Let X be a non-empty w-invex subset of .
is w-preinvex function w.r.t. η and w if and only if the epigraph of h,
is w-invex w.r.t. the same η and w.
Proof.
Consider be a w-preinvex function w.r.t. η and w. Suppose that
and
, with
,
and
, for
. Thus,
which implies that
This shows that
is w-invex w.r.t. the maps η and w. Conversely, assume that
is w-invex set w.r.t. the maps η and w. Take
. Then
, it follows that
then
By doing so, it is demonstrated that h is a w-preinvex function w.r.t. the map η and w.
Theorem 3.2
Let be a w-preinvex function w.r.t. the functions η and w, where X is any non-empty w-invex subset of
. Then, the level set
is w-invex w.r.t. the same maps η and w.
Proof.
Let . Then
,
. Since h is w-preinvex then, we have,
,
This shows that
, and the level set
is a w-invex set w.r.t. the map η and w.
Theorem 3.3
Let X be a non-empty w-invex subset of . The function
is w-prequasi-invex w.r.t. the same η and w if and only if the level set
is w-invex w.r.t. the same η and w.
Proof.
Suppose that the function h is w-prequasi-invex w.r.t. the maps η and w. Let Then,
and
. Since X is a w-invex set, so,
Since h is w-prequasi-invex function, we have
so
This implies that
is a w-invex set w.r.t. the maps η and w.
Conversely, assume that the level set is w-invex w.r.t. the maps η and w. Let
for
Since X is a w-invex set, we have
implies that
This prove that h is a w-prequasi-invex function w.r.t. the functions η and w.
Theorem 3.4
Assume that is a w-preinvex function w.r.t. the maps η and w, where X is any non-empty w-invex subset of
and
Then, the set
is w-invex w.r.t. the same η and w. If h is w-strictly preinvex then F is a singleton.
Proof.
Assume that and
. Since h is a w-preinvex then, we have
This follows that
which implies that F is w-invex w.r.t. the maps η and w.
For the other part, contrarily suppose that . Since X is a w-invex set, so
Also, since h is w-strictly preinvex, we have
This contradiction the fact that
Therefore, F is singleton.
Theorem 3.5
Let is a w-preinvex function on X, where X is any non-empty w-invex subset of
. Therefore, any local minimum point is also a global minimum point.
Proof.
Let be the local minimum point for h. Then, a neighbourhood N of
such that
(1)
(1) Assuming that
is not a global minimum point of h, then ∃ a point
Since h is w-preinvex X, ∃η and w such that, ∀
, we have
(2)
(2) As
for each
, ∃
such that
for each
, in a contradiction with (Equation1
(1)
(1) ).
Theorem 3.6
Let is a w-preinvex function on X, where X is any non-empty w-invex subset of
. Any strict local minimum point is thus a strict global minimum point.
Proof.
The proof can be achieved on similar lines as of Theorem 3.5.
Theorem 3.7
If is w-preinvex on the w-invex set X, where X is any non-empty w-invex subset of
, then also kh is w-preinvex w.r.t. η and w, for any k>0.
Proof.
Since h is a w-preinvex function then, we have ∀ and
we have, for any k>0,
from which
Theorem 3.8
Let X be a non-empty w-invex subset of and
,
be w-preinvex w.r.t. same η and w. Then,
is w-preinvex w.r.t. same η and w, where
,
Proof.
By hypothesis we have
It follows that
And
Thus, we achieve the proof.
Theorem 3.9
Let be a w-preinvex w.r.t. η and w, where X is any non-empty w-invex subset of
, let
be an increasing and convex. Then
is w-preinvex w.r.t. η and w.
Proof.
As h is w-preinvex w.r.t. η and w, we obtain ∀,
Due to the fact that
non-decreasing and convex, we obtain
or
Definition 3.1
Let X is any non-empty w-invex subset of .
is said to be w-pre pseudo-invex function if ∃ functions η, w and a function b, positive on domain, such that
for every
and
.
Theorem 3.10
Let X be a non-empty w-invex subset of . If h is w-preinvex, then h is w-pre pseudo-invex w.r.t. the same η and w.
Proof.
For , for every
we can write
where
Theorem 3.11
Let is a w-pre pseudo-invex function, where X is any non-empty w-invex subset of
. Consequently, any local minimum point is also a global minimum point.
Proof.
Let us assume irrationally that be a local minimum point rather than a global one. Then ∃
such that
According to the w-pre pseudo-invexity definition, which means that, we have ∃
, such that, ∀
,
from which
, ∀
is contradiction with the assumption.
Theorem 3.12
Assume that whenever
. Let h be a w-prequasi-invex function on X w.r.t. η and w, where X is any non-empty w-invex subset of
. Consequently, any strict local minimum point is h also a strict global minimum point.
Proof.
Contrarily suppose that be strict local minimum but not global; then ∃
s.t.,
Since h is w-pre quasi-invex, we have
a contradiction.
Theorem 3.13
Let be a w-prequasi-invex function w.r.t. η, where X is any non-empty w-invex subset of
and w. Suppose that
is a increasing function, then,
is w-prequasi-invex w.r.t. η and w.
Proof.
Given that h is w-prequasi-invex function and ϕ is a increasing, we obtain
which expresses the fact that the composition function
is w-prequasi-invex.
4. Optimality
Let and
,
are w-preinvex functions on
. A w-preinvex programming problem is formulated as follows:
(3)
(3)
Theorem 4.1
If is w-strictly preinvex function on X, where X is any non-empty w-invex subset of
, then the global optimal solution of problem (Equation3
(3)
(3) ) is unique.
Proof.
Let be different global optimal solutions of problem (Equation3
(3)
(3) ). Then
. Since h is w-strictly invex then, we have
This contradicts the optimality of
for problem (Equation3
(3)
(3) ). Hence, the global optimal solution of problem (Equation3
(3)
(3) ) is unique.
Theorem 4.2
Let be w-prequasi-invex function on X, where X is any non-empty w-invex subset of
and let
. The set
of optimal solution of problem (Equation3
(3)
(3) ) is w-invex set. If h is w-strictly prequasi-invex, then the set Y is a singleton.
Proof.
Let be different global optimal solutions of problem (Equation3
(3)
(3) ). Then
Since
be w-prequasi-invex function on X, then
which implies that
so Y is w-invex set.
For the other part, on contrary let ,
then
Further, since h is w-strictly prequasi invexity function on X, we have
This contradicts that
and hence the results follows.
Theorem 4.3
Consider the function is w-prequasi-invex on a w-invex subset of
. Suppose
. Then, the optimal solutions of problem (Equation3
(3)
(3) ) i.e.
is a w-invex set. If h is w-strictly prequasi-invex on a w-invex subset of
. Then w-invex set a singleton set.
Proof.
Let and
, then
also
,
. As h is w-prequasi-invex function on w-invex set, we have
and
which shows that
it demonstrate that w-invex set.
For the other part, suppose to the contrary that , and
,
, we get
As h is w-strictly prequasi-invex on X, we get
there is a contradiction.
Theorem 4.4
Let X be a non-empty w-invex subset of , and let
be w-strictly prequasi-invex function on X. Also, the inequality
holds for all
, then the problem (Equation3
(3)
(3) ) has an optimal solution.
Proof.
As h is w-preinvex w.r.t. η and w, we obtain ∀,
(4)
(4) Also, given that
(5)
(5) Combining the inequalities (Equation4
(4)
(4) ) and (Equation5
(5)
(5) ), we have
so
Hence, the problem (Equation3
(3)
(3) ) has an optimal solution of h.
Theorem 4.5
Let X be a non-empty w-invex subset of w.r.t. η and w, and let
be w-semi-strictly prequasi-invex function for the same η and w. If
is a local optimal solution to the problem of minimizing
subject to
, then
is a global minimum.
Proof.
Suppose that is a local minimum. Then, there is an ϵ-neighbourhood
around
such that
(6)
(6) If
is not a global minimum of h, then there exists an
such that
(7)
(7) By the w-semi-strictly preinvexity of h, and using (Equation7
(7)
(7) ), we have
for all
For a sufficiently small
, it follows that
which is a contradiction to (Equation6
(6)
(6) ). This completes the proof.
Example 4.1
Suppose a company manufactures a product using labour and raw materials. The company aims to minimize its total product cost while adhering to constraints on labour and raw material availability.
The cost function for producing product A is as follows: The cost function for producing product A is given by where h taken as a w-preinvex function. The company faces the following constraints on labour and raw materials. Maximum of 150 units of the sum of raw and labour available
.
5. Conclusion
In this paper, we have introduced the w-invex set, w-preinvex, w-prequasi-invex, and w-semi-strictly prequasi-invex functions, which are generalization of the invex set, preinvex, prequasi-invex, and semi-strictly prequasi-invex functions, respectively. We give some interesting results in this context. Also, we developed some fruitful examples to illustrate these concepts. In the last, the application of these functions in solving an optimization problem is also given in the paper.
Disclosure statement
No potential conflict of interest was reported by the author(s).
References
- Hanson MA. On sufficiency of the Kuhn-Tucker conditions. J Math Anal Appl. 1981;80(2):545–550. doi: 10.1016/0022-247X(81)90123-2
- Zalmai GJ. Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities. J Math Anal Appl. 1990;153(2):331–355. doi: 10.1016/0022-247X(90)90217-4
- Yang XM, Li D. Semistrictly preinvex functions. J Math Anal Appl. 2001;258(1):287–308. doi: 10.1006/jmaa.2000.7382
- Rapcsak T. Geodesic convexity in nonlinear optimization. Optim Theory Appl. 1999;69(1):169–183. doi: 10.1007/BF00940467
- Udriste C. Convex functions and optimization methods on Riemannian manifolds. Vol. 297. Springer Science and Business Media Dordrecht; 2013.
- Pini R. Convexity along curves and invexity. Optimization. 1994;29(4):301–309. doi: 10.1080/02331939408843959
- Mititelu S. Generalized invexity and vector optimization on differentiable manifolds. Differ Geom Dyn Syst. 2001;3:21–31.
- Ferrara M, Mititelu S. Mond-Weir duality in vector programming with generalized invex functions on differentiable manifolds. Balkan J Geomet Appl. 2006;11(2):80–87.
- Jeyakumar V. Convexlike alternative theorems and mathematical programming. Optimization. 1985;16(5):643–652. doi: 10.1080/02331938508843061
- Singh A, Suneja SK, Rueda NG. Preinvexity in multiobjective fractional programming. J Inform Optim Sci. 1992;13(2):293–302.
- Caristi G, Ferrara M, Stefanescu A. Semi-infinite multiobjective programming with generalized invexity. Math Reports. 2010;62:217–233.
- Butt SI, Budak H, Tariq M, et al. Integral inequalities for n–polynomial s-type preinvex functions with applications. Math Methods Appl Sci. 2021;44(14):11006–11021. doi: 10.1002/mma.7465
- Noor MA, Noor KI. New classes of preinvex functions and variational-like inequalities. Filomat. 2021;35(6):2081–2097. doi: 10.2298/FIL2106081N
- Kiliçman A, Saleh W. Generalized preinvex functions and their applications. Symmetry. 2018;10(10):493. doi: 10.3390/sym10100493
- Ali M, Akhter E. X-convexity and applications of quasi-X-convex functions. arXiv preprint arXiv:2208.06589.2022.
- Ansari QH, Lalitha CS, Mehta M. Generalized convexity, nonsmooth variational inequalities, and nonsmooth optimization. CRC Press New York ; 2013.
- Asadi M. Hermite-Hadamard (HH) integral inequality for M, Q pre-invex function. Intell Multimed Process Commun Syst (IMPCS). 2023;4(1):11–6.
- Das K, Nahak C. Sufficiency and duality in set-valued optimization problems under (p,r)−ρ−(η,θ)-invexity. Acta Univ Apulensis. 2020;62:93–110.
- Dubey R, Mishra VN. New type of G-Mond-Weir type primal-dual model and their duality results with generalized assumptions. Filomat. 2021;35(9):2869–2882. doi: 10.2298/FIL2109869D
- Joshi BC. Mathematical programs with vanishing constraints involving strongly invex functions. Numer Algorithms. 2022; 91(2):505–530.
- Noor MA, Noor KI. Properties of higher order preinvex functions. Numer Algebra Control Optim. 2021;11(3):431. doi: 10.3934/naco.2020035
- Reddy LV, Singh A, Pandey SP. Generalized invexity and semi-continuity in mathematical programming. Int J Appl Eng Res. 2019;14(12):2960–2967.
- Sial IB, Ali MA, Murtaza G, et al. On some new inequalities of Hermite–Hadamard midpoint and trapezoid type for preinvex functions in p, q-Calculus. Symmetry. 2021;13(10):1864. doi: 10.3390/sym13101864
- Tariq M, Sahoo SK, Jarad F, et al. Some integral inequalities for generalized preinvex functions with applications. AIMS Math. 2021;6(12):13907–13930. doi: 10.3934/math.2021805
- Yang XM, Yang XQ, Teo KL. Characterizations and applications of prequasi-invex functions. J Optim Theory Appl. 2001;110(3):645–668. doi: 10.1023/A:1017544513305
- Za˘linescu C. A critical view on invexity. J Optim Theory Appl. 2014;162(3):695–704. doi: 10.1007/s10957-013-0506-2
- Weir T, Jeyakumar V. A class of nonconvex functions and mathematical programming. Bull Aust Math Soc. 1988;38(2):177–89. doi: 10.1017/S0004972700027441
- Weir T, Mond B. Preinvex functions in multiple objective optimization. J Math Anal Appl. 1988;136(1):29–38. doi: 10.1016/0022-247X(88)90113-8
- Pini R. Invexity and generalized convexity. Optimization. 1991;22(4):513–525. doi: 10.1080/02331939108843693