نتایج جستجو برای: programming problem
تعداد نتایج: 1126233 فیلتر نتایج به سال:
in the present paper, we develop a modified pseudospectral scheme for solving an optimal control problem which is governed by a switched dynamical system. many real-world processes such as chemical processes, automotive systems and manufacturing processes can be modeled as such systems. for this purpose, we replace the problem with an alternative optimal control problem in which the switching t...
We develop an algorithm for the solution of multiobjective linear plus fractional programming problem (MOL+FPP) when some of the constraints are homogeneous in nature. Using homogeneous constraints, first we construct a transformation matrix T which transforms the given problem into another MOL+FPP with fewer constraints. Then, a relationship between these two problems, ensuring that the solu...
one of important problems in supply chains management is supplier selection. in a company, there are massive data from various departments so that extracting knowledge from the company’s data is too complicated. many researchers have solved this problem by some methods like fuzzy set theory, goal programming, multi objective programming, the liner programming, mixed integer programming, analyti...
In the most real-world applications, the parameters of the problem are not well understood. This is caused the problem data to be uncertain and indicated with intervals. Interval mathematical models include interval linear programming and interval nonlinear programming problems.A model of interval nonlinear programming problems for decision making based on uncertainty is interval quadratic prog...
In this paper, an integrated machine scheduling withits due date setting problem has been considered. It is assumed that the machine is subject to some kind of random unavailability. Due dates should be set in an attractive and reliable manner, implying that they should be short and possible to be met. To this end, first, long due dates are penalized in the objective function. Then, for each cu...
In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید