• Title/Summary/Keyword: Minimax Theorem

Search Result 25, Processing Time 0.022 seconds

FIXED POINT THEOREMS, SECTION PROPERTIES AND MINIMAX INEQUALITIES ON K-G-CONVEX SPACES

  • Balaj, Mircea
    • Journal of the Korean Mathematical Society
    • /
    • v.39 no.3
    • /
    • pp.387-395
    • /
    • 2002
  • In [11] Kim obtained fixed point theorems for maps defined on some “locally G-convex”subsets of a generalized convex space. Theorem 2 in Kim's article determines us to introduce, in this paper, the notion of K-G-convex space. In this framework we obtain fixed point theorems, section properties and minimax inequalities.

MINIMAX PROBLEMS OF UNIFORMLY SAME-ORDER SET-VALUED MAPPINGS

  • Zhang, Yu;Li, Shengjie
    • Bulletin of the Korean Mathematical Society
    • /
    • v.50 no.5
    • /
    • pp.1639-1650
    • /
    • 2013
  • In this paper, a class of set-valued mappings is introduced, which is called uniformly same-order. For this sort of mappings, some minimax problems, in which the minimization and the maximization of set-valued mappings are taken in the sense of vector optimization, are investigated without any hypotheses of convexity.

A Note on a Theorem by Parida and Sen

  • Im, Sung-Mo;Kim, Won Kyu
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.1 no.1
    • /
    • pp.3-6
    • /
    • 1988
  • In a recent paper, Parida and Sen obtained a variational-like inequality. In this note, we obtain another variational-like inequality using Fan's minimax inequality [1] and Michael's selection theorem [2]. Also we generalize the Parida-Sen theorem in Banach spaces.

  • PDF

SADDLE POINTS OF VECTOR-vALUED FUNCTIONS IN TOPOLOGICAL VECTOR SPACES

  • Kim, In-Sook
    • Journal of the Korean Mathematical Society
    • /
    • v.37 no.5
    • /
    • pp.849-856
    • /
    • 2000
  • We give a new saddle point theorem for vector-valued functions on an admissible compact convex set in a topological vector space under weak condition that is the semicontinuity of two function scalarization and acyclicty of the involved sets. As application, we obtain the minimax theorem.

  • PDF

Best simulaneous approximations in a normed linear space

  • Park, Sung-Ho
    • Bulletin of the Korean Mathematical Society
    • /
    • v.33 no.3
    • /
    • pp.367-376
    • /
    • 1996
  • We characterize best simultaneous approximations from a finite-dimensional subspace of a normed linear space. In the characterization we reveal usefulness of a minimax theorem presented in [2,4].

  • PDF

ON A VARIATIONAL INEQUALITY WITH $\mathcal{C}$-CONCAVITY

  • Kim, Won Kyu;Lee, Kyoung Hee
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.22 no.1
    • /
    • pp.11-16
    • /
    • 2009
  • In this paper, using the diagonally $\mathcal{C}$-concave condition, we will prove a functional inequality in a topological space, and as an application, we can obtain a new variational inequality.

  • PDF

Composite Design Criteria : Model and Variance (복합실험기준의 설정: 모형과 분산구조)

  • 김영일
    • The Korean Journal of Applied Statistics
    • /
    • v.13 no.2
    • /
    • pp.393-405
    • /
    • 2000
  • Box and Draper( 19(5) listed some properties of a design that should be considered in design selection. But it is impossible that one design criterion from optimal experimental design theory reflects many potential objectives of an experiment, because the theory was originally based on the underlying model and its strict assumption about the error structure. Therefore, when it is neces::;ary to implement multi-objective experimental design. it is common practice to balance out the several optimal design criteria so that each design criterion involved benefits in terms of its relative "high" efficiency. In this study, we proposed several composite design criteria taking the case of heteroscedastic model. WVhen the heteroscedasticity is present in the model. the well known equivalence theorem between 1)- and C-optimality no longer exists and furthermore their design characteristics are sometimes drastically different. We introduced three different design criteria for this purpose: constrained design, combined design, and minimax design criteria. While the first two methods do reflect the prior belief of experimenter, the last one does not take it into account. which is sometimes desirable. Also we extended this method to the case when there are uncertainties concerning the error structure in the model. A simple algorithm and concluslOn follow.On follow.

  • PDF

Proof of the Variability Propagation Principle in a Pull Serial Line : Existence and Measurement (풀흐름라인에서 변동성전파원리에 대한 증명 : 존재와 측정)

  • Choe, Sang-Woong
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.27 no.4
    • /
    • pp.185-205
    • /
    • 2002
  • In this study, we consider infinite supply of raw materials and backlogged demands as given two boundary conditions. And we need not make any specific assumptions about the inter-arrival of external demand and service time distributions. Under these situations, the ultimate objective of this study is to prove the variability propagation principle in a pull serial line and is to measure it in terms of the first two moments of the inter-departure process subject to number of cards in each cell. Two preparations are required to achieve this objective : The one is to derive a true lower bound of variance of the inter-departure process. The other is to establish a constrained discrete minimax problem for the no backorder (backlogging) probabilities in each cell. We may get some fundamental results necessary to a completion for the proof through the necessary and sufficient conditions for existence of optimal solution of a constrained discrete minimax problem and the implicit function theorem. finally, we propose a numeric model to measure the variability propagation principle. Numeric examples show the validity and applicability of our study.