نتایج جستجو برای: f uzzy integer programming
تعداد نتایج: 651866 فیلتر نتایج به سال:
a modified method to determine a well-dispersed subset of non-dominated vectors of an momilp problem
this paper uses the l1−norm and the concept of the non-dominated vector, topropose a method to find a well-dispersed subset of non-dominated (wdsnd) vectorsof a multi-objective mixed integer linear programming (momilp) problem.the proposed method generalizes the proposed approach by tohidi and razavyan[tohidi g., s. razavyan (2014), determining a well-dispersed subset of non-dominatedvectors of...
This paper formalizes the problem of solving multi-sentence algebraic word problems as that of generating and scoring equation trees. We use integer linear programming to generate equation trees and score their likelihood by learning local and global discriminative models. These models are trained on a small set of word problems and their answers, without any manual annotation, in order to choo...
the determination of the ultimate pit limit (upl) is the first step in the open pit mine planning process. in this stage that parts of the mineral deposit that are economic to mine are determined. there are several mathematical, heuristic and meta-heuristic algorithms to determine upl. the optimization criterion in these algorithms is maximization of the total profit whilst satisfying the...
In this paper, some KKT type sufficient global optimality conditions for general mixed integer nonlinear programming problems with equality and inequality constraints (MINPP) are established. We achieve this by employing a Lagrange function for MINPP. In addition, verifiable sufficient global optimality conditions for general mixed integer quadratic programming problems are der...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید