one of the main concerns of the mining industry is to determine ultimate pit limits. final pit is a collection of blocks, which can be removed with maximum profit while following restrictions on the slope of the mine’s walls. the size, location and final shape of an open-pit are very important in designing the location of waste dumps, stockpiles, processing plants, access roads and other surfac...

One of the main concerns of the mining industry is to determine ultimate pit limits. Final pit is a collection of blocks, which can be removed with maximum profit while following restrictions on the slope of the mine’s walls. The size, location and final shape of an open-pit are very important in designing the location of waste dumps, stockpiles, processing plants, access roads and other surfac...

In this work we present an Outer-Approximation algorithm to obtain the global optimum of a nonconvex Mixed Integer Nonlinear Programming (MINLP) model for the scheduling of crude oil movement at the front-end of a petroleum refinery. The model relies on a continuous time representation making use of transfer events. The proposed technique focuses on effectively solving a Mixed Integer Linear Pr...

In highly regulated industries, such as agrochemical and pharmaceutical, new products have to pass a number of regulatory tests related to safety, efficacy, and environmental impact to gain FDA approval. If a product fails one of these tests it cannot enter the market place and the investment in previous tests is wasted. Depending on the nature of the products, testing may last up to 15 years, ...

In this paper we exploit concepts from Information Theory to improve the classical Chvatal greedy algorithm for set covering problem. particular, develop a new procedure, called Surprisal-Based Greedy Heuristic (SBH), incorporating computation of “surprisal” measure when selecting solution columns. Computational experiments, performed on instances OR-Library, showed that SBH yields 2.5% improve...

ultimate limits of an open pit, which define its size and shape at the end of the mine’s life, is the pit with the highest profit value. a number of algorithms such as floating or moving cone method, floating cone method ii and the corrected forms of this method, the korobov algorithm and the corrected form of this method, dynamic programming and the lerchs and grossmann algorithm based on grap...

Ultimate limits of an open pit, which define its size and shape at the end of the mine’s life, is the pit with the highest profit value. A number of algorithms such as floating or moving cone method, floating cone method II and the corrected forms of this method, the Korobov algorithm and the corrected form of this method, dynamic programming and the Lerchs and Grossmann algorithm based on grap...

In this article we present an effective mixed-integer linear programming (MILP) formulation for design of a multi-echelon stochastic inventory system with uncertain customer demands. In You and Grossmann [2010] a three-echelon supply chain with inventories under uncertainty is presented. In that supply chain, the location of the plants and the customer demand zones (CDZ) are known. Potential di...