• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.2
• /
• pp.147-156
• /
• 1993

Recently a new concept of shadow prices, called average shadow price, has been developed. This paper provides a dual problem and the corresponding duality theorems justifying this new shadow price. The general duality framework is used. As an important secondary result, a new reduced class of price function, the pp. h.-class, has been developed for the general duality theory. This should be distinguished from other known reductions achieved in some specific areas of mathematical programming, in that it sustains the strong duality property in all the mathematical programs. The new general dual problem suggested with this pp. h.-class provides, as an optimal solution, the average shadow prices.

• The Pure and Applied Mathematics
• /
• v.5 no.1
• /
• pp.23-32
• /
• 1998

In the present paper the author studies the decomposition property ($\delta$) of the bounded linear operators.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.5
• /
• pp.19-26
• /
• 2019

In this paper, we consider the D2D Transmitter(Tx) and Receiver(Rx) pair assignment problem in the cellular system. Sharing the resource of the cellular system, D2D users may cause interference to the cellular system, though it is beneficial to improve the D2D user Capacity. Therefore, to protect the cellular users, D2D transmit power should be carefully controlled. Previously, optimal Tx-Rx assignment to minimize the total transmit power of users was investigated. Accordingly, the iterative algorithm to find the optimum Tx-Rx asignment was obtained. In this work, we consider the case where Tx group users becomes Rx group users, and Rx group users become Tx group users. We prove that the Tx-Rx assignment problem has the duality property. We present the numerical examples that show the duality between U-link and D-link.

• Communications for Statistical Applications and Methods
• /
• v.11 no.2
• /
• pp.213-225
• /
• 2004

A fixed-strike lookback option is an option whose payoff is determined by the maximum (or minimum) price of the underlying asset within the option's life. Under the Black-Scholes framework, the time-t price of an equity asset follows a geometric Brownian motion. Applying the method of Esscher transforms, this paper will derive explicit pricing formulas for fixed-strike lookback call and put options, respectively. In addition, this paper will show a relationship (duality property) between the pricing formulas of the call and put options. Finally, this paper will derive explicit pricing formulas for the fixed-strike lookback options when their underlying asset pays dividends continuously at a rate proportional to its price.

• Journal of Advanced Navigation Technology
• /
• v.11 no.4
• /
• pp.388-393
• /
• 2007

In designing transform coders bit allocation is one of the important issues. In this paper we propose two optimal algorithms for integer bit allocation in transform coding. Based on high-resolution formulas for bit allocation, the most and least greedy algorithms are developed to optimally adjust non-integer bit rates of coefficient quantizers to integer values. In particular, a duality property is observed between the two greedy algorithms.

• Communications of the Korean Mathematical Society
• /
• v.35 no.2
• /
• pp.401-415
• /
• 2020

It is well-known that if char𝕜 = 0, then an Artinian monomial complete intersection quotient 𝕜[x₁, …, x_n]/(x₁^a₁, …, x_n^a_n) has the strong Lefschetz property in the narrow sense, and it is decomposed by the direct sum of irreducible 𝖘𝖑₂-modules. For an Artinian ring A = 𝕜[x₁, x₂, x₃]/(x₁⁶, x₂⁶, x₃⁶), by the Schur-Weyl duality theorem, there exist 56 trivial representations, 70 standard representations, and 20 sign representations inside A. In this paper we find an explicit basis for A, which is compatible with the S₃-module structure.

• Bulletin of the Korean Mathematical Society
• /
• v.42 no.2
• /
• pp.387-396
• /
• 2005

In the setting of the half-plane of the complex plane, we introduce a modified reproducing kernel and we show that for $r>-1/2,\;B^{1,r}-cancellation$ property holds and the Bloch space is the dual space of $B^{1,r}$.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.2
• /
• pp.165-170
• /
• 2016

The characteristic and application of a new duality structure in the $NCV-{\mid}v_1$ > library is studied in this paper. All unitary operations on arbitrarily many qudit's n can be expressed as composition of one- and two-qudit $NCV-{\mid}v_1$ > libraries if their state vectors are eigenvectors. This research provides an extended realization from Barenco's many bits n operator(U(2n)) which is applicable to only all positive polarity statevectors to whole polarity ones. At the control gate synthesis of a unitary operator, such an enhanced expansion is possible due to their symmetric duality property in the case of using both $NCV-{\mid}v_1$ > and $NCV^{\dag}-{\mid}v_1$ > libraries which make the AND predominantly dependent cascade synthesis possible.

• Bulletin of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.273-285
• /
• 1997

The aim of this paper is to present theorems on the exitence of zeros for mappings defined on convex subsets of topological vector spaces with values in a vector space. In addition to natural assumptions of continuity, convexity, and compactness, the mappings are subject to some geometric conditions. In the first theorem, the mapping satisfies a "Darboux-type" property expressed in terms of an auxiliary numerical function. Typically, this functions is, in this case, related to an order structure on the target space. We derive an existence theorem for "obtuse" quasiconvex mappings with values in an ordered vector space. In the second theorem, we prove the existence of a "common zero" for an arbitrary (not necessarily countable) family of mappings satisfying a general "inwardness" condition againg expressed in terms of numerical functions (these numerical functions could be duality pairings (more generally, bilinear forms)). Our inwardness condition encompasses classical inwardness conditions of Leray-Schauder, Altman, or Bergman-Halpern types.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.3
• /
• pp.33-46
• /
• 2007

This study deals with the adaptive multiuser OFDM (Orthogonal Frequency Division Multiplexing) system which adjusts the resource allocation according to the environmental changes in such as wireless and quality of service required by users. The resource allocation includes subcarrier assignment to users, modulation method and power used for subcarriers. We first develop a general optimization model which maximizes data throughput while satisfying data rates required by users and total power constraints. Based on the property that this problem has the 0 duality gap, we apply the subgradient dual optimization method which obtains the solution of the dual problem by iteration of simple calculations. Extensive experiments with realistic data have shown that the subgradient dual method is applicable to the real world system, and can be used as a dynamic resource allocation mechanism.