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

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

Journal: :International Journal of Industrial Engineering Computations 2019

Journal: :iranian journal of fuzzy systems 2012
esmaile khorram vahid nozari

this paper studies a new multi-objective fuzzy optimization prob- lem. the objective function of this study has dierent levels. therefore, a suitable optimized solution for this problem would be an optimized solution with preemptive priority. since, the feasible domain is non-convex; the tra- ditional methods cannot be applied. we study this problem and determine some special structures related...

Journal: :journal of industrial engineering and management studies 0
f. molavi sadjad university of technology, mashhad, iran. e. rezaee nik sadjad university of technology, mashhad, iran.

resource limitation in zero time may cause to some profitable projects not to be selected in project selection problem, thus simultaneous project portfolio selection and scheduling problem has received significant attention. in this study, budget, investment costs and earnings are considered to be stochastic. the objectives are maximizing net present values of selected projects and minimizing v...

2006
Maurizio Bruglieri Leo Liberti

We propose mathematical programming models for solving problems arising from planning and running an energy production process based on burning biomasses. The models take into account different aspects of the problem: determination of the biomasses to produce and/or buy, transportation decisions to convey the materials to the respective plants, and plant design. Whereas the “running model” is l...

K. Eshghi and S. Pasalar,

Multicommodity distribution problem is one of the most interesting and useful models in mathematical programming due to its major role in distribution networks. The purpose of this paper is to describe and solve a special class of multicommodity distribution problems in which shipment of a commodity from a plant to a customer would go through different distribution centers. The problem is t...

Journal: :CoRR 2010
Naoyuki Kamiyama

In this note, we show that the linear programming for computing the quasi-additive bound of the formula size of a Boolean function presented by Ueno [MFCS’10] is equivalent to the dual problem of the linear programming relaxation of an integer programming for computing the protocol partition number. Together with the result of Ueno [MFCS’10], our results imply that there exists no gap between o...

2008
Kanika Dhyani Leo Liberti

We discuss a mixed-integer nonlinear programming formulation for the problem of covering a set of points with a given number of slabs of minimum width, known as the bottleneck variant of the hyperplane clustering problem. We derive several linear approximations, which we solve using a standard mixed-integer linear programming solver. A computational comparison of the performance of the differen...

Journal: :Computers & OR 2006
Natashia Boland Patricia Domínguez-Marín Stefan Nickel Justo Puerto

The Discrete Ordered Median Problem (DOMP) generalizes classical discrete location problems, such as the N -median, N -center and Uncapacitated Facility Location problems. It was introduced by Nickel [16], who formulated it as both a nonlinear and a linear integer program. We propose an alternative integer linear programming formulation for the DOMP, discuss relationships between both integer l...

This paper investigates the problem of selecting and scheduling a set of projects among available projects. Each project consists of several tasks and to perform each one some resource is required. The objective is to maximize total benefit. The paper constructs a mathematical formulation in form of mixed integer linear programming model. Three effective metaheuristics in form of the imperialis...

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

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