Search results for "Mathematical optimization"
showing 10 items of 1300 documents
On central algorithms of approximation under fuzzy information
2005
We consider the problem of approximation of an operator by information described by n real characteristics in the case when this information is fuzzy. We develop the well-known idea of an optimal error method of approximation for this case. It is a method whose error is the infimum of the errors of all methods for a given problem characterized by fuzzy numbers in this case. We generalize the concept of central algorithms, which are always optimal error algorithms and in the crisp case are useful both in practice and in theory. In order to do this we define the centre of an L-fuzzy subset of a normed space. The introduced concepts allow us to describe optimal methods of approximation for lin…
Fuzzy expected utility
1984
Decision making under uncertainty requires not only measures of the uncertainty of situations that we try to recognize , but also an estimate of the imprecision from which they are determined. This imprecision can be the result either of a lack of exactness in the measure of the elements which are necessary to the determination of the states of nature or the purely subjective interpretation of these states. Through a subjective measure of the non-measurable imprecision, the purpose of the fuzzy expected utility, which is investigated, is to translate with a great accuracy the imprecise behaviour of the decision-maker in an uncertain world. Consequently we propose to introduce first the prob…
The fuzzy p-median problem
2004
In many location models, the strong crisp assumptions, like known demands and distances, are not realistic in most cases. The fuzzy p-median problem relaxes this hypothesis giving to the decision maker a necessary degree of freedom to solve real-world problems. It allows a decision maker to improve an optimal covering of a location problem by considering partially feasible solutions in which some demand is left uncovered. Here we revise the main facts and results about this problem emphasising different specific algorithms of resolution. Finally we show that this fuzzy version can be used to analyse the global structure of a given instance of the crisp problem.
Soft-computing based heuristics for location on networks: The p-median problem
2011
We propose a genetic algorithm for the fuzzy p-median problem in which the optimal transport cost of the associated crisp problem is unknown. Our algorithm works with two populations: in one, the solutions with a better crisp transport cost are favored by the selection criterion, whereas in the second one, solutions with a better fuzzy satisfaction level are preferred. These populations are not independent. On the contrary, the first one periodically invades the second one, thus providing new starting points for finding fuzzy improvements. Our computational results also reveal the importance of choosing adequate functions for selecting the parents. Our best results are obtained with functio…
Involving fuzzy orders for multi-objective linear programming
2012
This paper presents a solution approach for multi-objective linear programming problem. We propose to involve fuzzy order relations to describe the objective functions where in ”classical” fuzzy approach the membership functions which illustrate how far the concrete point is from the solution of individual problem are studied. Further the global fuzzy order relation is constructed by aggregating the individual fuzzy order relations. Thus the global fuzzy relation contains the information about all objective functions and in the last step we find a maximum in the set of constrains with respect to the global fuzzy order relation. We illustrate this approach by an example.
Controller Design Under Fuzzy Pole-Placement Specifications: An Interval Arithmetic Approach
2006
This paper discusses fuzzy specifications for robust controller design, as a way to define different specification levels for different plants in a family and allow the control of performance degradation. Controller synthesis will be understood as mapping a fuzzy plant onto a desired fuzzy set of closed-loop specifications. In this context, a fuzzy plant is considered as a possibility distribution on a given plant space. In particular, pole placement in linear plants with fuzzy parametric uncertainty is discussed, although the basic idea is general and could be applied to other settings. In the case under consideration, the controller coefficients are the solution of a fuzzy linear system o…
Mathematical Morphology Based on Fuzzy Operators
1993
A vision procedure may be considered as the repeated application of image operators until the vision goal is reached. The type of these operators and the spaces on which they are defined and act depends on the specific problem and on what we are searching on the image. Morphological operations, as filtering, edge detection, skeletonizing, and so on, are mainly required at low and medium levels of the vision procedure, where local and global knowledge is used to enhance the image information content, before a final decision about the image is taken.
Multipass machining optimization by using fuzzy possibilistic programming and genetic algorithms
1999
The paper deals with optimal determination of the cutting parameters in multipass machining operations. A new optimization approach is proposed which uses a possibilistic formulation of the classical optimization problem and optimizes the resulting possibilistic model using a genetic algorithm. The proposed approach makes it possible to find the optimal value of all the cutting parameters, including the depth of cut, in just one step. A numerical example is provided to compare the performance of the proposed method with other recent methods proposed in the literature. Furthermore, fuzzy data must be used in the formulation of the optimization problem and therefore a fuzzy possibilistic app…
G1 rational blend interpolatory schemes: a comparative study
2012
Interpolation of triangular meshes is a subject of great interest in many computer graphics related applications, as, for example, gaming and realtime rendering. One of the main approaches to interpolate the positions and normals of the mesh vertices is the use of parametric triangular Bezier patches. As it is well known, any method aiming at constructing a parametric, tangent plane (G^1) continuous surface has to deal with the vertex consistency problem. In this article, we propose a comparison of three methods appeared in the nineties that use a particular technique called rational blend to avoid this problem. Together with these three methods we present a new scheme, a cubic Gregory patc…
AMaLGaM IDEAs in noiseless black-box optimization benchmarking
2009
This paper describes the application of a Gaussian Estimation-of-Distribution (EDA) for real-valued optimization to the noiseless part of a benchmark introduced in 2009 called BBOB (Black-Box Optimization Benchmarking). Specifically, the EDA considered here is the recently introduced parameter-free version of the Adapted Maximum-Likelihood Gaussian Model Iterated Density-Estimation Evolutionary Algorithm (AMaLGaM-IDEA). Also the version with incremental model building (iAMaLGaM-IDEA) is considered.