• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.03a
• /
• pp.11-16
• /
• 1998

The classical algorithm for solving liner network flow problems are primal cost improvement method, including simplex method, which iteratively improve the primal cost by moving flow around simple cycles, which iteratively improve the dual cost by changing the prices of a subset of nodes by equal amounts. Typical iteration/shortest path algorithm is used to improve flow problem of liner network structure. In this paper we stdudied about the implemental method of shortest path which is a practical computational aspects. This method can minimize the best neighbor node and also implement the typical iteration which is $\varepsilon$-CS satisfaction using the auction algorithm of linear network flow problem

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.67-79
• /
• 1997

In this paper we develop the integrated software that can compare algorithms of the minimum cost flow problem using PC. The chosen algorithms are the network simplex method, dual network simplex method, and out-of-kilter method, which methods correspond to primal, dual, and primal-dual approach respectively. We also present the improved methods obtaining the initial solution to increase the efficiency of algorithms, and experiment results shown the difference between the entering(dropping) selection rules.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.67-75
• /
• 2013

The advantages of the orthogonal frequency division multiplexing (OFDM) are high spectral efficiency, resiliency to RF interference, and lower multi-path distortion. To further utilize vast channel capacity of the multiuser OFDM, one has to find the efficient adaptive subchannel and bit allocation among users. In this paper, we compare the performance of the linear programming dual of the 0-1 integer programming formulation with the existing convex optimization approach for the optimal subchannel and bit allocation problem of the multiuser OFDM. Utilizing tight lower bound provided by the LP dual formulation, we develop a primal heurisitc algorithm based on the LP dual solution. The performance of the primal heuristic is compared with MAO, ESA heuristic solutions, and integer programming solution on MATLAB simulation on a system employing M-ary quadrature amplitude modulation (MQAM) assuming a frequency-selective channel consisting of three independent Rayleigh multi-paths.

• Journal of Animal Science and Technology
• /
• v.65 no.2
• /
• pp.412-426
• /
• 2023

Currently, pigs breed in Korea are LYD (Landrace × Yorkshire × Duroc) crossbred pigs. Pigs used as fresh meat are gilts and barrows. However, the current supply of pork is not satisfying Korean consumers. In addition, the comparison of carcasses between gilts and barrows only studies carcass weight, backfat thickness, or meat quality, and there are very few studies comparing carcass characteristics. The purpose of this study was to compare characteristics of 7 primal cuts of gilts and barrows as measured by AutoFom III. A total of 350,179 pigs were used, including 176,461 gilts and 173,718 barrows. Characteristics of seven primal cuts were measured using AutoFom III. In the case of carcass weight, there was no significant difference in grade 1+. For all other survey items except for grade 2, gilts showed significantly (p < 0.05) higher values. For all grades except for pork belly, amounts of the remaining six primal cuts were higher in gilts (all p < 0.05,). In addition, the ratio of intermuscular fat in the pork belly of barrows showed a higher value than that in the pork belly of gilts (p < 0.05). The amount of pork belly, which is the most popular among consumers in Korea, not only produced more production than gilts in barrows, but also showed a higher value than gilts in barrows for the ratio of intermuscular fat affecting taste. In summary, gilts produced higher yields than barrows in all parts except pork belly. For the production of only pork belly, barrows showed higher production than gilts.

• Journal of agriculture & life science
• /
• v.53 no.4
• /
• pp.77-92
• /
• 2019

The purpose of this study was to investigate the carcass characteristics and the primal cut yields from carcasses according to the sex of Hanwoo. Experimental animals comprised of 80 cows, 29 bulls, and 71 steers. After slaughtering, they were evaluated to estimate the productivity of carcass components by market weight, and to predict the beef carcass yield. The average of fasting weight of cow, bull and steer were 634.75 kg, 721.86 kg, and 754.10 kg respectively. Market weight of Hanwoo at cold carcass weight, primal lean cut weight, sub-primal lean cut weight, bone weight and fat weight were 381.01~467.60 kg, 240.79~310.36 kg, 208.27~276.47 kg, 57.23~76.28 kg and 89.19~138.97 kg respectively. Body measurement traits had side length, hindquarter length, cervical vertebrae length, lumbar vertebrae length, sacral vertebrae length, 6th lumbar vertebrae~heel length, 5~6th thoracic vertebrae breadth, 4~5th lumbar vertebrae breadth, 5th sacral vertebrae breadth, 7~8th thoracic vertebrae girth and 7~8th thoracic vertebrae thick were highest length in steer. Carcass weight (CW) were significantly (p<0.05) affected by sex and live weight. The lean meat percentage, fat percentage and bone percentage based on the weight of cold carcasses were significantly different (p<0.05) between sex groups. The primal cuts rate for deungsim, moksim, abdari, udun, suldo, yangjee and satae were higher in bulls than those of the caws and steers. The carcass by-product weight rate in steer had lower oxtail and rib cartilage than cow and bull, while cow showed lower beef leg bones and jappyeo than bull steer (p<0.05). Body measurement traits was always important for primal cut weight estimates.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.12 no.4
• /
• pp.227-238
• /
• 2008

In this paper we extend primal-dual interior point algorithm for linear optimization (LO) problems to $P_*({\kappa})$ linear complementarity problems(LCPs) ([1]). We define proximity functions and search directions based on kernel functions, ${\psi}(t)=\frac{t^{p+1}-1}{p+1}-{\log}\;t$, $p{\in}$[0, 1], which is a generalized form of the one in [16]. It is the first to use this class of kernel functions in the complexity analysis of interior point method(IPM) for $P_*({\kappa})$ LCPs. We show that if a strictly feasible starting point is available, then new large-update primal-dual interior point algorithms for $P_*({\kappa})$ LCPs have $O((1+2{\kappa})nlog{\frac{n}{\varepsilon}})$ complexity which is similar to the one in [16]. For small-update methods, we have $O((1+2{\kappa})\sqrt{n}{\log}{\frac{n}{\varepsilon}})$ which is the best known complexity so far.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.10
• /
• pp.480-488
• /
• 2001

This paper presents a technique that can obtain an optimal solution for the Security-Constrained Economic Dispatch (SCED) problems using the Interior Point Method (IPM) while taking into account of the power flow constraints. The SCED equations are formulated by using only the real power flow equations from the optimal power flow. Then an algorithm is presented that can linearize the SCED equations based on the relationships among generation real power outputs, loads, and transmission losses to obtain the optimal solutions by applying the linear programming (LP) technique. The objective function of the proposed linearization algorithm are formulated based on the fuel cost functions of the power plants. The power balance equations utilize the Incremental Transmission Loss Factor (ITLF) corresponding to the incremental generation outputs and the line constraints equations are linearized based on the Generalized Generation Distribution Factor (GGDF). Finally, the application of the Primal Interior Point Method (PIPM) for solving the optimization problem based on the proposed linearized objective function is presented. The results are compared with the Simplex Method and the promising results ard obtained.

• Food Science of Animal Resources
• /
• v.36 no.2
• /
• pp.145-151
• /
• 2016

The relationship between chemical compositions, meat quality traits, and palatability attributes in 10 primal cuts from Hanwoo steer carcasses were assessed. Sensory palatability attributes of Hanwoo beef were more closely related with fat content than to moisture or protein content. Among the chemical compositions, only fat had a significant correlation with juiciness (0.67, p<0.001), tenderness (0.32, p<0.05), and overall palatability (0.56, p<0.001). Oleic acid (%) was not significantly related with overall palatability (p>0.05). Overall palatability was negatively correlated with drip loss (−0.32, p<0.05), cooking loss (−0.36, p<0.05), and shear force (−0.54, p<0.01). The correlation between fat content and overall palatability was increased when higher fat cuts (Ansim, Dungsim, Chaekeut, Yangjee, and Kalbi) were analyzed, compared to lower fat cuts (Moksim, Abdari, Udun, Suldo, and Satae). Also, the correlation between shear force and overall palatability was decreased in lower fat cuts compared to higher fat cuts. Our results suggest that the palatability of Hanwoo beef can be improved by increasing fat content in muscles, as increased fat content leads to an increase in sensory tenderness, flavor, and juiciness.

• Journal of the Korean Mathematical Society
• /
• v.60 no.6
• /
• pp.1233-1254
• /
• 2023

We introduce two subclasses of abelian McCoy rings, so-called π-CN-rings and π-duo rings, and systematically study their fundamental characteristic properties accomplished with relationships among certain classical sorts of rings such as 2-primal rings, bounded rings etc. It is shown that a ring R is π-CN whenever every nilpotent element of index 2 in R is central. These rings naturally generalize the long-known class of CN-rings, introduced by Drazin [9]. It is proved that π-CN-rings are abelian, McCoy and 2-primal. We also show that, π-duo rings are strongly McCoy and abelian and also they are strongly right AB. If R is π-duo, then R[x] has property (A). If R is π-duo and it is either right weakly continuous or every prime ideal of R is maximal, then R has property (A). A π-duo ring R is left perfect if and only if R contains no infinite set of orthogonal idempotents and every left R-module has a maximal submodule. Our achieved results substantially improve many existing results.

• The Journal of Information Technology
• /
• v.3 no.2
• /
• pp.73-85
• /
• 2000

The efficient algorithms are suggested in this study for solving the multicommodity network flow problems applied to Communications Systems. These problems are typical NP-complete optimization problems that require integer solution and in which the computational complexity increases numerically in appropriate with the problem size. Although the suggested algorithms are not absolutely optimal, they are developed for computationally efficient and produce near-optimal and primal integral solutions. We supplement the traditional Lagrangian method with a price-directive decomposition. It proceeded as follows. First, A primal heuristic from which good initial feasible solutions can be obtained is developed. Second, the dual is initialized using marginal values from the primal heuristic. Generally, the Lagrangian optimization is conducted from a naive dual solution which is set as ${\lambda}=0$. The dual optimization converged very slowly because these values have sort of gaps from the optimum. Better dual solutions improve the primal solution, and better primal bounds improve the step size used by the dual optimization. Third, a limitation that the Lagrangian decomposition approach has Is dealt with. Because this method is dual based, the solution need not converge to the optimal solution in the multicommodity network problem. So as to adjust relaxed solution to a feasible one, we made efficient re-allocation heuristic. In addition, the computational performances of various versions of the developed algorithms are compared and evaluated. First, commercial LP software, LINGO 4.0 extended version for LINDO system is utilized for the purpose of implementation that is robust and efficient. Tested problem sets are generated randomly Numerical results on randomly generated examples demonstrate that our algorithm is near-optimal (< 2% from the optimum) and has a quite computational efficiency.