نتایج جستجو برای: Linear mix-integer programming
تعداد نتایج: 826461 فیلتر نتایج به سال:
this paper presents a genetic algorithm (ga) for solving a generalized model of single-item resource-constrained aggregate production planning (app) with linear cost functions. app belongs to a class of pro-duction planning problems in which there is a single production variable representing the total production of all products. we linearize a linear mixed-integer model of app subject to hiring...
In the university timetabling problem, necessity of considering variables corresponding to lessons, teachers, classes, days of the week and hours bring about a large scale mix integer linear programming problem. Usually the problem is so big that the exact mathematical programming solvers can not solve them in a small period of time. So variety of heuristic algorithms is proposed to solve such...
Data Envelopment Analysis (DEA) cannot provide adequate discrimination among efficient decision making units (DMUs). To discriminate these efficient DMUs is an interesting research subject. The purpose of this paper is to develop the mix integer linear model which was proposed by Foroughi (Foroughi A.A. A new mixed integer linear model for selecting the best decision making units in data envelo...
in this paper, a mathematical method is proposed to formulate a generalized ordering problem. this model is formed as a linear optimization model in which some variables are binary. the constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. on the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
product mix problem (pmp) is one of the most important and complicated problems in production systems. different approaches have been applied to solve this problem, among them, theory of constraints (toc) has been widely considered since 1990s. this paper develops a distinguished algorithm to solve product mix prob-lems that is efficient both in single and multi-bottleneck problems. at first, t...
an interactive heuristic approach can offer a practical solution to the problem of linear integer programming (lip) by combining an optimization technique with the decision maker’s (dm) judgment and technical supervision. this is made possible using the concept of bicriterion linear programming (blp) problem in an integer environment. this model proposes two bicriterion linear programs for iden...
abstract this thesis includes five chapter : the first chapter assign to establish fuzzy mathematics requirement and introduction of liner programming in thesis. the second chapter we introduce a multilevel linear programming problems. the third chapter we proposed interactive fuzzy programming which consists of two phases , the study termination conditions of algorithm we show a satisfac...
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...
One of the most important decision making problems in many production systems is identification and determination of products and their quantities according to available resources. This problem is called product-mix. However, in the real-world situations, for existing constrained resources, many companies try to provide some products from external resources to achieve more profits. In this pape...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید