Global Parametric Sufficient Optimality Conditions for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized （η,ρ）-invex Functions

In this paper,we discuss a large number of sets of global parametric sufficient optimality condi-tions under various gcneralized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programmingproblem.     

Parametric Duality Models for Semiinfinite Multiobjective Fractional Programming Problems Containing Generalized （α,η,ρ）-V-Invex Functions

In this paper, we present several parametric duality results under various generalized ( α,η,ρ )-V- invexity assumptions for a semiinfinite multiobjective fractional programming problem.     

Global Parametric Sufficient Efficiency Conditions for Semiinfinite Multiobjective Fractional Programming Problems Containing Generalized （a,n,p）-V-Invex Functions

In this paper, we discuss numerous sets of global parametric sufficient efficiency conditions under various generalized (α, η, ρ)-V-invexity assumptions for a semiinfinite multiobjective fractional programming problem.     

Optimality conditions and Lagrangian duality in continuous-time nonlinear programming

Using a perturbation approach, the Kuhn-Tucker saddlepoint and stationary-point optimality conditions and a Lagrangian duality theory are established for a general class of continuous-time nonlinear programming problems. It is shown that most of the duality formulations in the existing literature of continuous programming are special cases of this Lagrangian formulation.     

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.     

The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming

First-order stationary-point necessary optimality criteria of both the Fritz John and Kuhn-Tucker type are established for continuous-time nonlinear programming problems. Furthermore, the relationship between these criteria and saddlepoint optimality conditions is also discussed. The main auxiliary result employed in the derivation of the principal optimality criteria is a continuous-time version of Gordan's transposition theorem.     

Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions

In this paper we present four sets of saddle-point-type optimality conditions, construct two Lagrangian-type dual problems, and prove weak and strong duality theorems for a discrete minmax fractional subset programming problem. We establish these optimality and duality results under appropriate (b,?,ρ,θ)-convexity hypotheses.     

Generalized (η,ρ)-Invex Functions and Global Semiparametric Sufficient Efficiency Conditions for Multiobjective Fractional Programming Problems Containing Arbitrary Norms

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

Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions

In this paper, we establish a set of necessary optimality conditions and discuss a fairly large number of sets of global nonparametric sufficient optimality criteria under various generalized (η, ρ)-invexity assumptions for a minmax fractional programming problem with infinitely many nonlinear inequality and equality constraints.     

Semiparametric Sufficient Efficiency Conditions and Duality Models for Multiobjective Fractional Subset Programming Problems with Generalized (Ф, ρ, θ)-Convex Functions

In this paper, we present a multitude of global semiparametric sufficient efficiency and duality results under generalized (, , )-convexity assumptions for a multiobjective fractional subset programming problem.