Work

New Concepts of Generalized Convexity in Multiobjective Subset Programming

Year: 2025

Type: article

Abstract: In this paper, a new class of nonconvex differentiable multiobjective programming problems involving n-set functions with both inequality and equality constraints is considered.Then, under V-r-convexity and/or generalized V-r-convexity hypotheses, several sufficient optimality conditions, saddle point criteria and various mixed duality theorems are proved for such not necessarily convex vector optimization problems involving n-set functions.

Source: Iranian Journal of Mathematical Sciences and Informatics

DOI: 10.61186/ijmsi.20.1.205

Authors: Tadeusz Antczak, Izhar Ahmad

Institutions: University of Łódź, King Fahd University of Petroleum and Minerals

Language: English

Topic: Optimization and Variational Analysis

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

OpenAlex ID: W4410549986

FWCI:

Cites: 23

Cited by:

Related to: 10