This paper puts forward a novel affine relaxation-based algorithm for solving the minimax affine fractional program problem (MAFPP) over a polyhedron set. First of all, some new variables are introduced for deriving the equivalence problem (EP) of the MAFPP. Then, for the EP, the affine ...
The development of LP is considered one of the most important scientific advances of the mid-20th century. A very efficient solution procedure for solving linear programs is the simplex algorithm. The simplex method proceeds by enumerating feasible solutions and improving the value of the objective f...
The simplex linear programming algorithm (Dantzig, 1963) is then employed to find mixed strategies for each player. The first stage of the simplex algorithm requires the addition of vectors of slack variables to the columns of the game matrix. These variables serve to transform the rows of the...
Additionally, some EinStein würfelt nicht programs continue to use conventional search algorithms from the Minimax series. For example, Li et al. [25] proposed an Offensive and Defensive Expect Minimax Algorithm to find optimal moves and achieved a high win rate using the traditional Expect ...
#include <cstdio>#include<cmath>#include<algorithm>usingnamespacestd;constintMAXN=1005;constintINF=0x3f3f3f3f;structNode{intx,y; }stone[MAXN];intn;doublemp[MAXN][MAXN];doubledist(intx1,inty1,intx2,inty2) {returnsqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)); ...
This paper presents a Turbo-Basic program that implements a revised version of a new algorithm for the fast and optimum solution of the general linear minimax approximation problem. The algorithm proceeds iteratively and terminates when the global minimum value of the objective function is reached. ...
For this problem we propose a mathematical model in the form of two-level hierarchical minimax program control problem of the final state of this process with incomplete information. For solving of its problem we constructed the common algorithm that has a form of a recurrent procedure of solving...
The article formalizes the problem under consideration and proposes a constructive solution method, which can serve as the basis for developing a numerical algorithm and creating a computer software application. The results presented in the paper can be used in the digitalization of decision-making ...
To select separation parameters nanosatellites from the found areas it is proposed to use a minimax criterion of a distance between them. The algorithm consists two stages. At the first stage after determining a set of nanosatellites separation parameters that have satisfied all the necessary ...
For the dynamical system under consideration, a mathematical formalization of a two-level hierarchical minimax program control problem in the presence of perturbations, and an algorithm for its solving are proposed. The construction of this algorithm can be implemented as a finite sequence of solutions...