• Kyungpook Mathematical Journal
• /
• v.59 no.3
• /
• pp.363-375
• /
• 2019

Let G = (V, E) be a simple graph with p vertices and q edges. A subset S of V (G) is called a strong (weak) efficient dominating set of G if for every $v{\in}V(G)$ we have ${\mid}N_s[v]{\cap}S{\mid}=1$ (resp. ${\mid}N_w[v]{\cap}S{\mid}=1$), where $N_s(v)=\{u{\in}V(G):uv{\in}E(G),\;deg(u){\geq}deg(v)\}$. The minimum cardinality of a strong (weak) efficient dominating set of G is called the strong (weak) efficient domination number of G and is denoted by ${\gamma}_{se}(G)$ (${\gamma}_{we}(G)$). A graph G is strong efficient if there exists a strong efficient dominating set of G. In this paper, some cycle and star related Nordhaus-Gaddum type relations on strong efficient dominating sets and the number of strong efficient dominating sets are studied.

• Korean Management Science Review
• /
• v.10 no.2
• /
• pp.11-26
• /
• 1993

This paper presents a new interactive procedure for multiple objective linear programming problem (MOLP). In practical multiple objective linear programming applications, there is usually no need for the decision maker to consider solutions which are not efficient. Therefore, the interactive procedure presented here searches only among efficient solutions and terminates with a solution that is guaranteed to be efficient. It also can converge to nonextreme efficient final solutions rather than being restricted to only extreme efficient points of the feasible set. The procedure does not require sophisticated judgements or inputs from the decision maker. One of the most attractive features of the procedure however, is that the method allows the DM to examine the efficient faces it finds. As iteration goes, the DM can explore a wide variety of efficient faces rather than efficient faces confined to only certain subregion of the feasible set of problem MOLP since the efficient faces that the procedure finds need not be adjacent. This helps the DM explore the nature of the efficient set of problem MOLP and also helps the DM have confidence with a final solution. For these reasons, I feel that the procedure offer significant promise in solving multiple objective linear programs rapidly and in a satisfying manner to the DM.

• Journal of the military operations research society of Korea
• /
• v.14 no.1
• /
• pp.33-41
• /
• 1988

In Multiple Objective Linear Programming (MOLP), it is well known that efficient solution and weight are correspondent to each other. The purpose of this paper is to study relationships between efficient face and the region of weight in MOLP. It is shown that the regions of weights corresponding to two efficient extreme points are also neighbor if two efficient extreme points are neighbor each other, and that the set of the efficient solutions corresponding to the common part of weight regions is efficient face. Using the above, we present a method to find the efficient solutions corresponding to a given weight and vice versa.

• Journal of the military operations research society of Korea
• /
• v.13 no.2
• /
• pp.33-41
• /
• 1987

In Multiple Objective Linear Programming (MOLP), it is well known that efficient solution and weight are correspondent to each other. The purpose of this paper is to study relationships between efficient face and the region of weight in MOLP. It is shown that the regions of weights corresponding to two efficient extreme points are also neighbor if two efficient extreme points are neighbor each other, and that the set of the efficient solutions corresponding to the common part of weight regions is efficient face. Using the above, we present a method to find the efficient solutions corresponding to a given weight and vice versa.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2010.05a
• /
• pp.115-120
• /
• 2010

This study suggests 'Eco-Efficient Water Infrastructure' as a breakthrough to the economically and ecologically challenged region; the Asia-Pacific. The study conceptualizes eco-efficient water infrastructure based on the understanding of eco-efficiency and variety of indicators for eco-efficient water infrastructure. Further, the guidelines for establishing national strategies for eco-efficient water infrastructure is introduced.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.2
• /
• pp.119-128
• /
• 1994

There are three important regions im Multiple Objective Linear Programming (MOLP). One is the region of efficient solutions, another is the region of weight to be used for finding efficient solutions, the third is the region of efficient (nondominated) objective values. In this paper, first, we find the condition of extreme point in the region of efficient objective values. Second, we find that the sum of the dimension of the weight region and the dimension of efficient objective values region is constant. Using the above, it is shown that we find the shape and dimension of weight region corresponding to the given region or efficient objective values and vice versa.

• Bulletin of the Korean Mathematical Society
• /
• v.30 no.1
• /
• pp.1-7
• /
• 1993

Vector optimization problems consist of two or more objective functions and constraints. Optimization entails obtaining efficient solutions. Geoffrion [3] introduced the definition of the properly efficient solution in order to eliminate efficient solutions causing unbounded trade-offs between objective functions. In 1974, Isermann [7] obtained a necessary and sufficient condition for an efficient solution of a linear vector optimization problem with linear constraints and showed that every efficient solution is a properly efficient solution. Since then, many authors [1, 2, 4, 5, 6] have extended the Isermann's results. In particular, Gulati and Islam [4] derived a necessary and sufficient condition for an efficient solution of a linear vector optimization problem with nonlinear constraints, under certain assumptions. In this paper, we consider the following nonlinear vector optimization problem (NVOP): (Fig.) where for each i, f$_{i}$ is a differentiable function from R$^{n}$ into R and g is a differentiable function from R$^{n}$ into R$^{m}$ .

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.8
• /
• pp.396-400
• /
• 2005

This paper proposes the cost analysis on the energy efficient equipment when this equipment is participated in the demand-side bidding. Conventional demand-side bidding is exercised through load re-distribution. However if this load reduction is exercised by the use of high efficient equipment, its effect will be assumed to be more economical. This paper analyses this cost-benefit effect of high efficient equipment in the demand-side bidding.

• ETRI Journal
• /
• v.23 no.2
• /
• pp.61-70
• /
• 2001

In this paper, we propose an efficient method for personal identification by analyzing iris patterns that have a high level of stability and distinctiveness. To improve the efficiency and accuracy of the proposed system, we present a new approach to making a feature vector compact and efficient by using wavelet transform, and two straightforward but efficient mechanisms for a competitive learning method such as a weight vector initialization and the winner selection. With all of these novel mechanisms, the experimental results showed that the proposed system could be used for personal identification in an efficient and effective manner.

• Communications of the Korean Mathematical Society
• /
• v.19 no.1
• /
• pp.179-196
• /
• 2004

Mond-Weir type duals for multiobjective variational problems are formulated. Under generalized vector variational type I invexity assumptions on the functions involved, sufficient optimality conditions, weak and strong duality theorems are proved efficient and properly efficient solutions of the primal and dual problems.