• Journal of the Korean Mathematical Society
• /
• v.46 no.2
• /
• pp.313-325
• /
• 2009

We consider zero-divisor graphs with respect to primal, nonprimal, weakly prime and weakly primal ideals of a commutative ring R with non-zero identity. We investigate the interplay between the ringtheoretic properties of R and the graph-theoretic properties of ${\Gamma}_I(R)$ for some ideal I of R. Also we show that the zero-divisor graph with respect to primal ideals commutes by localization.

• Honam Mathematical Journal
• /
• v.29 no.4
• /
• pp.555-567
• /
• 2007

We first find strongly 2-primal rings whose sub direct product is not (strongly) 2-primal. Moreover we observe some kinds of ring extensions of (strongly) 2-primal rings. As an example we show that if R is a ring and M is a multiplicative monoid in R consisting of central regular elements, then R is strongly 2-primal if and only if so is $RM^{-1}$. Various properties of (strongly) 2-primal rings are also studied.

• Communications of the Korean Mathematical Society
• /
• v.20 no.3
• /
• pp.457-466
• /
• 2005

We study in this note rings whose prime radicals are completely prime. We obtain equivalent conditions to the complete 2-primal-ness and observe properties of completely 2-primal rings, finding examples and counterexamples to the situations that occur naturally in the process.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.2
• /
• pp.124-131
• /
• 2011

In this research report, we propose a heuristic algorithm with some primal recovery strategies for capacitated facility location problems (CFLP), which is a well-known combinatorial optimization problem with applications in distribution, transportation and production planning. Many algorithms employ the branch-and-bound technique in order to solve the CFLP. There are also some different approaches which can recover primal solutions while exploiting the primal and dual structure simultaneously. One of them is a MVCD (Mean Value Cross Decomposition) ensuring convergence without solving a master problem. The MVCD was designed to handle LP-problems, but it was applied in mixed integer problems. However the MVCD has been applied to only uncapacitated facility location problems (UFLP), because it was very difficult to obtain "Integrality" property of Lagrangian dual subproblems sustaining the feasibility to primal problems. We present some heuristic strategies to recover primal feasible integer solutions, handling the accumulated primal solutions of the dual subproblem, which are used as input to the primal subproblem in the mean value cross decomposition technique, without requiring solutions to a master problem. Computational results for a set of various problem instances are reported.

• Bulletin of the Korean Mathematical Society
• /
• v.30 no.1
• /
• pp.71-77
• /
• 1993

Every ring considered in the paper will be assumed to be commutative and have a unit element. An ideal A of a ring R will be called primal if the elements of R which are zero divisors modulo A, form an ideal of R, say pp. If A is a primal ideal of R, P is called the adjoint ideal of A. The adjoint ideal of a primal ideal is prime [2]. The definition of primal ideals may also be formulated as follows: An ideal A of a ring R is primal if in the residue class ring R/A the zero divisors form an ideal of R/A. If Q is a primary idel of a ring R then every zero divisor of R/Q is nilpotent; therefore, Q is a primal ideal of R. That a primal ideal need not be primary, is shown by an example in [2]. Let R[X], and R[[X]] denote the polynomial ring and formal power series ring in an indeterminate X over a ring R, respectively. Let S be a multiplicative system in a ring R and S$^{-1}$ R the quotient ring of R. Let Q be a P-primary ideal of a ring R. Then Q[X] is a P[X]-primary ideal of R[X], and S$^{-1}$ Q is a S$^{-1}$ P-primary ideal of a ring S$^{-1}$ R if S.cap.P=.phi., and Q[[X]] is a P[[X]]-primary ideal of R[[X]] if R is Noetherian [1]. We search for analogous results when primary ideals are replaced with primal ideals. To show an ideal A of a ring R to be primal, it sufficies to show that a-b is a zero divisor modulo A whenever a and b are zero divisors modulo A.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.10 no.2
• /
• pp.61-68
• /
• 1985

This paper presents an optimization of distribution for flow & pressure using Primal method derived from network flow theory. The object of the distribution control in this study is press regulation and minimum cost flow. The flow and pressure equations are solved using Primal method.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.567-579
• /
• 2009

Recently, Peng et al. proposed a primal-dual interior-point method with new search direction and self-regular proximity for LP. This new large-update method has the currently best theoretical performance with polynomial complexity of O($n^{\frac{q+1}{2q}}\;{\log}\;{\frac{n}{\varepsilon}}$). In this paper we use this search direction to propose a primal-dual interior-point method for convex quadratic programming (QP). We overcome the difficulty in analyzing the complexity of the primal-dual interior-point methods for convex quadratic programming, and obtain the same polynomial complexity of O($n^{\frac{q+1}{2q}}\;{\log}\;{\frac{n}{\varepsilon}}$) for convex quadratic programming.

• Communications of the Korean Mathematical Society
• /
• v.25 no.4
• /
• pp.655-669
• /
• 2010

In this paper we propose new primal-dual interior point methods (IPMs) for $P_*(\kappa)$ linear complementarity problems (LCPs) and analyze the iteration complexity of the algorithm. New search directions and proximity measures are defined based on a class of kernel functions, $\psi(t)=\frac{t^2-1}{2}-{\int}^t_1e{^{q(\frac{1}{\xi}-1)}d{\xi}$, $q\;{\geq}\;1$. If a strictly feasible starting point is available and the parameter $q\;=\;\log\;\(1+a{\sqrt{\frac{2{\tau}+2{\sqrt{2n{\tau}}+{\theta}n}}{1-{\theta}}\)$, where $a\;=\;1\;+\;\frac{1}{\sqrt{1+2{\kappa}}}$, then new large-update primal-dual interior point algorithms have $O((1\;+\;2{\kappa})\sqrt{n}log\;n\;log\;{\frac{n}{\varepsilon}})$ iteration complexity which is the best known result for this method. For small-update methods, we have $O((1\;+\;2{\kappa})q{\sqrt{qn}}log\;{\frac{n}{\varepsilon}})$ iteration complexity.

• Bulletin of the Korean Mathematical Society
• /
• v.36 no.3
• /
• pp.579-588
• /
• 1999

In this paper we study the connections between right quasi-duo rings and 2-primal rings, including several counterexamples for answers to some questions that occur naturally in the process. Actually we concern following three questions and modified ones: (1) Are right quasi-duo rings 2-primal$\ulcorner$, (2) Are formal power series rings over weakly right duo rings also weakly right duo\ulcorner and (3) Are 2-primal rings right quasi-duo\ulcorner Moreover we consider some conditions under which the answers of them may be affirmative, obtaining several results which are related to the questions.

• Communications of the Korean Mathematical Society
• /
• v.25 no.3
• /
• pp.343-347
• /
• 2010

In this paper we study the connection between 2-primal rings, (S,1)-rings and related conditions. And we investigate some condition which is the special case of pseudo symmetric. We also study the condition (KJ) which is given by J. Y. Kim and H. L. Jin. We introduce some condition and we prove that our condition is equivalent to the condition (KJ) when it is an (S,1)-ring.