• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.281-292
• /
• 2007

A pair of symmetric fractional variational programming problems is formulated over cones. Weak, strong, converse and self duality theorems are discussed under pseudoinvexity. Static symmetric dual fractional programs are included as special case and corresponding symmetric duality results are merely stated.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.2
• /
• pp.405-423
• /
• 2023

Let (𝓛, 𝒜) be a complete duality pair. We give some equivalent characterizations of Gorenstein (𝓛, 𝒜)-projective modules and construct some model structures associated to duality pairs and Frobenius pairs. Some rings are described by Frobenius pairs. In addition, we investigate special Gorenstein (𝓛, 𝒜)-projective modules and construct some model structures and recollements associated to them.

• East Asian mathematical journal
• /
• v.5 no.2
• /
• pp.209-213
• /
• 1989

The efficiency(Pareto optimum) is a type of solutions for multiobjective programs. We formulate duality relations for multiobjective nonlinear programs by using the concept of efficiency. The results are the weak and strong duality relations for a vector dual of the Wolfe type involving invex functions.

• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.227-235
• /
• 2004

In this paper we consider the dual problems for multiobjective programming with generalized convex functions. We obtain the weak duality and the strong duality. At last, we give an equivalent relationship between saddle point and efficient solution in multiobjective programming.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.475-488
• /
• 1998

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

• East Asian mathematical journal
• /
• v.31 no.5
• /
• pp.737-742
• /
• 2015

In this paper, we consider a generalized fractional robust optimization problem (FP). Establishing a nonfractional optimization problem (NFP) equivalent to (FP), we establish necessary optimality conditions and duality results.

• Communications of the Korean Mathematical Society
• /
• v.28 no.3
• /
• pp.597-602
• /
• 2013

In this paper, Mond-Weir type duality results for a uncertain multiobjective robust optimization problem are given under generalized invexity assumptions. Also, weak vector saddle-point theorems are obtained under convexity assumptions.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.539-551
• /
• 2005

In this paper, sufficient optimality conditions and duality results for nonsmooth vector optimization problems are given under near invexity and infineness assumptions. Also, weak vector saddle-point theorems are obtained under near invexity-infineness assumptions.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.3
• /
• pp.465-475
• /
• 2016

We establish necessary and sufficient optimality conditions for a class of generalized nondifferentiable fractional optimization programming problems. Moreover, we prove the weak and strong duality theorems under (V, ${\rho}$)-invexity assumption.

• East Asian mathematical journal
• /
• v.31 no.3
• /
• pp.371-377
• /
• 2015

We consider a nondifferentiable robust optimization problem, which has a maximum function of continuously differentiable functions and support functions as its objective function, continuously differentiable functions as its constraint functions. We prove optimality conditions for the nondifferentiable robust optimization problem. We formulate a Wolfe type dual problem for the nondifferentiable robust optimization problem and prove duality theorems.