نتایج جستجو برای: inverse linear programming
تعداد نتایج: 846615 فیلتر نتایج به سال:
this paper proposes a suitable benchmark for inefficient commercial bank branches by using data envelopment analysis (dea). in order to render an inefficient bank branch efficient, it is necessary to decrease inputs and increase outputs. as there are priorities for decreasing some certain inputs and increasing some certain outputs over other inputs and outputs, respectively, it is necessary to ...
In this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear programming (abbreviated to FFLP) problems. Also, we employ linear programming (LP) with equality constraints to find a nonegative fuzzy number vector x which satisfies Ax =b, where A is a fuzzy number matrix. Then we investigate the existence of a positive solution of fully fuzzy linear system (FFLS).
Bilevel linear programming is a decision making problem with a two-level decentralized organization. The textquotedblleft leadertextquotedblright~ is in the upper level and the textquotedblleft followertextquotedblright, in the lower. Making a decision at one level affects that at the other one. In this paper, bilevel linear programming with inexact parameters has been studied and a method is...
in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.
چکیده ندارد.
linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints. in this paper, to solve this problem, we combine a discretization method and a neural network method. by a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem. then, we use...
A surjective space transformation technique is used to convert an original dual linear programming problem with equality and inequality constraints into a problem involving only equality constraints. Continuous and discrete versions of the stable gradient projection method are applied to the reduced problem. The numerical methods involve performing inverse transformations. The convergence rate ...
in the linear system ax = b the points x are sometimes constrained to lie in a given subspace s of column space of a. drazin inverse for any singular or nonsingular matrix, exist and is unique. in this paper, the singular consistent or inconsistent constrained linear systems are introduced and the effect of drazin inverse in solving such systems is investigated. constrained linear system arise ...
the linear system of equations ax = b where a = [aij ] in cn.n is a crispsingular matrix and the right-hand side is a fuzzy vector is called a singularfuzzy linear system of equations. in this paper, solving singular fuzzy linearsystems of equations using generalized inverses such as drazin inverse andpseudo-inverse are investigated.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید