Results 31 to 40 of about 565 (171)
Nonsmooth semi-infinite roughly B-invex multi-objective programming problems
Results in Control and Optimization, 2023 In this paper, we will study a nonsmooth semi-infinite multi-objective programming problem involving roughly B-invex functions. Sufficient optimality conditions for the primal problem are derived. We shall formulate Mond–Weir type dual and establish weak
Tarek Emam
doaj +1 more source
The Journal of the Australian Mathematical Society. Series B. Applied Mathematics, 1986 AbstractRecently it was shown that many results in Mathematical Programming involving convex functions actually hold for a wider class of functions, called invex. Here a simple characterization of invexity is given for both constrained and unconstrained problems.
Ben-Israel, A., Mond, B.
openaire +2 more sources
Results on the Existence of Solutions Associated with Some Weak Vector Variational Inequalities
Fractal and Fractional, 2022 In this paper, by considering the notions of the invex set, Fréchet differentiability, invexity and pseudoinvexity for the involved functionals of curvilinear integral type, we establish some relations between the solutions of a class of weak vector ...
Savin Treanţă
doaj +1 more source
Nondifferentiable generalized minimax fractional programming under (Ф,ρ)-invexity [PDF]
Yugoslav Journal of Operations Research, 2022 In this paper, a class of nonconvex nondifferentiable generalized minimax fractional programming problems is considered. Sufficient optimality conditions for the considered nondifferentiable generalized minimax fractional programming problem are ...
Upadhyay B.B. +3 more
doaj +1 more source
On nonsmooth mathematical programs with equilibrium constraints using generalized convexity [PDF]
Yugoslav Journal of Operations Research, 2019 In this paper, we derive the sufficient condition for global optimality for a nonsmooth mathematical program with equilibrium constraints involving generalized invexity.
Joshi Bhuwan Chandra +2 more
doaj +1 more source
CoRR, 2021 Connected decision boundaries are useful in several tasks like image segmentation, clustering, alpha-shape or defining a region in nD-space. However, the machine learning literature lacks methods for generating connected decision boundaries using neural networks.
Suman Sapkota, Binod Bhattarai
openaire +3 more sources
On local quasi efficient solutions for nonsmooth vector optimization problems
Croatian Operational Research Review, 2020 We are interested in local quasi efficient solutions for nonsmooth vector optimization problems under new generalized approximate invexity assumptions.
Mohsine Jennane +2 more
doaj +1 more source
Higher-Order Wolfe Type Symmetric Fractional Programming Problem Under Generalized Assumptions [PDF]
International Journal of Mathematical, Engineering and Management Sciences, 2022 The Wolfe-type model over arbitrary cones is a new sort of model that we introduce in this article. We defend duality theorems under more generalized higher-order assumptions in the section after this.
Rajnish Kumar +2 more
doaj +1 more source
On nonsmooth multiobjective fractional programming problems involving (p, r)− ρ −(η ,θ)- invex functions [PDF]
Yugoslav Journal of Operations Research, 2013 A class of multiobjective fractional programming problems (MFP) is considered where the involved functions are locally Lipschitz. In order to deduce our main results, we introduce the definition of (p,r)−ρ −(η,θ)-invex class about the Clarke ...
Jayswal Anurag +2 more
doaj +1 more source
Applied Mathematics Letters, 2009 This paper introduces a new condition on the functionals of a control problem and extends a recent characterization result of KT-invexity. We prove that the new condition, the FJinvexity, is both necessary and sufficient in order to characterize the optimal solution set using Fritz John points.
Manuel Arana-Jiménez +3 more
openaire +4 more sources