• 경영과학
• /
• 제14권1호
• /
• pp.205-227
• /
• 1997

Higher level representation splay an important role in model management systems. The role is to make decision makers friendly represent their problem using the representations. In this research, we address higher level representations including five distinctivenesses: Objective, Node, Link, Topological Constraint including five components, and Decision, Therefore, it is developed a system called HLRNET that implements the building procedure of network models using structural knowledge and object data The paper particularly elaborates all components included in each of distinctiveness extracted from structural characteristics of a lot of telecommunication network models. Higher level representations represented with five destinctivenesses should be converted into base level representations which are employed for semantic representations of linear and integer programming problems in a knowledge-assisted optimization modeling system. The system is illustrated with an example of the local access network model.

• 산업경영시스템학회지
• /
• 제37권3호
• /
• pp.113-121
• /
• 2014

This paper considers a scheduling problem in a two-machine flowshop with outsourcing strategy incorporated. The jobs can be either processed in the first machine or outsourced to outside subcontractors. This paper wants to determine which jobs to be processed in-house and which jobs to be outsourced. If any job is decided to be outsourced, then an additional outsourcing cost is charged The objective of this paper is to minimize the sum of scheduling cost and outsourcing cost under a budget constraint. At first this paper characterizes some solution properties, and then it derives solution procedure including DP (Dynamic Programming) and B&B (Branch-and-Bound) algorithms and a greedy-type heuristic. Finally the performance of the algorithms are evaluated with some numerical tests.

• International Journal of Control, Automation, and Systems
• /
• 제4권5호
• /
• pp.645-652
• /
• 2006

In this paper a new type of filter, called the $H_2/H_{\infty}$ FIR filter, is proposed for discrete-time state space signal models. The proposed filter requires linearity, unbiased property, FIR structure, and independence of the initial state information in addition to the performance criteria in both $H_2$ and $H_{infty}$ sense. It is shown that $H_2,\;H_{\infty}$, and $H_2/H_{\infty}$ FIR filter design problems can be converted into convex programming problems via linear matrix inequalities (LMIs) with a linear equality constraint. Simulation studies illustrate that the proposed FIR filter is more robust against temporary uncertainties and has faster convergence than the conventional IIR filters.

• 한국철도학회논문집
• /
• 제9권2호
• /
• pp.206-211
• /
• 2006

This thesis presents railroad crew restoring problem, which is to determine the railroad plan allocation. This problem is constructed that determine the sequence of duties that railroad crews have to perform. We analyze characteristic of this problem and railroad industry. It's hard to consider many constraint conditions. We propose Integer Programming model and easy methodology to be considered all given operation rules. This problem is known to be NP-hard. We develop a genetic algorithm, which is proved to be powerful in solving optimization problems. We proposed the effective mathematical model and algorithm about making crew restoring in real industry.

• Korean Journal of Mathematics
• /
• 제30권3호
• /
• pp.475-489
• /
• 2022

This paper focuses on a robust semi-infinite interval-valued optimization problem with uncertain inequality constraints (RSIIVP). By employing the concept of LU-optimal solution and Extended Mangasarian-Fromovitz Constraint Qualification (EMFCQ), necessary optimality conditions are established for (RSIIVP) and then sufficient optimality conditions for (RSIIVP) are derived, by using the tools of convexity. Moreover, a Wolfe type dual problem for (RSIIVP) is formulated and usual duality results are discussed between the primal (RSIIVP) and its dual (RSIWD) problem. The presented results are demonstrated by non-trivial examples.

• 대한안전경영과학회지
• /
• 제9권6호
• /
• pp.113-122
• /
• 2007

Quality function deployment(QFD) is becoming a widely used customer oriented approach. The aim of this paper is to present an analytic method of quality function deployment that is to maximize customer satisfaction, using a customer satisfaction survey conducted in the college in Korea. Combining weights and satisfaction indices, "performance/important" diagrams are to develop and this grid can be used in order to identify priorities for decision making. Also, this paper shows a 0-1 integer programming model for maximizing customer satisfaction subject to a budget constraint in QFD planning process with case study.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1995년도 하계학술대회 논문집 B
• /
• pp.777-780
• /
• 1995

Accounting for actuator nonlinearities in control loops has often been perceived as an implementation issue and usually excluded in the design of controllers. Nonlinearities treated in this paper are saturation, and they are modelled as an inequality constraint. The CRHPC(Constrained Receding Horizon Predictive Control) with inequality constraints algorithm is used to handle actuator rate and amplitude limits simultaneously or respectively. Optimum values of future control signals are obtained by quadratic programming. Simulated examples show that predictive control law with inequality constraints offers good performance as compared with input clipping.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2000년도 춘계학술대회 논문집
• /
• pp.45-50
• /
• 2000

실시간 시뮬레이션은 제약조건이 있는 시뮬레이션의 대표적인 경우로, 반드시 주어진 시간안에 최상의 시뮬레이션 결과를 생성해내야 한다. 본 논문에서는 시간제약과 같은 시스템에 주어진 제약조건을 모델링 및 시뮬레이션하기 위한 방법론을 제시한다. 시스템의 모델링 과정에서는 계층적 방법론에 기초하여 다중 추상화(multi-resolution)를 제공하는 모델을 만든다. 또한 제약조건이 있는 시뮬레이션을 위해서는 구축된 모델의 추상화수준을 조절한다. 즉, 1) 구축된 모델을 추상화 수준에 따라 정리하여 AT(Abstraction Tree)를 생성한 후 2) 주어진 제약조건을 integer programming 기법을 이용하여 정형화하고, 3) 제약조건을 만족시키는 최상의 추상화 수준을 AT상에서 결정한다. 결정된 추상화 수준에 따라 시뮬레이션에 필요한 모델을 동적으로 재구성하여 임의의 제약조건이 있는 시뮬레이션을 효과적으로 수행함으로써, 모델의 재사용 및 경제성을 증진시킬 수 있다.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제5권4호
• /
• pp.416-425
• /
• 1999

복잡한 무결성 제약 조건을 효율적으로 확인하기 위해 제약 조건들을 룰 베이스(rule base)에 저장하고 별도의 룰 관리 시스템과 제약 조건 관리 시스템을 통해 제약 조건을 확인하는 기법이 많은 연구자들에 의해 연구되고 발표되었다. 그러나 제약 조건 관리 시스템이 실행시간에 응용 프로그램을 항상 모니터링하고 있다가 데이타의 수정이 요청될 때마다 개입하여 프로세스를 중단시키고 관련 제약 조건을 확인하는 기존의 방법들은 처리 시간의 지연을 피할 수 없다. 본 논문은 컴파일 시간에 제약 조건 확인 코드를 응용 프로그램에 미리 삽입할 것을 제안한다. 응용 프로그램 자체 내에 제약 조건 확인 코드가 삽입되기 때문에 실행 시간에 다른 시스템의 제어를 받지 않고 직접 제약 조건의 확인 및 데이타베이스의 접근이 가능해져서 처리 시간의 지연을 피할 수 있을 것이다. 이를 위해 어떤 구문이 제약 조건의 확인을 유발하는 지를 추적하였고, 컴파일러가 그러한 구문을 어떻게 전처리 과정에서 검색하는지 그리고 그러한 구문마다 어떻게 해당 제약 조건 확인 코드를 삽입할 수 있는 지를 객체지향1) 데이타베이스 언어인 Objectivity/C++에 대해 gcc의 YACC 코드를 변경함으로써 보여 주었다.Abstract To cope with the complexity of handling integrity constraints, numerous researchers have suggested to use a rule-based system, where integrity constraints are expressed as rules and stored in a rule base. A rule manager and an integrity constraint manager cooperate to check the integrity constraints efficiently. In this approach, however, the integrity constraint manager has to monitor the activity of an application program constantly to catch any database operation. For each database operation, it has to check relevant rules with the help of the rule manager, resulting in considerable delays in database access. We propose to insert the constraints checking code in the application program directly at compile time. With constraints checking code inserted, the application program can check integrity constraints by itself without the intervention of the integrity constraint manager. We investigate what kind of statements require the checking of constraints, show how the compiler can detect those statements, and show how constraints checking code can be inserted into the program, by modifying the GCC YACC file for Objectivity/C++, an object-oriented database programming language.

• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 2023년도 학술발표회
• /
• pp.30-30
• /
• 2023

This study aims to establish the multi-reservoir operation system model in the Upper Mun River Basin which includes 5 main dams namely, Mun Bon (MB), Lamchae (LC), Lam Takhong (LTK), Lam Phraphoeng (LPP), and Lower Lam Chiengkrai (LLCK) Dams. The knowledge and AI technology were applied aiming to develop innovative prototype for SMART dam-reservoir operation in future. Two different sorts of reservoir operation system model namely, Fuzzy Logic (FL) and Constraint Programming (CP) as well as the development of rainfall and reservoir inflow prediction models using Machine Learning (ML) technique were made to help specify the right amount of daily reservoir releases for the Royal Irrigation Department (RID). The model could also provide the essential information particularly for the Office of National Water Resource of Thailand (ONWR) to determine the short-term and long-term water resource management plan and strengthen water security against flood and drought in this region. The simulated results of base case scenario for reservoir operation in the Upper Mun from 2008 to 2021 indicated that in the same circumstances, FL and CP models could specify the new release schemes to increase the reservoir water storages at the beginning of dry season of approximately 125.25 and 142.20 MCM per year. This means that supplying the agricultural water to farmers in dry season could be well managed. In other words, water scarcity problem could substantially be moderated at some extent in case of incapability to control the expansion of cultivated area size properly. Moreover, using AI technology to determine the new reservoir release schemes plays important role in reducing the actual volume of water shortfall in the basin although the drought situation at LTK and LLCK Dams were still existed in some periods of time. Meanwhile, considering the predicted inflow and hydrologic factors downstream of 5 main dams by FL model and minimizing the flood volume by CP model could ensure that flood risk was considerably minimized as a result of new release schemes.