Proper efficiency and duality for a class of constrained multiobjective fractional optimal control problems containing arbitrary norms

We establish necessary and sufficient conditions for properly efficient solutions of a class of nonsmooth nonconvex optimal control problems with multiple fractional objective functions, linear dynamics, and nonlinear inequality constraints on both the state and control variables. Subsequently, we utilize these proper efficiency criteria to construct two multiobjective dual problems and prove appropriate duality theorems. Also, we specialize and discuss these results for a particular case of our principal problem which contains square roots of positivesemidefinite quadratic forms. As special cases of the main proper efficiency and duality results, this paper also contains similar results for control problems with multiple, fractional, and ordinary objective functions.     

Semiparametric sufficient efficiency conditions for multiobjective fractional programming problems containing arbitrary norms

In this paper, we develop a fairly large number of sets of global semiparametric sufficient efficiency conditions under various generalized(θ, η, ρ)-V-invexity assumptions for a multiobjective fractional programming problem involving arbitrary norms.     

Proper efficiency and duality for a class of multiobjective fractional variational problems containing arbitrary norms

Necessary and sufficient conditions are established for properly efficient solutions of a class of nonsmooth nonconvex variational problems with multiple fractional objective functions and nonlinear inequality constraints. Based on these proper efficiency criteria. two multiobjective dual problems are constructed and appropriate duality theorems are proved. These proper efficiency and duality results also contain as special cases similar rcsults fer constrained variational problems with multiplei fractional. and conventional objective functions, which are particular cases of the main variational problem considered in this paper     

Symmetric duality for invex multiobjective fractional variational problems

We introduce a symmetric dual for multiobjective fractional variational problems. Under certain invexity assumptions we establish weak, strong and converse duality theorems as well as self-duality relations. The paper includes an extension of previous symmetric duality results for the static case obtained by Weir to the dynamic case.     

Parametric duality models for discrete minmax fractional programming problems containing generalized (θ,η,ρ)-V- invex functions and arbitrary norms

The purpose of this paper is to construct several parametric duality models and prove appropriate duality results under various generalized (θ,η,ρ)-V-invexity assumptions for a discrete minmax fractional programming problem involving arbitrary norms.     

Symmetric duality for a class of multiobjective fractional programming problems

This paper is concerned with symmetric duality for a class of nondifferentiable multiobjective fractional programming problems. Two weak duality theorems and two strong duality theorems are proved. Discussion on some special cases shows that results in this paper extend previous work in this area.     

一类多目标广义分式规划问题的最优性条件和对偶

研究了一类不可微多目标广义分式规划问题．首先,在广义Abadie约束品性条件下,给出了其真有效解的Kuhn—Tucker型必要条件．随后,在（C,a,P,d）一凸性假设下给出其真有效解的充分条件．最后,在此基础上建立了一种对偶模型,证明了对偶定理．得到的结果改进了相关文献中的相应结论．     

On efficiency and mixed duality for a new class of nonconvex multiobjective variational control problems

In this paper, we extend the notions of \((\Phi ,\rho )\) -invexity and generalized \((\Phi ,\rho )\) -invexity to the continuous case and we use these concepts to establish sufficient optimality conditions for the considered class of nonconvex multiobjective variational control problems. Further, multiobjective variational control mixed dual problem is given for the considered multiobjective variational control problem and several mixed duality results are established under \((\Phi ,\rho )\) -invexity.     

B‐spline spectral method for constrained fractional optimal control problems

In this paper, we present a direct B‐spline spectral collocation method to approximate the solutions of fractional optimal control problems with inequality constraints. We use the location of the maximum of B‐spline functions as collocation points, which leads to sparse and nonsingular matrix B whose entries are the values of B‐spline functions at the collocation points. In this method, both the control and Caputo fractional derivative of the state are approximated by B‐spline functions. The fractional integral of these functions is computed by the Cox‐de Boor recursion formula. The convergence of the method is investigated. Several numerical examples are considered to indicate the efficiency of the method.     

Optimality conditions and duality for a class of nondifferentiable multiobjective generalized fractional programming problems

This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators are the difference of differentiable function and convex function. Under the assumption of Calmness Constraint Qualification the Kuhn-Tucker type necessary conditions for efficient solution are given, and the Kuhn-Tucker type sufficient conditions for efficient solution are presented under the assumptions of （F, α, ρ, d）-V-convexity. Subsequently, the optimality conditions for two kinds of duality models are formulated and duality theorems are proved.     

Duality for multiobjective fractional control problems with generalized invexity

Wolfe and Mond-Weir type duals for multiobjective control problems are formulated. Under pseudo-invexity/quasi-invexity assumptions on the functions involved, weak and strong duality theorems are proved to relate efficient solutions of the primal and dual problems.     

Pseudoinvexity,optimality conditions and efficiency in multiobjective problems; duality

In this paper, we establish characterizations for efficient solutions to multiobjective programming problems, which generalize the characterization of established results for optimal solutions to scalar programming problems. So, we prove that in order for Kuhn–Tucker points to be efficient solutions it is necessary and sufficient that the multiobjective problem functions belong to a new class of functions, which we introduce. Similarly, we obtain characterizations for efficient solutions by using Fritz–John optimality conditions. Some examples are proposed to illustrate these classes of functions and optimality results. We study the dual problem and establish weak, strong and converse duality results.     

Optimality and duality for proper and isolated efficiencies in multiobjective optimization

We use some advanced tools of variational analysis and generalized differentiation such as the nonsmooth version of Fermat’s rule, the limiting/Mordukhovich subdifferential of maximum functions, and the sum rules for the Fréchet subdifferential and for the limiting one to establish necessary conditions for (local) properly efficient solutions and (local) isolated minimizers of a multiobjective optimization problem involving inequality and equality constraints. Sufficient conditions for the existence of such solutions are also provided under assumptions of (local) convex/affine functions or $L$-invex-infine functions defined in terms of the limiting subdifferential of locally Lipschitz functions. In addition, we propose a type of Wolfe dual problems and examine weak/strong duality relations under $L$-invexity-infineness hypotheses.     

Optimality and duality for nondifferentiable multiobjective variational problems

The concept of efficiency is used to formulate duality for nondifferentiable multiobjective variational problems. Wolfe and Mond-Weir type vector dual problems are formulated. By using the generalized Schwarz inequality and a characterization of efficient solution, we established the weak, strong, and converse duality theorems under generalized (F,ρ)-convexity assumptions.     

Achieving optimal convergence order for FEM in control constrained optimal control problems

We propose a new heuristic approach to overcome convergence order restrictions implied by the low regularity of the optimal control due to the activity interface of control constraints. Aligning the mesh with the interface yields an improved approximation of the control. Utility of the approach is demonstrated by numerical experiments. (© 2015 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A multigrid method for constrained optimal control problems

We consider the fast and efficient numerical solution of linear-quadratic optimal control problems with additional constraints on the control. Discretization of the first-order conditions leads to an indefinite linear system of saddle point type with additional complementarity conditions due to the control constraints. The complementarity conditions are treated by a primal-dual active set strategy that serves as outer iteration. At each iteration step, a KKT system has to be solved. Here, we develop a multigrid method for its fast solution. To this end, we use a smoother which is based on an inexact constraint preconditioner.We present numerical results which show that the proposed multigrid method possesses convergence rates of the same order as for the underlying (elliptic) PDE problem. Furthermore, when combined with a nested iteration, the solver is of optimal complexity and achieves the solution of the optimization problem at only a small multiple of the cost for the PDE solution.     

Legendre wavelets method for constrained optimal control problems

A numerical method for solving non‐linear optimal control problems with inequality constraints is presented in this paper. The method is based upon Legendre wavelet approximations. The properties of Legendre wavelets are first presented. The operational matrix of integration and the Gauss method are then utilized to reduce the optimal control problem to the solution of algebraic equations. The inequality constraints are converted to a system of algebraic equalities; these equalities are then collocated at the Gauss nodes. Illustrative examples are included to demonstrate the validity and applicability of the technique. Copyright © 2002 John Wiley & Sons, Ltd.     

Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints

We consider nonsmooth multiobjective fractional programming problems with inequality and equality constraints. We establish the necessary and sufficient optimality conditions under various generalized invexity assumptions. In addition, we formulate a mixed dual problem corresponding to primal problem, and discuss weak, strong and strict converse duality theorems. This research was partially supported by Project no. 850203 and Center of Excellence for Mathematics, University of Isfahan, Iran.     

非凸分式优化问题的最优性充分条件和对偶

通过引入广义弧连通概念,在Rn空间中,研究极大极小非凸分式规划问题的最优性充分条件及其对偶问题.首先获得了极大极小非凸分式规划问题的最优性充分条件;然后建立分式规划问题的一个对偶模型并得到了弱对偶定理,强对偶定理和逆对偶定理.