• Title/Summary/Keyword: 2-primal

Search Result 110, Processing Time 0.023 seconds

DUALITY FOR MULTIOBJECTIVE FRACTIONAL CONTROL PROBLEMS WITH GENERALIZED INVEXITY

  • Nahak, C.;Nanda, S.
    • Journal of applied mathematics & informatics
    • /
    • v.5 no.2
    • /
    • pp.475-488
    • /
    • 1998
  • Wolfe and Mond-Weir type duals for multiobjective con-trol problems are formulated. Under pseudo-invexity/quasi-invexity assumptions of the functions involved, weak and strong duality the-orems are proved to relate efficient solutions of the primal and dual problems.

OPTIMALITY FOR MULTIOBJECTIVE FRACTIONAL VARIATIONAL PROGRAMMING

  • JO, CHEONGLAI;KIM, DOSANG
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.4 no.2
    • /
    • pp.59-66
    • /
    • 2000
  • We consider a multiobjective fractional variational programming problem (P) involving vector valued functions. By using the concept of proper efficiency, a relationship between the primal problem and parametric multiobjective variational problem is indicated.

  • PDF

ON RINGS WHOSE PRIME IDEALS ARE MAXIMAL

  • Hong, Chan-Yong;Kim, Nam-Kyun;Kwak, Tai-Keun
    • Bulletin of the Korean Mathematical Society
    • /
    • v.37 no.1
    • /
    • pp.1-19
    • /
    • 2000
  • We investigate in this paper the maximality of prime ideals in rings whose simple singular left R-modules are p-injective.

  • PDF

Ore Extension Rings with Constant Products of Elements

  • Hashemi, Ebrahim;Alhevaz, Abdollah
    • Kyungpook Mathematical Journal
    • /
    • v.59 no.4
    • /
    • pp.603-615
    • /
    • 2019
  • Let R be an associative unital ring with an endomorphism α and α-derivation δ. The constant products of elements in Ore extension rings, when the coefficient ring is reversible, is investigated. We show that if f(x) = ∑ni=0 aixi and g(x) = ∑mj=0 bjxj be nonzero elements in Ore extension ring R[x; α, δ] such that g(x)f(x) = c ∈ R, then there exist non-zero elements r, a ∈ R such that rf(x) = ac, when R is an (α, δ)-compatible ring which is reversible. Among applications, we give an exact characterization of the unit elements in R[x; α, δ], when the coeficient ring R is (α, δ)-compatible. Furthermore, it is shown that if R is a weakly 2-primal ring which is (α, δ)-compatible, then J(R[x; α, δ]) = N iℓ(R)[x; α, δ]. Some other applications and examples of rings with this property are given, with an emphasis on certain classes of NI rings. As a consequence we obtain generalizations of the many results in the literature. As the final part of the paper we construct examples of rings that explain the limitations of the results obtained and support our main results.

Conservation of Straw Sandals Excavated at Goongnamji in Buyeo (부여 궁남지 출토 짚신의 보존처리)

  • Na, Mi-Sun;Kim, Ik-Joo;Kim, Kyeong-Hee
    • Journal of Conservation Science
    • /
    • v.17 s.17
    • /
    • pp.65-72
    • /
    • 2005
  • To preserve straw sandals excavated at Goongnamji site, this study examined the weight change rate by applying the methods of Primal MC-76 and vacuum freeze-drying used mostly as a earth-layer hardening material among PEG and acrylic resin, which are applied widely for preservation of waterlogged archaeological wood, as a means to preserve plant-based cultural properties along with the examination of the subject material. An experiment was also performed on moisture absorption after treatment. The materials of sandals were identified as Typha spp. The weight change experiment revealed that the vacuum freeze-drying after being treated with PEG 2-Step showed the most stabilized changes in weight, while it offered the smallest change in color as well.

  • PDF

SUMS OF TRIPOTENT AND NILPOTENT MATRICES

  • Abdolyousefi, Marjan Sheibani;Chen, Huanyin
    • Bulletin of the Korean Mathematical Society
    • /
    • v.55 no.3
    • /
    • pp.913-920
    • /
    • 2018
  • Let R be a 2-primal strongly 2-nil-clean ring. We prove that every square matrix over R is the sum of a tripotent and a nilpotent matrices. The similar result for rings of bounded index is proved. We thereby provide a large class of rings over which every matrix is the sum of a tripotent and a nilpotent matrices.

On the Relationship between $\varepsilon$-sensitivity Analysis and Sensitivity Analysis using an Optimal Basis

  • Park, Chan-Kyoo;Kim, Woo-Je;Park, Soondal
    • Management Science and Financial Engineering
    • /
    • v.10 no.2
    • /
    • pp.103-118
    • /
    • 2004
  • $\epsilon$-sensitivity analysis is a kind of methods for performing sensitivity analysis for linear programming. Its main advantage is that it can be directly applied for interior-point methods with a little computation. Although $\epsilon$-sensitivity analysis was proposed several years ago, there have been no studies on its relationship with other sensitivity analysis methods. In this paper, we discuss the relationship between $\epsilon$-sensitivity analysis and sensitivity analysis using an optimal basis. First. we present a property of $\epsilon$-sensitivity analysis, from which we derive a simplified formula for finding the characteristic region of $\epsilon$-sensitivity analysis. Next, using the simplified formula, we examine the relationship between $\epsilon$-sensitivity analysis and sensitivity analysis using optimal basis when an $\epsilon$-optimal solution is sufficiently close to an optimal extreme solution. We show that under primal nondegeneracy or dual non degeneracy of an optimal extreme solution, the characteristic region of $\epsilon$-sensitivity analysis converges to that of sensitivity analysis using an optimal basis. However, for the case of both primal and dual degeneracy, we present an example in which the characteristic region of $\epsilon$-sensitivity analysis is different from that of sensitivity analysis using an optimal basis.

Extended Adaptively Sampled Distance Fields Method for Rendering Implicit Surfaces with Sharp Features (음함수 곡면의 날카로운 형상 가시화를 위한 확장 Adaptively Sampled Distance Fields 방법)

  • Cha J.H.;Lee K.Y.;Kim T.W.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.10 no.1
    • /
    • pp.27-39
    • /
    • 2005
  • Implicit surfaces are geometric shapes which are defined by implicit functions and exist in three-dimensional space. Recently, implicit surfaces have received much attention in solid modeling applications because they are easy to represent the location of points and to use boolean operations. However, it is difficult to chart points on implicit surfaces for rendering. As efficient rendering method of implicit surfaces, the original Adaptively Sampled Distance Fields (ADFs) $method^{[1]}$ is to use sampled distance fields which subdivide the three dimensional space of implicit surfaces into many cells with high sampling rates in regions where the distance field contains fine detail and low sampling rates where the field varies smoothly. In this paper, in order to maintain the sharp features efficiently with small number of cells, an extended ADFs method is proposed, applying the Dual/Primal mesh optimization $method^{[2]}$ to the original ADFs method. The Dual/Primal mesh optimization method maintains sharp features, moving the vertices to tangent plane of implicit surfaces and reconstructing the vertices by applying a curvature-weighted factor. The proposed extended ADFs method is applied to several examples of implicit surfaces to evaluate the efficiency of the rendering performance.

POLYNOMIAL CONVERGENCE OF PRIMAL-DUAL ALGORITHMS FOR SDLCP BASED ON THE M-Z FAMILY OF DIRECTIONS

  • Chen, Feixiang
    • Journal of applied mathematics & informatics
    • /
    • v.30 no.1_2
    • /
    • pp.127-133
    • /
    • 2012
  • We establish the polynomial convergence of a new class of path-following methods for SDLCP whose search directions belong to the class of directions introduced by Monteiro [3]. We show that the polynomial iteration-complexity bounds of the well known algorithms for linear programming, namely the short-step path-following algorithm of Kojima et al. and Monteiro and Alder, carry over to the context of SDLCP.

Application of AutoFom III equipment for prediction of primal and commercial cut weight of Korean pig carcasses

  • Choi, Jung Seok;Kwon, Ki Mun;Lee, Young Kyu;Joeng, Jang Uk;Lee, Kyung Ok;Jin, Sang Keun;Choi, Yang Il;Lee, Jae Joon
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.31 no.10
    • /
    • pp.1670-1676
    • /
    • 2018
  • Objective: This study was conducted to enable on-line prediction of primal and commercial cut weights in Korean slaughter pigs by AutoFom III, which non-invasively scans pig carcasses early after slaughter using ultrasonic sensors. Methods: A total of 162 Landrace, Yorkshire, and Duroc (LYD) pigs and 154 LYD pigs representing the yearly Korean slaughter distribution were included in the calibration and validation dataset, respectively. Partial least squares (PLS) models were developed for prediction of the weight of deboned shoulder blade, shoulder picnic, belly, loin, and ham. In addition, AutoFom III's ability to predict the weight of the commercial cuts of spare rib, jowl, false lean, back rib, diaphragm, and tenderloin was investigated. Each cut was manually prepared by local butchers and then recorded. Results: The cross-validated prediction accuracy ($R^2cv$) of the calibration models for deboned shoulder blade, shoulder picnic, loin, belly, and ham ranged from 0.77 to 0.86. The $R^2cv$ for tenderloin, spare rib, diaphragm, false lean, jowl, and back rib ranged from 0.34 to 0.62. Because the $R^2cv$ of the latter commercial cuts were less than 0.65, AutoFom III was less accurate for the prediction of those cuts. The root mean squares error of cross validation calibration (RMSECV) model was comparable to the root mean squares error of prediction (RMSEP), although the RMSECV was numerically higher than RMSEP for the deboned shoulder blade and belly. Conclusion: AutoFom III predicts the weight of deboned shoulder blade, shoulder picnic, loin, belly, and ham with high accuracy, and is a suitable process analytical tool for sorting pork primals in Korea. However, AutoFom III's prediction of smaller commercial Korean cuts is less accurate, which may be attributed to the lack of anatomical reference points and the lack of a good correlation between the scanned area of the carcass and those traits.