Duality for nonsmooth continuous-time problems of vector optimization
From MaRDI portal
Publication:1956469
DOI10.1007/s10957-007-9301-2zbMath1194.90089MaRDI QIDQ1956469
Mohamad R. Pouryayevali, Soghra Nobakhtian
Publication date: 22 September 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-007-9301-2
nonsmooth analysis; vector optimization problems; duality; efficient solutions; continuous-time programming
90C29: Multi-objective and goal programming
90C46: Optimality conditions and duality in mathematical programming
Related Items
Continuous-time linear programming problems revisited: A perturbation approach, New optimality criteria for convex continuous-time problems of vector optimization, Using the parametric approach to solve the continuous-time linear fractional Max-min problems, Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems, Vector continuous-time programming without differentiability, Optimality conditions and duality for continuous-time programming with multiple interval-valued objective functions, Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions, Optimality conditions and duality for nonsmooth fractional continuous-time problems, KKT Optimality Conditions and Nonsmooth Continuous Time Optimization Problems
Cites Work
- Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
- Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
- Optimality conditions and duality in continuous programming. II: The linear problem revisited
- Continuous time programming with nonlinear constraints
- Proper efficiency conditions and duality models for a class of nonsmooth continuous-time multiobjective fractional programming problems
- Optimality criteria for nonsmooth continuous-time problems of multiobjective optimization
- Duality for a Class of Infinite Programming Problems
- Bottleneck Problems and Dynamic Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item