• 대한산업공학회지
• /
• 제19권2호
• /
• pp.3-13
• /
• 1993

In this study, we develop a B & B type algorithm for the concave minimization problem with 0-1 knapsack constraint. Our algorithm reformulates the original problem into the singly linearly constrained concave minimization problem by relaxing 0-1 integer constraint in order to get a lower bound. But this relaxed problem is the concave minimization problem known as NP-hard. Thus the linear function that underestimates the concave objective function over the given domain set is introduced. The introduction of this function bears the following important meanings. Firstly, we can efficiently calculate the lower bound of the optimal object value using the conventional convex optimization methods. Secondly, the above linear function like the concave objective function generates the vertices of the relaxed solution set of the subproblem, which is used to update the upper bound. The fact that the linear underestimating function is uniquely determined over a given simplex enables us to fix underestimating function by considering the simplex containing the relaxed solution set. The initial containing simplex that is the intersection of the linear constraint and the nonnegative orthant is sequentially partitioned into the subsimplices which are related to subproblems.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 2007년도 정기학술대회
• /
• pp.223-233
• /
• 2007

The so-called Korean BNC (bound noun construction) displays complex syntactic, semantic, and constructional properties. This paper, couched upon a constraint-based approach, two different syntactic structures for the construction with articulated lexical properties for the BNs and relevant predicates. The paper reports an implementation of this analysis in the LKB (Linguistic Knowledge Building) system and shows us that this direction is robust enough to pare relevant sentences.

• Journal of Information Technology Applications and Management
• /
• 제22권2호
• /
• pp.1-17
• /
• 2015

In this research, we develop and suggest branch and bound algorithms for a two-machine permutation flowshop scheduling problem with the objective of minimizing makespan. In this scheduling problem, after each job is operated on the machine 1 (first machine), the job has to start its second operation on machine 2 (second machine) within its corresponding limited waiting time. In addition, each job has its corresponding ready time at the machine 1. For this scheduling problem, we develop various dominance properties and three lower bounding schemes, which are used for the suggested branch and bound algorithm. In the results of computational tests, the branch and bound algorithms with dominance properties and lower bounding schemes, which are suggested in this paper, can give optimal solution within shorter CPU times than the branch and bound algorithms without those. Therefore, we can say that the suggested dominance properties and lower bounding schemes are efficient.

• 전자공학회논문지SC
• /
• 제40권2호
• /
• pp.10-18
• /
• 2003

본 논문은 시간지연을 갖는 퍼지 시스템에 대한 보장 비용과 H/sub ∞/ 외란감쇄 성능을 갖는 퍼지 필터링 문제를 다룬다. 본 연구는 외란감쇄에 대한 확장 L₂ 노옴 제한조건과 LQ 비용함수의 성능 상한치 제한조건을 만족하는 필터링 설계 방법이다. Lyapunov 함수를 이용하여 필터의 존재성에 대한 충분조건을 유도하고 선형행렬부등식(LMI: linear matrix inequality)으로 나타낸다. 필터 설계는 LMI 해를 구함으로써 바로 구할 수 있다. 제안한 방법의 설계 과정을 설명하기 위한 시뮬레이션 예제를 또한 나타낸다.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제37권7호
• /
• pp.584-589
• /
• 2010

시계열 패턴 인식에 일반적으로 많이 사용되는 동적인 타임 워핑 알고리즘은 대부분의 연산시간을 상관표를 작성하는데 소비한다. 그리고 이 연산시간을 줄이고자 전역 경로 제약조건을 설정하여 연산범위에 제한을 두는데, 이것은 패턴의 내용을 고려하지 않은 시간축에 의한 제한이다. 따라서 본 논문에서는 패턴의 형태에 따라 적응적으로 전역 경로 제약조건을 설정하여 보다 효율적으로 패턴인식을 수행하는 분기 한정적인 동적 타임 워핑 알고리즘을 제안한다. 제안된 방법의 성능 평가를 위한 실험에서는 분기 한정적인 동적 타임 워핑 알고리즘이 기존의 동적 타임 워핑 방법과 경로 거리는 유사하면서 연산 시간이 보다 개선되었음을 확인할 수 있었다.

• Nuclear Engineering and Technology
• /
• 제54권10호
• /
• pp.3660-3671
• /
• 2022

A new methodology to derive a dose constraint for radioactive effluent from a unit of nuclear power plant (NPP) through retrospective assessment was developed to reflect operational flexibility in line with international standards. The new dose constraint can retain the safety margin between the offsite dose and the past dose constraints. As case studies, the new approach was applied to 24 Korean NPPs to address the limitations of the existing seven dose constraints that do not fully comply with current international radiation protection standards. Therefore, an effective dose constraint for Korean NPPs was proposed as no less than 0.15 mSv/y, which is comparable to the international practices and previous studies (0.05-0.3 mSv/y). Although the lower bound of the equivalent dose constraint was calculated as 0.17 mSv/y, it is not proposed in this study since the compliance with the derived effective dose constraint can prevent accompanied equivalent doses to any organs from exceeding equivalent dose limits. The new framework and the case studies are expected to contribute toward and support the revision of existing dose constraints for radioactive effluent from NPPs, ensuring better compliance with the current international safety standards as well as reflect the operational flexibility in practice.

• 제어로봇시스템학회논문지
• /
• 제11권1호
• /
• pp.9-12
• /
• 2005

This paper presents an LMI-based method to design sliding mode observers for a class of uncertain systems. Using LIs we derive an existence condition of a sliding mode observer guaranteeing a stable sliding motion. And we give explicit formulas of the observer gain matrices. We also consider sliding mode observer design problems under an α-stability constraint or an LQ performance bound constraint. Finally, we give a numerical design example.

• 한국경영과학회지
• /
• 제26권3호
• /
• pp.95-104
• /
• 2001

In this paper, we consider a maximin version of the linear programming knapsack problem with extended generalized upper bound (GUB) constraints. We solve the problem efficiently by exploiting its special structure without transforming it into a standard linear programming problem. We present an O(n$^3$) algorithm for deriving the optimal solution where n is the total number of problem variables. We illustrate a numerical example.

• 한국경영과학회지
• /
• 제22권3호
• /
• pp.1-9
• /
• 1997

We present an extension of the well-known generalized upper bound (GUB) constraint and consider a linear knapsack problem with both the extended GUB constraints and the simple upper bound (SUB) constraints. An efficient algorithm of order O($n^2log n$) is developed by exploiting structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.

• 대한산업공학회지
• /
• 제14권2호
• /
• pp.41-51
• /
• 1988

In this paper an efficient heuristic for the generalized assignment problem(GAP) is presented. A new lower bound that is slightly improved by adding the feasibility constraint is used to measure the quality of solutions obtained by the heuristic. The heuristic was tested on a number of large-scale random problems and a large sample of small problems. The heuristic appears to be better than the best previously existing heuristic for GAP. Its effectiveness in comparison of running times and closenesses to lower bound is discussed.