This work considers nonconvex mixed integer nonlinear programming where nonlinearity comes from the presence of two-dimensional euclidean norm in objective or constraints. We build piecewise linearization proposed by Camino et al. (Comput. Optim. Appl. https://doi.org/10.1007/s10589-019-00083-z , 2019) that allows to solve such problems via mixed-integer linear with an arbitrary approximation g...

A Nonlinear Mixed Integer Programming approach is presented to select the number of membrane modules required in the extraction and stripping sectors of a Non Dispersive Solvent Extraction Plant for effluent treatment and metal recovery. The differential equations that model each membrane module are discretized using orthogonal collocation on finite elements leading to an algebraic system of eq...

The aim of this work is to propose a mathematical programming model for the Economic Lot Scheduling Problem (ELSP) with performance decay. The main difficulties related to this model are the nonlinearities and/or nonconvexities associated with the dynamic behavior of the system with time. Firstly, the problem is formulated as a Mixed Integer Non Linear Program (MINLP), which is found to be nonc...

    Dynamic cellular manufacturing systems,   Mixed-integer non-linear programming,   Production planning, Manufacturing attributes   This paper presents a novel mixed-integer non-linear programming model for the design of a dynamic cellular manufacturing system (DCMS) based on production planning (PP) decisions and several manufacturing attributes. Such an integrated DCMS model with an extensi...

Several algorithms have been developed to solve the two-level linear programming problem during the past years. In this paper, we will formulate the mixed integer two-level linear programming problem and develop both the exact and heuristic solution procedures based on the branch-and-Lund technique for solving the problem. Computational experience and comparisons will be presented.

presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. the method is easy to u...