نتایج جستجو برای: objective mixed integer linear programming
تعداد نتایج: 1492831 فیلتر نتایج به سال:
Mixed-model assembly line (MMAL) is a type of assembly line where several distinct models of a product are assembled. MMAL is applied in many industrial environments today because of its greater variety in demand. This paper considers the objective of minimizing the work overload (i.e., the line balancing problem) and station-to-station product flows. Generally, transportation time between stat...
Over the past few decades, neuroscience experiments have become increasingly complex and naturalistic. Experimental design has in turn more challenging, as must conform to an ever-increasing diversity of constraints. In this article, we demonstrate how process can be greatly assisted using optimization tool known mixed-integer linear programming (MILP). MILP provides a rich framework for incorp...
We study the performance of Empirical Revenue Maximizing (ERM) mechanism in a single-item, single-seller, single-buyer setting. assume buyer’s valuation is drawn from regular distribution F and that seller has access to two independently samples F. By solving family mixed-integer linear programs (MILPs), ERM proven guarantee at least .5914 times optimal revenue expectation. Using solutions thes...
In this paper, mathematical models are proposed for simultaneously modeling location and inventory control decisions in a four echelon supply chain network considering capacity. The echelons considered in this paper include suppliers, warehouses, hubs and retailers. The aim of the model is to minimize the location, transportation and inventory control costs. Hence, a non-linear mixed integer pr...
abstract this thesis includes five chapter : the first chapter assign to establish fuzzy mathematics requirement and introduction of liner programming in thesis. the second chapter we introduce a multilevel linear programming problems. the third chapter we proposed interactive fuzzy programming which consists of two phases , the study termination conditions of algorithm we show a satisfac...
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is NP-hard. We describe a mixed-integer programming (MIP) model with linear constraints and a non-linear objective for separating an arbitrary point from the MIR closure of a given mixed-integer set. We linearize the objec...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید