Generalized pseudo univexity and duality in mathematical programming

MaRDI QIDQ5939124zbMATH OpenFDO

Authors L. Venkateswara Reddy, R. N. Mukherjee

Publication date 30 July 2002

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

closed convex conesduality theoremspseudo-univexityquasi-univexity

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Review text

The authors consider the following problem: minimize \(f(x)\) subject to \(x\in C_1\) and \(g(x) \in C^*_2\), where \(C_1\subseteq \mathbb{R}^n\) and \(C_2\subseteq \mathbb{R}^m\) are closed convex cones with nonempty interiors, while \(f:C_1 \to\mathbb{R}\) and \(g:C_1 \to\mathbb{R}^m\). By using pseudo-univexity and quasi-univexity conditions they derive weak, strong and converse duality theorems concerning four dual problems associated with this problem.

Recommendations

• On duality with generalized convexity
• Duality in mathematical programming under -univexity
• Wolfe-type duality involving univex functions for a minimax programming problem
• Generalized invexity and duality in multiobjective nonlinear programming.
• scientific article; zbMATH DE number 20895

Cited in

(4)

• Generalized V-univexity type-I for multiobjective programming with n-set functions
• scientific article; zbMATH DE number 3959144 (Why is no real title available?)
• Matrice pseudo-inverse de Moore-Penrose et variables duales généralisées en programmation mathématique
• Duality in generalized homogeneous programming

This page was built for publication: Generalized pseudo univexity and duality in mathematical programming

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