• 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.

• 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.

• Proceedings of the Korean Reliability Society Conference
• /
• 2005.06a
• /
• pp.109-113
• /
• 2005

Optimality for block designs have received much attention in the literature. Here we review these criteria and present results showing their A,D and E connection. Also we acquainted with the mathematical methods of designing optimal experiments. In this paper, we will to do work about optimality in experimental designs.

• East Asian mathematical journal
• /
• v.35 no.3
• /
• pp.289-296
• /
• 2019

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

• East Asian mathematical journal
• /
• v.39 no.5
• /
• pp.505-514
• /
• 2023

In this paper, we consider a second-order cone linear fractional vector optimization problems (FVP), and obtain sequential optimality theorems for (FVP) which hold without any constraint qualification and which are expressed by sequences.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.7
• /
• pp.1210-1216
• /
• 2003

Topology optimization is applied to determine the layout of a structural component with a specified frequency by minimizing the difference between the specified structural frequency and a given frequency. The homogenization design method is employed and the topology design problem is solved by the optimality criteria method. The value of a weighting factor in the optimality criteria plays an important role in this topology design problem. The modified optimality criteria method approximated by using the binomial expansion is suggested to determine the suitable value of the weighting factor, which makes convergence stable. If a given frequency is set as an excited frequency, it is possible to avoid resonance by moving away the specified structural frequency from the given frequency. The results of several test problems are compared with previous works and show the validity of the proposed algorithm.

• Communications of the Korean Mathematical Society
• /
• v.25 no.1
• /
• pp.139-147
• /
• 2010

A generalized nondifferentiable fractional optimization problem (GFP), which consists of a maximum objective function defined by finite fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions, is considered. Recently, Kim et al. [Journal of Optimization Theory and Applications 129 (2006), no. 1, 131-146] proved optimality theorems and duality theorems for a nondifferentiable multiobjective fractional programming problem (MFP), which consists of a vector-valued function whose components are fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions. In fact if $\overline{x}$ is a solution of (GFP), then $\overline{x}$ is a weakly efficient solution of (MFP), but the converse may not be true. So, it seems to be not trivial that we apply the approach of Kim et al. to (GFP). However, modifying their approach, we obtain optimality conditions and duality results for (GFP).

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.337-349
• /
• 2011

This paper is concerned with deriving necessary and sufficient optimality conditions for a fuzzy linear programming problem. Toward this end, an equivalence between fuzzy and crisp linear programming problems is established by means of a specific ranking function. Under this setting, a main theorem gives optimality conditions which do not seem to be in conflict with the so-called Karush-Kuhn-Tucker conditions for a crisp linear programming problem.

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

Optimality conditions are derived for a nonlinear fractional program in which a support function appears in the numerator and denominator of the objective function as well as in each constraint function. As an application of these optimality conditions, a dual to this program is formulated and various duality results are established under generalized convexity. Several known results are deduced as special cases.

• Speech Sciences
• /
• v.2
• /
• pp.109-124
• /
• 1997

This paper shows how a distinctive feature model can effectively be implemented into speech understanding within the framework of the Optimality Theory(OT); i.e., to show how distinctive features can optimally be extracted from given speech signals, and how segments can be chosen as the optimal ones among plausible candidates. This paper will also show how the sequence of segments can successfully be matched with optimal words in a lexicon.