• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.2
• /
• pp.273-278
• /
• 2009

The determination of the associated weights in the theory of ordered weighted averaging (OWA) operators is one of the important issue. Recently, Wang and Parkan [Information Sciences 175 (2005) 20-29] proposed a minimax disparity approach for obtaining OWA operator weights and the approach is based on the solution of a linear program (LP) model for a given degree of orness. Recently, Liu [International Journal of Approximate Reasoning, accepted] showed that the minimum variance OWA problem of Fuller and Majlender [Fuzzy Sets and Systems 136 (2003) 203-215] and the minimax disparity OWA problem of Wang and Parkan always produce the same weight vector using the dual theory of linear programming. In this paper, we give an improved proof of the minimax disparity problem of Wang and Parkan while Liu's method is rather complicated. Our method gives the exact optimum solution of OWA operator weights for all levels of orness, $0\leq\alpha\leq1$, whose values are piecewise linear and continuous functions of $\alpha$.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.8 no.12
• /
• pp.1-6
• /
• 1985

The purpose of this study is to consider the criteria for decision-making of facility location in view of Minimax. As an illustration of the location of storerooms in a manufacturing plant that minimizes the maximum distance workers must travel to reach a storeroom, the number and variety of location problems that can be formulated appropriately as minimax problems are sizable. A minimax solution can be interpreted as a grease the squeaky wheel solution In solving a minimax location problem, costs other than the maximum cost are not considered.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.401-418
• /
• 2005

In this paper, a dual algorithm, based on a smoothing function of Bertsekas (1982), is established for solving unconstrained minimax problems. It is proven that a sequence of points, generated by solving a sequence of unconstrained minimizers of the smoothing function with changing parameter t, converges with Q-superlinear rate to a Kuhn-Thcker point locally under some mild conditions. The relationship between the condition number of the Hessian matrix of the smoothing function and the parameter is studied, which also validates the convergence theory. Finally the numerical results are reported to show the effectiveness of this algorithm.

• Journal of the Korean Statistical Society
• /
• v.25 no.1
• /
• pp.95-110
• /
• 1996

We consider the question of efficiency of the Bayes sequential procedure with respect to the optimal fixed sample size Bayes procedure in a simple vs. simple testing problem for data coming from a general nonregular density b(.theta.)h(x)l(x < .theta.). Efficiency is defined in two different ways in these caiculations. Also, the minimax sequential risk (and minimax sequential stratage) is studied as a function of the cost of sampling.

• Journal of applied mathematics & informatics
• /
• v.37 no.3_4
• /
• pp.201-205
• /
• 2019

This note provides the solution equivalence of general minimum variance and minimax disparity problems for OWA operator. This result generalize a main theorem of Liu [International Journal of Approximate Reasoning, 48 (2008) 598-627.]

• 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.

• Korean Journal of Mathematics
• /
• v.6 no.1
• /
• pp.27-46
• /
• 1998

We are concerned with an optimal control problem governed by a Poisson equation in which body force acts like a control parameter. The cost functional to be optimized is taken to represent the error from the desired observation and the cost due to the control. We recast the problem into the mixed formulation to take advantage of the minimax principle for the duality method. The existence of a saddle point for the Lagrangian shall be shown and the optimality system will be derived therein. Finally, to attain an optimal control, we combine the optimality system with an operational technique. By achieving the gradient of the cost functional, a convergent algorithm based on the projected gradient method is established.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.7 no.2
• /
• pp.41-48
• /
• 1982

This paper presents an efficient algorithm for finding a new facility(center) in the Euclidean plane in accordance with minimax criterion: that is, the facility is located to minimize the maximum weighted Euclidean distance. The method given in this paper involves computational geometry. Some possible extensions of this problem are also discussed.

• Journal of the military operations research society of Korea
• /
• v.5 no.2
• /
• pp.15-25
• /
• 1979

Single-period inventory problems such as the newspaper boy problem having quadratic cost functions for both shortages and overage are examined to determine the optimal order level under various principles of choice such as minimum expected cost, aspiration level, and minimax regret. Procedures for finding the optimum order levels are developed for both continuous and discrete demand patterns.

• Journal of the Korean Statistical Society
• /
• v.27 no.2
• /
• pp.153-163
• /
• 1998

We investigate density estimation problem in the L$^{\infty}$ norm and show that the iii optimal minimax rates are achieved for smooth classes of weakly dependent stationary sequences. Our results are then applied to give uniform convergence rates for various problems including the Gibbs sampler.