نتایج جستجو برای: mixed integer non linear programming

تعداد نتایج: 2154361  

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شیراز - دانشکده علوم 1392

تحلیل پوششی داده ها به عنوان یک علم نوپا به ابزاری برای اندازه گیری کارایی در آمده است. تحلیل پوششی داده ها به بررسی و ارزیابی واحدهای تصمیم گیرنده که یک یا چند ورودی را برای تولید یک یا چند خروجی مصرف می کنند می پردازد. از مشخصه های اصلی تحلیل پوششی داده ها حساس بودن آن نسبت به داده ها می باشد بدین معنی که عدم دقت در جمع آوری داده ها باعث به دست آمدن نتایج نادرستی می گردد. از جمله کاربردهای ان...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بوعلی سینا - دانشکده علوم پایه 1391

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...

2004
João Pedro Pedroso

In this paper we present several algorithms which combine a partial enumeration with meta-heuristics for the solution of general mixed-integer programming problems. The enumeration is based on the primal values assignable to the integer variables of the problem. We develop some algorithms for this integration, and test them using a set of well-known benchmark problems. Key-words: Enumeration, L...

Journal: :journal of optimization in industrial engineering 2010
ata allah taleizadeh seyed taghi akhavan niaki

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 ...

This paper proposes a modified non-dominated sorting genetic algorithm (NSGA-II) for a bi-objective location-allocation model. The purpose is to define the best places and capacity of the distribution centers as well as to allocate consumers, in such a way that uncertain consumers demands are satisfied. The objectives of the mixed-integer non-linear programming (MINLP) model are to (1) minimize...

Linear programming problems with alternate solutions are challenging due to the choice of multiple strategiesresulting in the same optimal value of the objective function. However, searching for these solutions is atedious task, especially when using mixed integer linear programming (MILP), as previously applied tometabolic models. Therefore, judgment on plurality of optimal m...

2010
LEO LIBERTI

Symmetry is mainly exploited in mathematical programming in order to reduce the computation times of enumerative algorithms. The most widespread approach rests on: (a) finding symmetries in the problem instance; (b) reformulating the problem so that it does not allow some of the symmetric optima; (c) solving the modified problem. Sometimes (b) and (c) are performed concurrently: the solution al...

2016
Quoc-Dung Ngo Yanis Hadj-Said Stéphane Ploix Ujjwal Maulik

This paper proposes a model transformation approach for model-based energy management in buildings. Indeed, energy management is a large area that covers a wide range of applications such as simulation, mixed integer linear programming optimization, simulated annealing optimization, model parameter estimation, diagnostic analysis,. . . Each application requires a model but in a specific formali...

2011
Nicky Mouha Qingju Wang Dawu Gu Bart Preneel

Differential and linear cryptanalysis are two of the most powerful techniques to analyze symmetric-key primitives. For modern ciphers, resistance against these attacks is therefore a mandatory design criterion. In this paper, we propose a novel technique to prove security bounds against both differential and linear cryptanalysis. We use mixedinteger linear programming (MILP), a method that is f...

Journal: :Math. Program. 2004
Arnold Neumaier Oleg Shcherbina

Current mixed-integer linear programming solvers are based on linear programming routines that use floating-point arithmetic. Occasionally, this leads to wrong solutions, even for problems where all coefficients and all solution components are small integers. An example is given where many state-of-the-art MILP solvers fail. It is then shown how, using directed rounding and interval arithmetic,...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید