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

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

Journal: :Pakistan Journal of Statistics and Operation Research 2007

In this paper, we propose a new model for designing integrated forward/reverse logistics based on pricing policy in direct and indirect sales channel. The proposed model includes producers, disposal center, distributers and final customers. We assumed that the location of final customers is fixed. First, a deterministic mixed integer linear programming model is developed for integrated logistic...

Journal: :Computers & Chemical Engineering 2014
Pedro Rivotti Efstratios N. Pistikopoulos

This work addresses the topic of constrained dynamic programming for problems involving multi-stage mixed-integer linear formulations with a linear objective function. It is shown that such problems may be decomposed into a series of multi-parametric mixed-integer linear problems, of lower dimensionality, that are sequentially solved to obtain the globally optimal solution of the original probl...

Journal: :J. Global Optimization 2013
Melih Özlen Meral Azizoglu Benjamin A. Burton

In this paper we develop an algorithm to optimise a nonlinear utility function of multiple objectives over the integer efficient set. Our approach is based on identifying and updating bounds on the individual objectives as well as the optimal utility value. This is done using already known solutions, linear programming relaxations, utility function inversion, and integer programming. We develop...

دررودی, مریم, صادقیان, رامین,

In this paper, a general process is developed to find all non-dominated solutions of the multi objective combinatorial optimization (MOCO) problem. This process is based on the elastic constraints method and applies the identification of objective's bounds for it. Objectives bounds are determined by solving single objective integer programming problems. First the elastic constraints method is...

An interactive heuristic approach can offer a practical solution to the problem of linear integer programming (LIP) by combining an optimization technique with the Decision Maker’s (DM) judgment and technical supervision. This is made possible using the concept of bicriterion linear programming (BLP) problem in an integer environment. This model proposes two bicriterion linear programs for iden...

Journal: :INFORMS Journal on Computing 1994
Martin W. P. Savelsbergh

In the rst part of the paper we present a framework for describing basic tech niques to improve the representation of a mixed integer programming problem We elaborate on identi cation of infeasibility and redundancy improvement of bounds and coe cients and xing of binary variables In the second part of the paper we discuss recent extensions to these basic techniques and elaborate on the investi...

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

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