New concepts of generalized convexity in multiobjective subset programming

MaRDI QIDQ6981148zbMATH OpenFDO

Authors Tadeusz Antczak, I. Ahmad

Publication date 21 May 2025

Published in Iranian Journal of Mathematical Sciences and Informatics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

zbMATH Keywords

mixed dualityoptimality conditionssaddle point criteriaV-r-convex \(n\)-set functionvector optimization problem with \(n\)-set functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)

Cites work

• A Partitioning Problem with Applications in Regional Design
• Application de la méthode des éléments finis à l'approximation d'un problème de domaine optimal. Méthodes de résolution des problèmes approches
• Duality for multiobjective \(B\)-vex programming involving \(n\)-set functions
• Duality for multiobjective programming involving n-set functions
• Generalized V-univexity type-I for multiobjective programming with n-set functions
• scientific article; zbMATH DE number 1664596 (Why is no real title available?)
• scientific article; zbMATH DE number 3856842 (Why is no real title available?)
• scientific article; zbMATH DE number 2159422 (Why is no real title available?)
• scientific article; zbMATH DE number 749232 (Why is no real title available?)
• scientific article; zbMATH DE number 1873051 (Why is no real title available?)
• scientific article; zbMATH DE number 1408318 (Why is no real title available?)
• scientific article; zbMATH DE number 2187936 (Why is no real title available?)
• Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions
• Multiobjective subset programming problems involving generalized d-type-I univex functions
• On duality of multiobjective fractional measurable subset selection problems
• On optimality and duality for multiobjective programming problems involving generalized d-type-I and related n-set functions.
• On the Fundamental Lemma of Neyman and Pearson
• On the optimality conditions of vector-valued n-set functions
• Optimal constrained selection of a measurable subset
• Optimality and duality for multiobjective fractional programming problems with n-set functions and generalized V-type-I univexity
• Optimality conditions and duality for multiobjective measurable subset selection problems
• Optimality conditions and duality for programming problems involving set andn-set functions : a survey
• Optimality of differentiable, vector-valued n-set functions
• Optimization theory for n-set functions
• r-convex functions
• Sufficiency criteria and duality for nonlinear programs involving n-set functions
• Sufficiency in multiobjective subset programming involving generalized type-I functions

This page was built for publication: New concepts of generalized convexity in multiobjective subset programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981148)