Showing 1 - 10 of 17
The earliest approaches to the cell formation problem in group technology, dealing with a binary machine-part incidence matrix, were aimed only at minimizing the number of intercell moves (exceptional elements in the block-diagonalized matrix). Later on this goal was extended to simultaneous...
Persistent link: https://www.econbiz.de/10011151230
Persistent link: https://www.econbiz.de/10009324645
Persistent link: https://www.econbiz.de/10009324678
In this paper, we present a novel algorithm for the solution of multiparametric mixed integer linear programming (mp-MILP) problems that exhibit uncertain objective function coefficients and uncertain entries in the right-hand side constraint vector. The algorithmic procedure employs a branch...
Persistent link: https://www.econbiz.de/10010793968
We present a branch and bound algorithm for the global optimization of a twice differentiable nonconvex objective function with a Lipschitz continuous Hessian over a compact, convex set. The algorithm is based on applying cubic regularisation techniques to the objective function within an...
Persistent link: https://www.econbiz.de/10010845823
Persistent link: https://www.econbiz.de/10010845833
In this paper a problem of scheduling a single machine under linear deterioration which aims at minimizing the number of tardy jobs is considered. According to our assumption, processing time of each job is dependent on its starting time based on a linear function where all the jobs have the...
Persistent link: https://www.econbiz.de/10010994001
We consider a multi-period problem of fair transfer prices and inventory holding policies in two enterprise supply chains. This problem was formulated as a mixed integer non-linear program by Gjerdrum et al. (Eur J Oper Res 143:582–599, <CitationRef CitationID="CR8">2002</CitationRef>). Existing global optimization methods to solve this...</citationref>
Persistent link: https://www.econbiz.de/10010994020
Multidimensional scaling is a technique for exploratory analysis of multidimensional data. The essential part of the technique is minimization of a multimodal function with unfavorable properties like invariants and non-differentiability. Recently a branch and bound algorithm for...
Persistent link: https://www.econbiz.de/10010994072
In the first part of this work, we presented a global optimization algorithm, Branch-and-Sandwich, for optimistic bilevel programming problems that satisfy a regularity condition in the inner problem (Kleniati and Adjiman in J Glob Optim, <CitationRef CitationID="CR16">2014</CitationRef>). The proposed approach can be interpreted as the...</citationref>
Persistent link: https://www.econbiz.de/10010994079