نتایج جستجو برای: multiple constraints
تعداد نتایج: 926744 فیلتر نتایج به سال:
شناسایی و مدلسازی یک لوپ صنعتی واقعی در این پروژه انجام شده است.ابتدا شناسایی به روش arx انجام گردیده که به علت عدم مطلوب بودن نتایج با استفاده از روش multiple model به نواحی قطعه ای خطی تبدیل گردیده و برای هر ناحیه شناسایی به روش arx انجام شده است.پس از ترکیب نواحی،برای انتخاب اینکه در هر زمان کدام ناحیه خروجی مورد نظر راتولیدکند.از توابع عضویت فازی استفاده شده است.برای طراحی کنترلر ابتدا به و...
In this paper the real-world occurrence of the multiple-product multiple-constraint single period newsboy problem with two objectives, in which there is incremental discounts on the purchasing prices, is investigated. The constraints are the warehouse capacity and the batch forms of the order placements. The first objective of this problem is to find the order quantities such that the expected ...
The problem of finding a next best viewpoint for 3D modeling or scene mapping has been explored in computer vision over the last decade. This paper tackles a similar problem, but with different characteristics, and proposes a method for dynamic best viewpoint recovery of a target point while avoiding possible occlusions. Since the environment can change, the method has to iteratively find the n...
For a long time, the bilevel programming problem has essentially been considered as a special case of mathematical programs with equilibrium constraints (MPECs), in particular when the so-called KKT reformulation is in question. Recently though, this widespread believe was shown to be false in general. In this paper, other aspects of the difference between both problems are revealed as we consi...
This paper addresses two second-best toll pricing problems, one with fixed and the other with elastic travel demands, as mathematical programs with equilibrium constraints. Several equivalent nonlinear programming formulations for the two problems are discussed. One formulation leads to properties that are of interest to transportation economists. Another produces an algorithm that is capable o...
This paper introduces six ways for handling a chain of lexicographic ordering constraint between the origins of identical orthotopes (e.g., rectangles, boxes, hyper-rectangles) subject to the fact that they should not pairwise overlap. While the first two ways deal with the integration of a chain of lexicographic ordering constraint within a generic geometric constraint kernel, the four latter ...
Symmetry is an important feature of many constraint programs. We show that any problem symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different symmetries pick out different solutions in each symmetry class. This simple but powerful idea can be used in a number of different ways. We describe one application within model restarts, a search technique desi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید