We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...

Although lot streaming scheduling is an active research field, lot streaming flexible flow lines problems have received far less attention than classical flow shops. This paper deals with scheduling jobs in lot streaming flexible flow line problems. The paper mathematically formulates the problem by a mixed integer linear programming model. This model solves small instances to optimality. Moreo...

This paper proposes a new mathematical model for the open pit mine planning problem, based on continuous functional analysis. The traditional models for this problem have been constructed by using discrete 0−1 decision variables, giving rise to large-scale combinatorial and Mixed Integer Programming (MIP) problems. Instead, we use a continuous approach which allows for a refined imposition of s...

After a brief introduction to the basic concepts of reverse logistics, we present a two-level location problem with three types of facility to be located in a specific reverse logistics system, named a Remanufacturing Network (RMN). For this problem, we propose a 0–1 mixed integer programming model, in which we simultaneously consider “forward” and “reverse” flows and their mutual interactions....

in this paper, a multi-product single machine scheduling problem with the possibility of producing defected jobs, is considered. we concern rework in the scheduling environment and propose a mixed-integer programming (mip) model for the problem.  based on the philosophy of just-in-time production, minimization of the sum of earliness and tardiness costs is taken into account as the objective fu...

We study the Knapsack Problem with Conflict Graph (KPCG), an extension of the 0-1 Knapsack Problem, in which a conflict graph describing incompatibilities between items is given. The goal of the KPCG is to select the maximum profit set of compatible items while satisfying the knapsack capacity constraint. We present a new Branch-and-Bound approach to derive optimal solutions to the KPCG in shor...

In this study, a flexible optimization approach is introduced to design an optimal biocompatible solvent for an extractive fermentation process with cell-recycling. The optimal process/solvent design problem is formulated as a mixed-integer nonlinear programming model in which performance requirements of the compounds are reflected in the objectives and the constraints. A flexible or fuzzy opti...

The 0-1 cubic knapsack problem (CKP), a generalization of the classical quadratic problem, is an extremely challenging NP-hard combinatorial optimization problem. An effective exact solution strategy for CKP to reformulate nonlinear into equivalent linear form that can then be solved using standard mixed-integer programming solver. We consider linearization method and propose variant more recen...

of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy NONLINEAR INTEGER OPTIMIZATION AND APPLICATIONS IN BIOMEDICINE By Oleg A. Prokopyev August 2006 Chair: Panos M. Pardalos Major Department: Industrial and Systems Engineering In this dissertation we consider fractional and quadratic 0-1 o...