• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.105-126
• /
• 2007

The purpose of this paper is to construct several parametric duality models and prove appropriate duality results under various generalized (${\theta},{\eta},{\rho}$)-V-invexity assumptions for a discrete minmax fractional programming problem involving arbitrary norms.

• Journal of applied mathematics & informatics
• /
• 제23권1_2호
• /
• pp.1-23
• /
• 2007

The purpose of this paper is to develop a fairly large number of sets of global parametric sufficient optimality conditions under various generalized $({\theta},\;{\eta},\;{\rho})-V-invexity$ assumptions for a discrete minmax fractional programming problem involving arbitrary norms.

• Journal of applied mathematics & informatics
• /
• 제26권5_6호
• /
• pp.991-1010
• /
• 2008

A discrete minmax fractional subset programming problem is considered. Various parametric and parameter-free global sufficient optimality conditions and duality results are discussed under generalized ($F,{\alpha},{\rho},{\theta}$)-V-type-I n-set functions.

• 대한수학회지
• /
• 제41권5호
• /
• pp.821-864
• /
• 2004

Both parametric and parameter-free necessary and sufficient optimality conditions are established for a class of nondiffer-entiable nonconvex optimal control problems with generalized fractional objective functions, linear dynamics, and nonlinear inequality constraints on both the state and control variables. Based on these optimality results, ten Wolfe-type parametric and parameter-free duality models are formulated and weak, strong, and strict converse duality theorems are proved. These duality results contain, as special cases, similar results for minmax fractional optimal control problems involving square roots of positive semi definite quadratic forms, and for optimal control problems with fractional, discrete max, and conventional objective functions, which are particular cases of the main problem considered in this paper. The duality models presented here contain various extensions of a number of existing duality formulations for convex control problems, and subsume continuous-time generalizations of a great variety of similar dual problems investigated previously in the area of finite-dimensional nonlinear programming.