نتایج جستجو برای: inverse linear programming
تعداد نتایج: 846615 فیلتر نتایج به سال:
the fuzzy linear regression model with fuzzy input-output data andcrisp coefficients is studied in this paper. a linear programmingmodel based on goal programming is proposed to calculate theregression coefficients. in contrast with most of the previous works, theproposed model takes into account the centers of fuzzy data as animportant feature as well as their spreads in the procedure ofconstr...
in this paper, a mathematical method is proposed to formulate a generalized ordering problem. this model is formed as a linear optimization model in which some variables are binary. the constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. on the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
In this paper we consider the inverse and reverse network facility location problems with considering the equity on servers. The inverse facility location with equality measure deals with modifying the weights of vertices with minimum cost, such that the difference between the maximum and minimum weights of clients allocated to the given facilities is minimized. On the other hand, the reverse c...
Abstract In this paper, weak optimal inverse problems of interval linear programming (IvLP) are studied based on KKT conditions. Firstly, the problem is precisely defined. Specifically, by adjusting minimum change current cost coefficient, a given solution can become optimal. Then, an equivalent characterization IvLP obtained. Finally, simplified without coefficient null variable.
Abstract Several applications in medical imaging and non-destructive material testing lead to inverse elliptic coefficient problems, where an unknown function PDE is be determined from partial knowledge of its solutions. This usually a highly non-linear ill-posed problem, for which unique reconstructability results, stability estimates global convergence numerical methods are very hard achieve....
A Chance-Constrained Programming Model for Inverse Spanning Tree Problem with Uncertain Edge Weights
The inverse spanning tree problem is to make a given spanning tree be a minimum spanning tree on a connected graph via a minimum perturbation on its edge weights. In this paper, a chance-constrained programming model is proposed to handle the inverse spanning tree problem where the edge weights are assumed to be uncertain variables. It is shown that such an uncertain minimum spanning tree can b...
in this paper, we use parametric form of fuzzy number and we converta fuzzy linear system to two linear system in crisp case. conditions for the existence of a minimal solution to $mtimes n$ fuzzy linear equation systems are derived and a numerical procedure for calculating the minimal solution is designed. numerical examples are presented to illustrate the proposed method.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید