• 기술혁신연구
• /
• 제24권3호
• /
• pp.107-137
• /
• 2016

이 논문은 전국적인 설문조사자료를 분석하여 과학연구에 대한 한국인의 지지도가 어떠하며, 어떤 집단이 이러한 지지를 견인하고 있는지를 순수 기초 연구, 산업발전을 목표로 하는 응용연구, 일반시민의 삶의 질 향상을 목표로 하는 사회문제 해결형 연구로 나누어 살펴본다. 분석결과 사회적 정치적 가치 지향에 따라 사회문제 해결형 연구를 포함한 연구 유형별 지지도에 차이가 나타났다. 주관적 정치성향이 진보적일수록 사회문제 해결형 연구를 다른 유형의 연구들에 비해 지지하는 경향을 보인 반면, 보수적일수록 기초연구에 대한 지지도가 높아졌고 신자유주의적 가치지향에 가까울수록 응용연구에 대한 지지도가 높아졌다. 한편 한국사회에서 사회문제 해결형 연구가 지나친 응용연구에 대한 비판으로 대두된 반면, 일반시민들은 이를 응용연구보다 기초연구와 대비되는 것으로 인식하고 있었다. 또한 사회문제 해결형 연구가 전문가주의의 폐해를 극복하기 위해 시민참여를 강조하는 반면, 과학자의 권위와 전문성에 대한 신뢰도 수준이 높을수록 오히려 사회문제 해결형 연구에 대한 지지도가 증가하는 것으로 나타났다. 마지막으로 소득 수준이 낮을수록 사회문제 해결형 연구에 대한 지지도가 다른 두 유형의 연구에 대한 지지도보다 높은 것으로 나타났다.

• 한국국방경영분석학회지
• /
• 제11권2호
• /
• pp.53-63
• /
• 1985

This paper presents a multi-costraint optimization model for redundant system reliability. The optimization model is usually formulated as a nonlinear integer programming (NIP) problem. This paper reformulates the NIP problem into a linear integer programming (LIP) problem. Then an efficient 'Branch and Straddle' algorithm is proposed to solve the LIP problem. The efficiency of this algorithm stems from the simultaneous handling of multiple variables, unlike in ordinary branch and bound algorithms. A numerical example is given to illustrate this algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국제학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.155-159
• /
• 1993

In this paper, we consider the problem of a stochastic optimal switching control, which can be applied to the control of a system with uncertain demand such as a control problem of a power plant. The dynamic programming method is applied for the formulation of the optimal control problem. We solve the system of Quasi-Variational Inequalities(QVI) using an algoritlim which involves the finite difference approximation and contraction mapping method. A mathematical example of the optimal switching control is constructed. The actual performance of the algorithm is also tested through the solution of the constructed example.

• 한국경영과학회지
• /
• 제19권3호
• /
• pp.219-233
• /
• 1994

A fixed k-coloring problem is introduced and dealt with by efficient heuristic algorithms. It is shown that the problem can be transformed into the graph partitioning problem. Initial coloring and improving methods are proposed for problems with and with and without the size restriction. Algorithm Move, LEE and OEE are developed by modifying the Kernighan-Lin's two way uniform partitioning procedure. The use of global information in the selection of the node and the color set made the proposed algorithms superior to the existing method. The computational result also shows that the superiority does not sacrifice the time demand of the proposed algorithms.

• 한국경영과학회지
• /
• 제19권2호
• /
• pp.177-198
• /
• 1994

We consider an algorithm for the Crew Scheduling Problem (CSP) based on the Transportation Problem approach. The main flows of the algorithm are arranged in three steps. First we propose a heuristic algorithm of the greedy principle to obtain an initial feasible solution. Secondary we present a method of formulating CSP into a Modified Transportation Problem format. Lastly the procedures of network search to get the optimal solution are presented. This algorithm can be applied to the general GSP and also to most combinatorial problems like the Vehicle Routing Problems. The computational results show that the large size CSP's could be tackled.

• 한국경영과학회지
• /
• 제21권1호
• /
• pp.131-146
• /
• 1996

In this paper, we describe the facial structure of the steiner problem in a directed graph by formulating it as set covering problem. We first characterize trivial facets and derive a necessary condition for nontrival facets. We also introduce a class of valid inequalities with 0-1 coefficients and show when such inequalities define facets.

• 한국경영과학회지
• /
• 제8권1호
• /
• pp.27-30
• /
• 1983

The purpose of this paper is to find a new method for the warehouse location problem. Akinc and Khumatvala developed a branch and bound algorithm for a one-stage problem, that is, plants and warehouses are at the same location. This paper extends this method to a two-stage problem, that is, plants, warehouses and users are located at different sites, and further this paper allows direct flows from plants to users. The new method is tested at Perkins-Elmer. The test shows that the algorithm is efficient.

• 한국경영과학회지
• /
• 제10권2호
• /
• pp.45-53
• /
• 1985

In the present paper, the capacitated solid transportation problem (planar constraints) is considered with upper and lower bounds on the rim conditions. The considered model has been shown to be equipvalent to a standard capacitated 3-index transportation problem. A procedure to solve any capacitated 3-index transportion problem is also suggested. Some special cases of the considered model have been shown to conform to possible practical situations.

• 한국경영과학회지
• /
• 제30권1호
• /
• pp.177-185
• /
• 2005

We consider the optimization problem of the geostationary satellite orbital positions. which is very fundamental and important in setting up the new satellite launching plan. We convert the problem into a discrete optimization problem. However, the converted problem is too complex to find an optimal solution. Therefore, we develope the solution procedures using simulated annealing technique. The results of applying our method to some examples are reported.

• 한국경영과학회지
• /
• 제18권2호
• /
• pp.83-103
• /
• 1993

This paper addresses an optimization problem faced by a multi-server and multi-class customer system in manufacturing facilities and service industries. This paper presents a model of an integrated problem of server allocation and customer type partitioning. We approximate the problem through two types of models to make it tractable. As soution approach, the simulated annealing heuristic is constructed based on the general simulated annealing method. Computational results are presented.