Vector continuous-time programming without differentiability
From MaRDI portal
Publication:966105
DOI10.1016/j.cam.2010.02.012zbMath1198.90354OpenAlexW2054206706MaRDI QIDQ966105
Publication date: 27 April 2010
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2010.02.012
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items
New optimality criteria for convex continuous-time problems of vector optimization ⋮ Theorems of the alternative for systems of convex inequalities ⋮ Motzkin's theorem of the alternative: a continuous-time generalization ⋮ Optimality conditions in a vector continuous-time optimization problem ⋮ Optimality conditions and duality for continuous-time programming with multiple interval-valued objective functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proper efficiency in vector infinite programming problems
- Continuous-time optimization problems involving invex functions
- On duality theory in multiobjective programming
- 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
- Pre-invex functions in multiple objective optimization
- Continuous time programming with nonlinear constraints
- Saddle-point optimality criteria of continuous time programming without differentiability
- Nonsmooth continuous-time optimization problems: Sufficient conditions
- Proper efficiency conditions and duality models for a class of nonsmooth continuous-time multiobjective fractional programming problems
- Preinvex functions and weak efficient solutions for some vectorial optimization problem in Banach spaces
- Optimality criteria for nonsmooth continuous-time problems of multiobjective optimization
- Duality for nonsmooth continuous-time problems of vector optimization
- Continuous-time multiobjective optimization problems via invexity
- Proper efficiency and the theory of vector maximization
- A class of continuous convex programming problems
- Invexity and generalized convexity
- A class of nonconvex functions and mathematical programming
- Convex Transformable Programming Problems and Invexity
- OPTIMALITY CONDITIONS AND DUALITY MODELS FOR A CLASS OF NONSMOOTH CONTINUOUS-TIME GENERALIZED FRACTIONAL PROGRAMMING PROBLEMS
- A Duality Theorem for a Class of Continuous Linear Programming Problems
- Duality for a Class of Infinite Programming Problems
- Bottleneck Problems and Dynamic Programming
- Duality in nondifferentiable vector programming
- Nonsmooth continuous-time optimization problems: Necessary conditions
