Javascript must be enabled to continue!
Optimality Conditions for Multiobjective Programming under Generalized Uniform (V, η)-type I Symmetrical Invexity
View through CrossRef
Abstract
Multi-objective optimization is a major branch of the optimization category. On the basis of (V, η)-I symmetric invariant convex functions, the concept of generalized uniform (V, η)-I symmetric invariant convex function is proposed. Which is generalized uniform (V, η)-I type. Under the new generalized convexity hypothesis, several optimality sufficient conditions for multi-objective programming are proved.
Title: Optimality Conditions for Multiobjective Programming under Generalized Uniform (V, η)-type I Symmetrical Invexity
Description:
Abstract
Multi-objective optimization is a major branch of the optimization category.
On the basis of (V, η)-I symmetric invariant convex functions, the concept of generalized uniform (V, η)-I symmetric invariant convex function is proposed.
Which is generalized uniform (V, η)-I type.
Under the new generalized convexity hypothesis, several optimality sufficient conditions for multi-objective programming are proved.
Related Results
Trooping the (School) Colour
Trooping the (School) Colour
Introduction
Throughout the early and mid-twentieth century, cadet training was a feature of many secondary schools and educational establishments across Australia, with countless ...
Optimality and Duality for Multiobjective Semiinfinite Programming Problems Involving Generalized (C,α,η,ρ,d)-Invexity
Optimality and Duality for Multiobjective Semiinfinite Programming Problems Involving Generalized (C,α,η,ρ,d)-Invexity
In this paper, we formulate generalized (C,α,η,ρ,d)-invexity and based on these definitions, we derive several sufficient conditions for optimality in multiobjective semi-infinite ...
Robust Optimality and Duality for Nonsmooth Multiobjective Programming Problems with Vanishing Constraints under Data Uncertainty
Robust Optimality and Duality for Nonsmooth Multiobjective Programming Problems with Vanishing Constraints under Data Uncertainty
This article investigates robust optimality and duality for a class of nonsmooth multiobjective programming problems with vanishing constraints under data uncertainty (in short, UN...
Estimation of Parameters and Optimality of Second-Order Spherical Designs Using Quadratic Function Relative to Non-Spherical Face centered CCD
Estimation of Parameters and Optimality of Second-Order Spherical Designs Using Quadratic Function Relative to Non-Spherical Face centered CCD
The study presented the estimation of parameters and optimality of second-order spherical designs using quadratic model in comparison to the non-spherical face centered CCD for var...
The Collective Mind: An Experimental Analysis of Imitation and Self‑organization in Humans
The Collective Mind: An Experimental Analysis of Imitation and Self‑organization in Humans
I present an experimental paradigm to explore the interpersonal dynamics generating a collective mind. I hypothesized that collective organization is based on dual interpersonal mo...
The Collective Mind: An Experimental Analysis of Imitation and Self‑organization in Humans
The Collective Mind: An Experimental Analysis of Imitation and Self‑organization in Humans
I present an experimental paradigm to explore the interpersonal dynamics generating a collective mind. I hypothesized that collective organization is based on dual interpersonal mo...
Second Order Optimality Conditions in Vector Optimization Problems.
Second Order Optimality Conditions in Vector Optimization Problems.
We are interested in proving optimality conditions for optimization problems. By
means of different second-order tangent sets, various second-order necessary optimality
conditions ...
Programming model abstractions for optimizing I/O intensive applications
Programming model abstractions for optimizing I/O intensive applications
This thesis contributes from the perspective of task-based programming models to the efforts of optimizing I/O intensive applications. Throughout this thesis, we propose programmin...

