• 대한수학회지
• /
• 제43권2호
• /
• pp.241-258
• /
• 2006

This paper gives conditions under which necessary optimality conditions in a locally Lipschitz program can be expressed as the invexity of the active constraint functions or the type I invexity of the objective function and the constraint functions on the feasible set of the program. The results are nonsmooth extensions of those of Hanson and Mond obtained earlier in differentiable case.

• Journal of applied mathematics & informatics
• /
• 제29권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
• /
• 제18권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.

• Management Science and Financial Engineering
• /
• 제18권1호
• /
• pp.21-26
• /
• 2012

Two previous studies that attempted to generalize the deterministic joint pricing-inventory decision model are reevaluated. We prove analytically that even in a single-product environment, the EOQ model with constant priceelastic demand cannot find optimal solutions unless two optimality conditions associated with price elasticity and demand magnitude are satisfied. Due to the inexistence of the general optimality for the problem, demand function and price elasticity must be evaluated and bounded properly to use the methods proposed in the previous studies.

• 음성과학
• /
• 제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.

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

• International Journal of Internet, Broadcasting and Communication
• /
• 제14권1호
• /
• pp.31-36
• /
• 2022

Interval caching is one of the representative caching strategies used in multimedia streaming systems. However, there has been no theoretical analysis on interval caching. In this paper, we present an optimality proof of the interval caching policy. Specifically, we propose a caching performance model for multimedia streaming systems and show the optimality of the interval caching policy based on this model.

• 대한기계학회논문집A
• /
• 제27권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.

• 대한수학회지
• /
• 제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.

• 대한수학회논문집
• /
• 제25권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).