Continuous-time multiobjective optimization problems via invexity
From MaRDI portal
Publication:2472061
DOI10.1155/2007/61296zbMath1180.90286OpenAlexW2037662999MaRDI QIDQ2472061
Valeriano Antunes de Oliveira, Marko A. Rojas-Medar
Publication date: 20 February 2008
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/45141
Related Items (10)
On sufficient optimality conditions for multiobjective control problems ⋮ A constant rank constraint qualification in continuous-time nonlinear programming ⋮ KT-invexity in optimal control problems ⋮ New optimality criteria for convex continuous-time problems of vector optimization ⋮ New optimality conditions for nonsmooth control problems ⋮ Theorems of the alternative for systems of convex inequalities ⋮ Vector continuous-time programming without differentiability ⋮ The continuous-time problem with interval-valued functions: applications to economic equilibrium ⋮ KKT Optimality Conditions and Nonsmooth Continuous Time Optimization Problems ⋮ Optimality in continuous-time multiobjective optimization and vector variational-like inequalities
Cites Work
- Unnamed Item
- Continuous-time optimization problems involving invex functions
- Sufficient optimality conditions in continuous-time nonlinear programming
- A continuous-time generalization of Gordan's transposition theorem
- Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
- The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming
- Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
- Invex functions and generalized convexity in multiobjective programming
- Nonsmooth continuous-time optimization problems: Sufficient conditions
- A class of continuous linear programming problems
- Continuous programming. I: Linear objectives
- An Algorithm for a Class of Continuous Linear Programs
- On the Solutions of a Class of Continuous Linear Programs
- Bottleneck Problems and Dynamic Programming
- Generalized convexity in multiobjective programming
- Nonsmooth continuous-time optimization problems: Necessary conditions
This page was built for publication: Continuous-time multiobjective optimization problems via invexity