نتایج جستجو برای: objective linear programming
تعداد نتایج: 1285157 فیلتر نتایج به سال:
This paper gives a brief introduction into multiple objective linear programming and discusses its possibilities in the area of forest management. We overview basic concepts, formulations, and principles of solving multiple objective linear programming problems. As such problems s always require the intervention of a decision-maker behavioral aspectsare also considered. We use an application by...
Most research has focused on multi-objective issues in its definitive form, with decision-making coefficients and variables assumed to be objective and constraint functions. In fact, due to inaccurate and ambiguous information, it is difficult to accurately identify the values of the coefficients and variables. Interval arithmetic is appropriate for describing and solving uncertainty and inaccu...
This paper discussed the scheduling problem of outpatients in a radiology center with an emphasis on priority. To more compatibility to real-world conditions, we assume that the elapsed times in different stages to be uncertain that follow from the specific distribution function. The objective is to minimize outpatients’ total spent time in a radiology center. The problem is formulated as a fle...
This paper proposes a compromise model, based on a new method, to solve the multiobjectivelarge scale linear programming (MOLSLP) problems with block angular structureinvolving fuzzy parameters. The problem involves fuzzy parameters in the objectivefunctions and constraints. In this compromise programming method, two concepts areconsidered simultaneously. First of them is that the optimal alter...
We present a new exact approach for solving bi-objective integer linear programs. The new approach efficiently employs two of the existing exact algorithms in the literature, including the balanced box and the -constraint methods, in two stages. A computationally study shows that (1) the new approach solves less single-objective integer linear programs in comparison to the balanced box method, ...
This study presents a method to determine weights of objectives in multi objective linear programming without decision maker/s preference. The method is developed by modifying Belenson and Kapur’s approach under fuzziness. It is used two-person zero-sum game with mixed strategies. Degree of linear membership functions of objectives are used in pay-off matrix. The proposed method is shown with a...
Optimization of the ratio of two functions is called fractional programming or ratio optimization problem. If one can optimize simultaneously collection of fractional objective functions then the problem is called multi-objective fractional programming. This paper presents a survey on fractional programming problems. In contrast, this survey excludes many of the technical details and provides a...
In this paper, two approaches were introduced to obtain Stackelberg solutions for two-level linear fractional programming problems with interval coefficients in the objective functions. The approaches were based on the Kth best method and the method for solving linear fractional programming problems with interval coefficients in the objective function. In the first approach, linear fractional p...
Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید