Continuous-time multiobjective optimization problems via invexity
From MaRDI portal
Summary: We introduce some concepts of generalized invexity for the continuous-time multiobjective programming problems, namely, the concepts of Karush-Kuhn-Tucker invexity and Karush-Kuhn-Tucker pseudoinvexity. Using the concept of Karush-Kuhn-Tucker invexity, we study the relationship of the multiobjective problems with some related scalar problems. Further, we show that Karush-Kuhn-Tucker pseudoinvexity is a necessary and sufficient condition for a vector Karush-Kuhn-Tucker solution to be a weakly efficient solution.
Recommendations
- Continuous-time optimization problems involving invex functions
- Optimality in continuous-time multiobjective optimization and vector variational-like inequalities
- Optimality conditions for (G,) invex multiobjective programming
- Nonsmooth multiobjective continuous-time problems with generalized invexity
- KKT optimality conditions and nonsmooth continuous time optimization problems
Cites work
- A class of continuous linear programming problems
- A continuous-time generalization of Gordan's transposition theorem
- An Algorithm for a Class of Continuous Linear Programs
- Bottleneck Problems and Dynamic Programming
- Continuous programming. I: Linear objectives
- Continuous-time optimization problems involving invex functions
- Generalized convexity in multiobjective programming
- Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
- scientific article; zbMATH DE number 734930 (Why is no real title available?)
- Invex functions and generalized convexity in multiobjective programming
- Nonsmooth continuous-time optimization problems: Necessary conditions
- Nonsmooth continuous-time optimization problems: Sufficient conditions
- On the Solutions of a Class of Continuous Linear Programs
- Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
- Sufficient optimality conditions in continuous-time nonlinear programming
- The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming
Cited in
(14)- Nonsmooth multiobjective continuous-time problems with generalized invexity
- Optimality in continuous-time multiobjective optimization and vector variational-like inequalities
- Revisiting norm optimization for multi-objective black-box problems: a finite-time analysis
- Theorems of the alternative for systems of convex inequalities
- On sufficient optimality conditions for multiobjective control problems
- KKT optimality conditions and nonsmooth continuous time optimization problems
- New optimality conditions for nonsmooth control problems
- Contiuous time inverse vector optimization problems
- New optimality criteria for convex continuous-time problems of vector optimization
- The continuous-time problem with interval-valued functions: applications to economic equilibrium
- A constant rank constraint qualification in continuous-time nonlinear programming
- KT-invexity in optimal control problems
- Continuous-time optimization problems involving invex functions
- Vector continuous-time programming without differentiability
This page was built for publication: Continuous-time multiobjective optimization problems via invexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2472061)
