In this paper, we will study the existence problem of minmax minimal torus. We use classical conformal invariant geometric variational methods. We prove a theorem about the existence of minmax minimal torus in Theorem 5.1. Firstly we prove a strong uniformization result(Proposition 3.1) using method of [1]. Then we use this proposition to choose good parametrization for our minmax sequences. We...

We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with a precision of ǫ log n digits (for any constant ǫ > 0) is NP-hard, where n is the size of the game. On the other hand, approximating the value with a precision of c log log n digits (for any constant c ≥ 1) can be done in quas...

In this paper we discuss a minmax regret version of the single machine scheduling problem with the total flow time criterion. Uncertain processing times are modeled by closed intervals. We show that if the deterministic problem is polynomially solvable, then its minmax regret version is approximable within 2.

Poverty is one of the crucial social problems in Tegal Regency, Central Java Province. Specific solutions are needed a particular area to effectively combat poverty. The purpose this study identify spatial distribution and pattern poverty Regency using Spatial Autocorrelation analysis (Moran’s Global Index & Local Indicator Autocorrelation/LISA) determine diversity factors that influence Ge...

The minmax regret problem for combinatorial optimization under uncertainty can be viewed as a zero-sum game played between an optimizing player and an adversary, where the optimizing player selects a solution and the adversary selects costs with the intention of maximizing the regret of the player. Existing minmax regret models consider only deterministic solutions/strategies, and minmax regret...

This paper addresses a version of the single-facility Maximal Covering Location Problem on network where demand is: (i) distributed along edges and (ii) uncertain with only known interval estimation. To deal this problem, we propose minmax regret model service facility can be located anywhere network. problem is called Minmax Regret (MMR-EMCLP). Furthermore, present two polynomial algorithms fo...

We formulate minmax flow problems as a DC. optimization problem. We then apply a DC. primal-dual algorithm to solve the resulting problem. The obtained computational results show that the proposed algorithm is efficient thanks to particular structures of the minmax flow problems.

This paper deals with mainly establishing numerous sets of generalized second-order parametric sufficient optimality conditions for a semiinfinite discrete minmax fractional programming problem, while the results on semiinfinite discrete minmax fractional programming problem are achieved based on some partitioning schemes under various types of generalized second-order (F ,β, φ, ρ, θ, m)-univex...