Duality for nonsmooth continuous-time problems of vector optimization

DOI10.1007/S10957-007-9301-2MaRDI QIDQ1956469zbMATH OpenOpenAlexFDO

Authors M. R. Pouryayevali, S. 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

zbMATH Keywords

continuous-time programmingdualityefficient solutionsnonsmooth analysisvector optimization problems

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Cites work

• Bottleneck Problems and Dynamic Programming
• Continuous time programming with nonlinear constraints
• Duality for a Class of Infinite Programming Problems
• Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
• scientific article; zbMATH DE number 4010155 (Why is no real title available?)
• scientific article; zbMATH DE number 1113627 (Why is no real title available?)
• Optimality conditions and duality in continuous programming. II: The linear problem revisited
• Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
• Optimality criteria for nonsmooth continuous-time problems of multiobjective optimization
• Optimization and nonsmooth analysis
• Proper efficiency conditions and duality models for a class of nonsmooth continuous-time multiobjective fractional programming problems

Cited in

(12)

• 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
• On duality for weakly minimized vector valued optimization problems
• Using the parametric approach to solve the continuous-time linear fractional Max-min problems
• Continuous-time linear programming problems revisited: a perturbation approach
• Optimality conditions and duality results for a new class of nonconvex nonsmooth vector optimization problems
• New optimality criteria for convex continuous-time problems of vector optimization
• Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
• Continuous time non-smooth optimization through quasi efficiency
• Vector continuous-time programming without differentiability

This page was built for publication: Duality for nonsmooth continuous-time problems of vector optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1956469)