Optimality and duality for variational problems with generalized convexity
From MaRDI portal
The concept of ``type 1 invexity, and its pseudo and quasi generalizations, are formulated for a class of continuous programming problems, involving a state function and its derivative. Sufficient optimality conditions, and Mond-Weir duality, are thus proved, also for a class of fractional continuous programming problems.
Recommendations
- Generalized type I invexity and duality in multiobjective variational problems
- Duality for variational problems with invexity
- Sufficient optimality criteria and duality for variational problems with generalised invexity
- Generalized continuous nondifferentiable fractional programming problems with invexity
- MULTIOBJECTIVE VARIATIONAL PROGRAMMING UNDER GENERALIZED VECTOR VARIATIONAL TYPE I INVEXITY
Cited in
(8)- Duality for variational problems with invexity
- On variational problems: characterization of solutions and duality
- Sufficient conditions of optimality for convex differential inclusions of elliptic type and duality
- scientific article; zbMATH DE number 4213344 (Why is no real title available?)
- scientific article; zbMATH DE number 5370877 (Why is no real title available?)
- scientific article; zbMATH DE number 522746 (Why is no real title available?)
- Sufficient optimality criteria and duality for variational problems with generalised invexity
- Application of continuous-time programming problems to a class of variational-type inequalities
This page was built for publication: Optimality and duality for variational problems with generalized convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386803)
