Generalized Lagrange function and generalized weak saddle points for a class of multiobjective fractional optimal control problems
From MaRDI portal
Publication:1937081
DOI10.1007/s10957-012-0007-8zbMath1277.90123OpenAlexW1967671736MaRDI QIDQ1937081
Panos M. Pardalos, Neng Fan, Haijun Liu
Publication date: 11 February 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0007-8
Multi-objective and goal programming (90C29) Fractional programming (90C32) Optimality conditions for problems involving ordinary differential equations (49K15)
Related Items
A practical nonlinear dynamic framework for solving a class of fractional programming problems, Max-min distance nonnegative matrix factorization
Cites Work
- Unnamed Item
- Unnamed Item
- The saddle theorem for multiobjective generalized fractional programming problems with set functions
- Theory of multiobjective optimization
- Duality and sufficiency in control problems with invexity
- Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions
- Lagrange multipliers and saddle points in multiobjective programming
- Optimality conditions and duality models for a class of nonsmooth constrained fractional optimal control problems
- Efficiency conditions and duality for a class of multiobjective fractional programming problems
- Multiobjective control approximation problems: duality and optimality.
- Saddle point and generalized convex duality for multiobjective programming.
- Asymptotic behavior of trigonometric series with \(O\)-regularly varying quasimonotone coefficients. II
- Optimality and duality for a class of nondifferentiable multiobjective fractional programming problems
- Reciprocal optimal control problems and the associated Pareto frontier
- A novel approach for nonconvex optimal control problems
- Two types of duality in multiobjective fractional programming
- Optimality conditions and duality for a class of nonlinear fractional programming problems.