• East Asian mathematical journal
• /
• v.32 no.5
• /
• pp.635-639
• /
• 2016

In this paper, we prove a sufficient optimality theorems for the problem(FP) under(V, ${\rho}$)-invexity assumption. And we give Mond-Weir type dual problem and proved weak and strong duality theorem under (V, ${\rho}$)-invexity

• East Asian mathematical journal
• /
• v.33 no.3
• /
• pp.265-269
• /
• 2017

In this paper, we formulate a sufficient optimality theorem for the robust optimization problem (UP) under (V, ${\rho}$)-invexity assumption. Moreover, we formulate a Mond-Weir type dual problem for the robust optimization problem (UP) and show that the weak and strong duality hold between the primal problems and the dual problems.

• Journal of applied mathematics & informatics
• /
• v.24 no.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
• /
• v.25 no.1_2
• /
• pp.85-107
• /
• 2007

In this paper, we develop a fairly large number of sets of global semiparametric sufficient efficiency conditions under various generalized (${\theta},{\eta},{\rho}$)-V-invexity assumptions for a multiobjective fractional programming problem involving arbitrary norms.

• Journal of applied mathematics & informatics
• /
• v.28 no.5_6
• /
• pp.1535-1544
• /
• 2010

Sufficient optimality conditions for a class of generalized non-differentiable fractional optimization programming problems are established. Moreover, we prove the weak and strong duality theorems under (V, $\rho$)-invexity assumption.

• Journal of applied mathematics & informatics
• /
• v.23 no.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
• /
• v.27 no.3_4
• /
• pp.685-692
• /
• 2009

We consider the linearized (approximated) problem for differentiable vector optimization problem, and then we establish equivalence results between a differentiable vector optimization problem and its associated linearized problem under the proper efficiency.