Search results for "Semi-infinite"
showing 7 items of 17 documents
Solving a class of fuzzy linear programs by using semi-infinite programming techniques
2004
This paper deals with a class of Fuzzy Linear Programming problems characterized by the fact that the coefficients in the constraints are modeled as LR-fuzzy numbers with different shapes. Solving such problems is usually more complicated than finding a solution when all the fuzzy coefficients have the same shape. We propose a primal semi-infinite algorithm as a valuable tool for solving this class of Fuzzy Linear programs and, we illustrate it by means of several examples.
The multi-scattering model for calculations of positron spatial distribution in the multilayer stacks, useful for conventional positron measurements
2013
The spatial distribution of positrons emitted from radioactive isotopes into stacks or layered samples is a subject of the presented report. It was found that Monte Carlo (MC) simulations using GEANT4 code are not able to describe correctly the experimental data of the positron fractions in stacks. The mathematical model was proposed for calculations of the implantation profile or positron fractions in separated layers or foils being components of a stack. The model takes into account only two processes, i.e., the positron absorption and backscattering at interfaces. The mathematical formulas were applied in the computer program called LYS-1 (layers profile analysis). The theoretical predic…
New descent rules for solving the linear semi-infinite programming problem
1994
The algorithm described in this paper approaches the optimal solution of a continuous semi-infinite linear programming problem through a sequence of basic feasible solutions. The descent rules that we present for the improvement step are quite different when one deals with non-degenerate or degenerate extreme points. For the non-degenerate case we use a simplex-type approach, and for the other case a search direction scheme is applied. Some numerical examples illustrating the method are given.
A multi-local optimization algorithm
1998
The development of efficient algorithms that provide all the local minima of a function is crucial to solve certain subproblems in many optimization methods. A “multi-local” optimization procedure using inexact line searches is presented, and numerical experiments are also reported. An application of the method to a semi-infinite programming procedure is included.
Convex semi-infinite games
1986
This paper introduces a generalization of semi-infinite games. The pure strategies for player I involve choosing one function from an infinite family of convex functions, while the set of mixed strategies for player II is a closed convex setC inRn. The minimax theorem applies under a condition which limits the directions of recession ofC. Player II always has optimal strategies. These are shown to exist for player I also if a certain infinite system verifies the property of Farkas-Minkowski. The paper also studies certain conditions that guarantee the finiteness of the value of the game and the existence of optimal pure strategies for player I.
An overview of semi-infinite programming theory and related topics through a generalization of the alternative theorems
1984
We propose new alternative theorems for convex infinite systems which constitute the generalization of the corresponding toGale, Farkas, Gordan andMotzkin. By means of these powerful results we establish new approaches to the Theory of Infinite Linear Inequality Systems, Perfect Duality, Semi-infinite Games and Optimality Theory for non-differentiable convex Semi-Infinite Programming Problem.
Scaling theory of star polymers and general polymer networks in bulk and semi-infinite good solvents
1988
Theorie d'echelle utilisant l'equivalence entre la fonction generatrice du nombre total de configuration et la fonction de correlation a plusieurs spins du modele de Heisenberg classique a n composantes dans la limite n→0