نتایج جستجو برای: compromise programming
تعداد نتایج: 353087 فیلتر نتایج به سال:
The main objective of this study was determining the best sprinkler system and ranking total operational sprinkler systems in Isfahan province. The data was collected through 262 questionnaires completed by farmers in Feridan and Semirom cities in Isfahan province. Ranking and comparing the systems were done via criteria matrix and qualitative efficiency of objects and compromise programming. B...
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
A number of different types of final programming exams used or considered at the Department of Computer Science, Aalborg University, are identified and analyzed. Based on this analysis, a new type of programming exam is introduced called a Mini Project Programming (MIP) exam. MIP is a group-based programming assignment that is intended as a medium-scale programming effort followed by a final or...
In this work, a version of the technique for order preference by similarity ideal solution (TOPSIS) with entropic regularization approach is developed for solving the fuzzy multi-objective nonlinear programming (MONLP) problems. Applying the basic principle of compromise of TOPSIS, the fuzzy MONLP problem can be reduced into a fuzzy bi-objective nonlinear programming problem. Moreover, followin...
The main objective of this study was determining the best sprinkler system and ranking total operational sprinkler systems in Isfahan province. The data was collected through 262 questionnaires completed by farmers in Feridan and Semirom cities in Isfahan province. Ranking and comparing the systems were done via criteria matrix and qualitative efficiency of objects and compromise programming. B...
A disadvantage of the SDP (semidefinite programming) relaxation method for quadratic and/or combinatorial optimization problems lies in its expensive computational cost. This paper proposes a SOCP (second-order-cone programming) relaxation method, which strengthens the lift-and-project LP (linear programming) relaxation method by adding convex quadratic valid inequalities for the positive semid...
Planning of sewer systems typically involves limitations and problems, regardless whether traditional planning methods or optimization models are used. Such problems include non-quantifiability, fuzzy objectives, uncertainties in decision-making variables which commonly applied the any process. Particularly, have prevented inclusion these models. Consequently, theoretical optional solution math...
Interval AHP was proposed to express the decision maker’s vague evaluations on criteria by interval weights from a given pairwise comparison matrix. It has been extended to group decision problems. Three complementary approaches have been proposed: the perfect incorporation approach for counting out indubitably inferior alternatives and the common ground and partial incorporation approaches for...
Recent experiments demonstrated the effectiveness of pair programming in terms of quality and productivity. Growing interest towards global software development is fostering the design of suitable methods and tools for distributing software processes, at any level of detail, from entire subprocesses up to a single activity. Consequently, people placed in different locations could also share pro...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید