• 한국국방경영분석학회지
• /
• 제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.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.403-406
• /
• 2006

This paper provides an M/G/1 queueing model for the operations management problem at the toll plaza. This queueing process is incorporated with two non-linear integer programming models - the user cost minimization model during the peak times and the operating cost minimization model during the off-peak hours.

• 산업경영시스템학회지
• /
• 제11권18호
• /
• pp.7-15
• /
• 1988

This study is concerned with selecting mutually dependent quality improvement alternatives with resource constraints. These qualify improvement alternatives art different fro the tradition at alternatives which are independent from each other. In other words, selection of any improvement alternative requires other related specific improvement. Also the overall product quality in a multi stage manufacturing process is characterized by a complex multiplication method rather than a simple addition method which dose not allow to solve a linear knapsack problem despite its popularity in the traditional study. This study suggests a non-linear integer programming model for selecting mutually dependent quality improvement alternatives in multi-stage manufacturing process. In order to apply the model to selecting alternatives. This study also suggests a heuristic mode1 based on a dynamic programming model which is more practical than the non-linear integer programming model. The logic of the heuristic model enables 1) to estimate improvement effectiveness values on all improvement alternatives specifically defined for this study. 2) to arrange the effectiveness values in a descending order, and 3) to select the best one among the alternatives based on their forward and backward linkage relationships. This process repeats to selects other best alternatives within the resource constraints. This process is presented in a Computer programming in Appendix A. Alsc a numerical example of model application is presented in Chapter 4.

• 대한조선학회논문집
• /
• 제42권6호
• /
• pp.654-665
• /
• 2005

In this paper, we present a non-linear integer programming by genetic algorithm (GA) for available sizes of stiffener or thickness of plate in a job site. GA can rapidly search for the approximate global optimum under complicated design environment such as ship. Meanwhile it can handle the optimization problem involving discrete design variable. However, there are many parameters have to be set for GA, which greatly affect the accuracy and calculation time of optimum solution. The setting process is hard for users, and there are no rules to decide these parameters. In order to overcome these demerits, the optimization for these parameters has been also conducted using GA itself. Also it is proved that the parameters are optimal values by the trial function. Finally, we applied this method to compass deck of ship where the vibration problem is frequently occurred to verify the validity and usefulness of nonlinear integer programming.

• 한국국방경영분석학회지
• /
• 제23권1호
• /
• pp.14-24
• /
• 1997

This study is to develop an optimal surveillance units assignment model in order to obtain the maximized surveillance efficiency with the limited surveillance units. There are many mathematical models which deal with problems to assign weapons such as aircrafts, missiles and guns to targets. These models minimize the lost required to attack, the threat forecast from the enemy, or both of them. However, a problem of the efficient assignment of surveillance units is not studied yet, nevertbless it is important in the battlefield surveillance system. This paper is concerned with the development of the optimal surveillance units assignment model using integer programming. An optimal integer solution of the model can be obtained by using linear programming and branch and bound method.

• 정보보호학회논문지
• /
• 제14권4호
• /
• pp.49-59
• /
• 2004

공개되지 않은 함수에 대한 입력과 그에 따른 출력을 이용하여 그 함수와 같은 입출력을 가지는 부울함수표현을 찾아내는 것이 부울함수 합성문제이다. 전자공학 및 암호학 분야에서는 이 문제가 수리계획법의 한 부류인 0-1 integer programming 문제로 귀결되며, 본 논문에서는 부울함수 합성문제를 해결하는 하나의 예로 DES 의 비공개 논리인 입력 6비트, 출력 4비트의 S-box에 대한 부울함수표현을 찾는다. 이러한 결과는 임의의 함수에 대한 효율적인 하드웨어 구현과 블록암호 알고리즘의 대수적 구조를 이용한 암호분석기법에 이용될 수 있다.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.179-184
• /
• 2002

We consider the heterogeneous fleet vehicle routing problem (HVRP), a variant of the classical vehicle routing problem (VRP). The HVRP differs from the classical VRP in that it deals with a heterogeneous fleet of vehicles having various capacities, fixed costs, and variables costs. Therefore the HVRP is to find the fleet composition and a set of routes with minimum total cost. We give an integer programming formulation of the problem and propose an algorithm to solve it. Although the formulation has exponentially many variables, we can efficiently solve the linear programming relaxation of it by using the column generation technique. To generate profitable columns we solve a shortest path problem with capacity constraints using dynamic programming. After solving the linear programming relaxation, we apply a branch-and-bound procedure. We test the proposed algorithm on a set of benchmark instances. Test results show that the algorithm gives best-known solutions to almost all instances.

• 한국경영과학회지
• /
• 제31권1호
• /
• pp.91-103
• /
• 2006

Given a bill of materials (BOM) tree T labeled by the breadth first search (BFS) order from node 0 to node n and a general network ${\Im}=(V,A)$, where V={1,2,...,m} is the set of production facilities and A is the set of arcs representing transportation links between any of two facilities, we assume that each node of T stands for not only a component. but also a production stage which is a possible stocking point and operates under a periodic review base-stock policy, We also assume that the random demand which can be achieved by a suitable service level only occurs at the root node 0 of T and has a normal distribution $N({\mu},{\sigma}^2)$. Then our integrated model of facility location problems and safety stock optimization problem (FLP&SSOP) is to identify both the facility locations at which partitioned subtrees of T are produced and the optimal assignment of safety stocks so that the sum of production cost, inventory holding cost, and transportation cost is minimized while meeting the pre-specified service level for the final product. In this paper, we first formulate (FLP&SSOP) as a nonlinear integer programming model and show that it can be reformulated as a 0-1 linear integer programming model with an exponential number of decision variables. We then show that the linear programming relaxation of the reformulated model has an integrality property which guarantees that it can be optimally solved by a column generation method.

• 한국정보기술응용학회:학술대회논문집
• /
• 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
• /
• pp.311-314
• /
• 2005

Supply chain optimization is one of the most important components in the optimization of a company's value chain. This paper considers the problem of designing the supply chain for a product that is represented as an assembly bill of material (BOM). In this problem we are required to identify the locations at which different components of the product arc are produced/assembled. The objective is to minimize the overall cost, which comprises production, inventory holding and transportation costs. We assume that production locations are known and that the inventory policy is a base stock policy. We first formulate the problem as a 0-1 nonlinear integer programming model and show that it can be reformulated as a 0-1 linear integer programming model with an exponential number of decision variables.

• 한국산학기술학회논문지
• /
• 제19권4호
• /
• pp.85-92
• /
• 2018

수요관리를 통해 전기요금을 절감할 수 있다. 부하의 수요 관리 방법 중 하나로 ESS를 설치해 수요가 높은 시간대의 부하를 수요가 낮은 시간대로 옮기는 peak shifting을 사용함으로써 최대 부하를 낮추고 전력량 요금을 절감할 수 있다. 전기요금은 계약 용량 당 기본요금과 전력량 요금으로 이루어져있다. 전력량 요금을 최소화하기 위한 최적화 수행시 목적함수는 선형식으로 표현할 수 있으며, 기본 요금 최소화를 위한 목적함수는 이차식으로 표현할 수 있다. 선형식으로 표현된 목적함수에서는 ESS PCS(Power Conversion System)의 충, 방전 효율이 다른 경우를 다룰 수 없기 때문에 본 논문에서 충, 방전 효율이 다른 경우의 영향을 반영하고 혼합정수계획법(MILP, Mixed Integer Linear Programming)을 이용할 수 있는 정식을 제시하였다. 혼합정수계획법을 사용한 정식에서는 사전에 정해진 최대 부하 절감율에 대해 전기요금 최소화를 수행하게 되지만 최대 부하 절감과 전기요금 절감을 동시에 고려하기 위해서는 이차 계획법을 사용하는 것이 유용하다. 본 논문에서는 각 최적화 방법에 대한 장, 단점을 도시철도 변전소에 대한 시뮬레이션 결과를 정량적으로 비교분석하여 ESS 설비계획수립에 적합한 최적화 방법을 선택할 수 있는 근거를 제시하였다.