• Journal of Korean Society for Quality Management
• /
• v.8 no.2
• /
• pp.15-22
• /
• 1980

This paper deals with the problem of determining a minimum cost sampling inspection plan for a single destructive testing by attribute. The cost for inspection lot is constructed by following three cost factors: (1) cost of inspection, (2) cost of accepted defective, (3) cost of rejected lot Using Hald's Bayesian approach in a single non-destructive testing, procedure's for finding the minimum cost single destructive sampling inspection plan by attribute are given. Assuming the uniform distribution as a prior-distribution and using numerical analysis by computer, a minimum cost single destructive sampling inspection plan by attribute for several lot sizes, unit cost, destructive testing cost, and salvage cost is given.

• Journal of Families and Better Life
• /
• v.28 no.6
• /
• pp.195-205
• /
• 2010

households using the 2007 Korean Retirement and Income Study. Elderly households were classified into three groups based on the comparisons among the costs of living and then the factors influencing the probability of belonging to each group were investigated using multiple logistic regression models. The major findings are as follows. Firstly, the subjective adequate cost of living was the highest and the subjective minimum cost of living was the lowest. The actual cost of living was in between. Secondly, 42.6% of elderly households belonged to Group1(whose actual cost of living was less than the subjective minimum cost of living), 30.0% was classified into Group2(whose actual cost of living was greater than the subjective minimum cost of living but less than the subjective adequate cost of living) and the actual cost of living of the remaining 27.4% was greater than the subjective adequate cost of living(Group3). Thirdly, income was the strongest factor influencing the probability of belonging to each group, but the influencing factors were different for the logistic models for Group1 and Group3 based on Group2.

• Journal of the military operations research society of Korea
• /
• v.25 no.2
• /
• pp.84-96
• /
• 1999

The purpose of this paper is to find the most vital arc in the minimum cost flow problem. The most vital arc is the arc whose removal results in the greatest influence in the costs or the amount of demands in a given minimum cost flow network. This problem can be well applied to the conflict situations such as military logistics network or communications network. In this situation, network user wants to know which arcs are the most vital to him so that he can reinforce these arcs against attack, while interdictor wants to destroy these arcs which increase the distance of the shortest path most through the network. When one of arcs is removed from the network of the minimum cost flow problem, two kinds of situations can be occurred ; breaking feasibility and increasing cost. In case of breaking feasibility, the rank of arcs are determined using the amount of modified flow in a related network which is made of modifying the optimal alternative of the minimum cost flow problem. The rank of arcs with the increased costs are determined by using a method which finds the directed cycle with the minimum cost in a related network.

• Journal of the Society of Naval Architects of Korea
• /
• v.48 no.2
• /
• pp.178-182
• /
• 2011

Generally in order to reduce the steel weight of stiffened plate, stiffener spaces tend to be narrow and the plate gets thin. However, it will involve more fabrication cost because it can lead to the increase of welding length and the number of structural members. In the yard, the design which is able to reduce the total fabrication cost is needed, although it requires more steel weight. The purpose of this study is to find optimum stiffener spaces to minimize the fabrication cost for the cargo tank of LPG Carriers. Global optimization methods such as ES(Evolution Strategy) and GA(Genetic Algorithm) are introduced to find a global optimum solution and the sum of steel material cost and labor cost is selected as main objective function. Convergence degree of both methods in according to the size of searching population is examined and an efficient size is investigated. In order to verify the necessity of the optimum design based on the cost, minimum weight design and minimum cost design are carried out.

• Coupled systems mechanics
• /
• v.13 no.4
• /
• pp.311-335
• /
• 2024

This work aims to show a model to estimate the minimum cost (Thickness and area of steel in X and Y directions) for design a circular isolated footing with eccentric column that considers that the surface in contact with the ground works partially under compression. The formulation is shown by integration to find the moments, the bending shears and the punching shear using the pressure volume under the footing. Some researchers show the minimum cost design for circular isolated footings for an eccentric column assuming that the contact area works completely in compression, others consider the contact surface with the ground working partially in compression for a column in the center of the base. Three numerical examples are developed to obtain the complete design, which are: Example 1 for a column in the center of the base,Example 2 for a column at a distance of 1.50 m from the center of the base in the X direction, Example 3 for a column at a distance of 1.50 m from the center of the base in both directions. Also, a comparison of the new model against the model proposed by other authors is presented. The comparison shows that the new model generates a great saving of up to 43.74% for minimum area and 48.44% for minimum cost design in a column located in the center of the base, and when the column is located at a distance of radius/2 starting from the center of the base in the X direction generates great savings of up to 45.24% for minimum area and 31.80% for minimum cost design. Therefore, it is advisable to use the model presented in this study.

• Proceedings of the IEEK Conference
• /
• 2000.06b
• /
• pp.213-216
• /
• 2000

Minimum-cost linear network flow problems could be transformed with equal to assignment problems. Traditional method to solve the linear network flow problems are improved source-cost by transform the simple cycle flow. Auction algorithm could be applied to same element using the initial target price and dispersion calculation. Also, each elements are obtained by $\varepsilon$-relaxation methods. In this paper we proposed; 1)minimum-cost flow problem, 2)minimum-cost flow problem by the mathematical equivalent and 3) extraction $\varepsilon$-relaxation & expand transfer problem with minimum-cost flow. It can be applicant to PCB design by above mentioned.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.49 no.6
• /
• pp.93-101
• /
• 2007

In general, geotechnical properties have many uncertain aspects, thus probabilistic analysis have been used to consider these aspects. It is, however, quite difficult to select an appropriate target probability for a certain structure or construction process. In this study, minimum expected cost design method based on probabilistic analysis is suggested for design of vertical drains generally used to accelerate consolidation in soft clayey soils. A sensitivity analysis is performed to select the most important uncertain parameters for the design of vertical drains. Monte Carlo simulation is used in sensitivity analysis and probabilistic analysis. Total expected cost, defined as the sum of initial cost and expected additive cost, varies widely with variation of input parameters used in design of vertical drain systems. And probability of failure to get the minimum total expected cost varies under the different design conditions. A minimum value of total expected cost is suggested as a design value in this study. The proposed design concept is applicable to unit construction process because this approach is to consider the uncertainties using probabilistic analysis and uncertainties of geotechnical properties.

• Management Science and Financial Engineering
• /
• v.20 no.1
• /
• pp.17-19
• /
• 2014

In this paper, we consider an interesting variant of the inverse minimum traveling salesman problem. Given an instance (G, w) of the minimum traveling salesman problem defined on a metric space, we fix a specified Hamiltonian cycle $HC_0$. The task is then to adjust the edge cost vector w to w' so that the new cost vector w' satisfies the triangle inequality condition and $HC_0$ can be returned by the minimum spanning tree algorithm in the TSP-instance defined with w'. The objective is to minimize the total deviation between the original and the new cost vectors with respect to the $L_1$-norm. We call this problem the inverse metric traveling salesman problem against the minimum spanning tree algorithm and show that it is closely related to the inverse metric spanning tree problem.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.8
• /
• pp.105-112
• /
• 2015

Generally, the optimal solution of assignment problem has been obtained by Hungarian algorithm with O($n^3$) time complexity. This paper proposes more simple algorithm with O($n^2$) time complexity than Hungarian algorithm. The proposed algorithm simply selects minimum cost in each row, and classified into set S, H, and T. Then, the minimum cost is moved from S to T and $S{\rightarrow}H$, $H{\rightarrow}T$. The proposed algorithm can be obtain the same optimal solution as well-known algorithms and improve the optimal solution of partial unbalanced assignment problems.

• Journal of the Korean Home Economics Association
• /
• v.29 no.3
• /
• pp.35-45
• /
• 1991

This study was to calculate the minimum food expenditure by using OR linear program, and to determine the food plans for different income values based on the recommenced dietary allowances(RDA) for Koreans. VAX 11/780 system was used in this study. There were 6 family models-single man, single woman, married couple, couple with one child, couple with 2 children and couple with 2 children & grandmother. The market price quoted in this study was from July 1989 to June 1990 and the data file was made from RDA & food composition tables. After the minimum food expenditure was calculated from the computer, the low cost food plan was set. From the low cost food plan, we set the moderate cost food plan 25% above the low cost and the liberal food plan 50% above the low cost. One week menu was planned for different food plans. The low cost food plan could be used not only at the institutional levels and at home but also used at the national food policy making for scientific budget planning and for nutritionally well balanced diet. These food plans could control the use of time and efforts, too.