نتایج جستجو برای: we formulate a mixed integer non

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

This paper addresses a reliable facility location problem with considering facility capacity constraints. In reliable facility location problem some facilities may become unavailable from time to time. If a facility fails, its clients should refer to other facilities by paying the cost of retransfer to these facilities. Hence, the fail of facilities leads to disruptions in facility location dec...

Journal: :journal of optimization in industrial engineering 2015
masoud bagheri saeed sadeghi mohammad saidi-mehrabad

in order to implement the cellular manufacturing system in practice, some essential factors should be taken into account. in this paper, a new mathematical model for cellular manufacturing system considering different production factors including alternative process routings and machine reliability with stochastic arrival and service times in a dynamic environment is proposed. also because of t...

2013
Rei Yamamoto Hiroshi Konno

This paper is concerned with an optimization problem associated with a rebalancing schedule of a large scale fund subject to nonconvex transaction cost. We will formulate this problem as a 0-1 mixed integer programming problem under linear constraints using absolute deviation as the measure of risk. This problem can be solved by an integer programming software if the size of the universe is sma...

Journal: :Operations Research 2012
Alper Atamtürk Gemma Berenguer Zuo-Jun Max Shen

We study several joint facility location and inventory management problems with stochastic retailer demand. In particular, we consider cases with uncapacitated facilities, capacitated facilities, correlated retailer demand, stochastic lead times, and multicommodities. We show how to formulate these problems as conic quadratic mixed-integer problems. Valid inequalities, including extended polyma...

Journal: :International journal of bioinformatics research and applications 2008
Z. Wu Y. Zhang

The double digestion problem for DNA restriction mapping has been proved to be NP-complete and intractable if the numbers of the DNA fragments become large. Several approaches to the problem have been tested and proved to be effective only for small problems. In this paper, we formulate the problem as a mixed-integer linear program (MIP) by following (Waterman, 1995) in a slightly different for...

F. Goodarzian M. B. Fakhrzad P. Talebzadeh

In this paper, developed a new multi-product, multi-period, and multi-level closed-loop green supply chain planning model under uncertain conditions. The formulated model consists of five objective functions, which minimize the cost of the supply chain, minimize the CO2 emission of transportation vehicles, maximize the reliability of manufacturing and distribution centers, maximize t...

2012
Hossein Nourkhiz Mahjoub Mohsen Shiva

Wireless Mesh Networking is a promising proposal for broadband data transmission in a large area with low cost and acceptable QoS. These features’ trade offs in WMNs is a hot research field nowadays. In this paper a mathematical optimization framework has been developed to maximize throughput according to upper bound delay constraints. IEEE 802.11 based infrastructure backhauling mode of WMNs h...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بوعلی سینا - دانشکده علوم پایه 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...

The undirected power graph of a finite group $G$, $P(G)$, is a graph with the group elements of $G$ as vertices and two vertices are adjacent if and only if one of them is a power of the other. Let $A$ be an adjacency matrix of $P(G)$. An eigenvalue $lambda$ of $A$ is a main eigenvalue if the eigenspace $epsilon(lambda)$ has an eigenvector $X$ such that $X^{t}jjneq 0$, where $jj$ is the all-one...

This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...

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

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