نتایج جستجو برای: imprecise goal programming

تعداد نتایج: 550507  

Semu Mitiku Kassa Teklay Hailay Tsegay

Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of pro...

Kailash Lachhwani Mahaveer Prasad Poonia

In this paper, we show a procedure for solving multilevel fractional programming problems in a large hierarchical decentralized organization using fuzzy goal programming approach. In the proposed method, the tolerance membership functions for the fuzzily described numerator and denominator part of the objective functions of all levels as well as the control vectors of the higher level decision ...

Journal: :CoRR 2011
Sourya Roy Tyler Clemons S. M. Faisal Ke Liu Nikolaos Hardavellas Srinivasan Parthasarathy

§ Elastic Fidelity: exploit the inherent error-tolerance of applications to lower the energy consumption, and withstand the massive errors of future computing. § Allow some data to be imprecise § Programming language constructs and ISA extensions pass the fidelity requirements from application to hardware § Hardware models adjust the voltage to maintain fidelity guarantees § The execution syste...

The purpose of this paper is to evaluate the revenue efficiency in the fuzzy network data envelopment analysis‎. ‎Precision measurements in real-world data are not practically possible‎, ‎so assuming that data is crisp in solving problems is not a valid assumption‎. ‎One way to deal with imprecise data is fuzzy data‎. ‎In this paper‎, ‎linear ranking functions are used to transform the full fuz...

Journal: :International Journal of Approximate Reasoning 2010

1996
L. Mandow

The A* algorithm belongs to the class of best first graph-search algorithms and is frequently used to find minimum-cost paths. Recently, A* has been generalised to solve multiple-objective search problems, returning the set of non-dominated solution paths. This paper presents METAL-A*, an admissible heuristic search algorithm for search problems with lexicographic goals that returns the set of ...

Journal: :Journal of the Northeastern Agricultural Economics Council 1980

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید