the determination of the ultimate pit limit (upl) is the first step in the open pit mine planning process. in this stage that parts of the mineral deposit that are economic to mine are determined. there are several mathematical, heuristic and meta-heuristic algorithms to determine upl. the optimization criterion in these algorithms is maximization of the total profit whilst satisfying the...

mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. this issue renders the proposed mathematical models inapplicable due largely to the fact th...

We expand on the problem of learning a kernel via a RKHS on the space of kernels itself. The resulting optimization problem is shown to have a semidefinite programming solution. We demonstrate that it is possible to learn the kernel for various formulations of machine learning problems. Specifically, we provide mathematical programming formulations and experimental results for the CSVM, ν-SVM a...

In this paper the Kamat-Riley (K-R) event-based Monte Carlo simulation method was used for reliability analysis of longwall shearer machine. Shearer machine consists of six subsystems; water, haulage, electrical, hydraulic, cutting arms and cable systems in a series network configuration. A shearer in the Tabas coal mine was selected as case study and its all failure data were collected and use...

in this research, we address the application of uncertaintyprogramming to design a multi-site, multi-product, multi-period,closed-loop supply chain (clsc) network. in order to make theresults of this article more realistic, a clsc for a case study inthe iron and steel industry has been explored. the presentedsupply chain covers three objective functions: maximization ofprofit, minimization of n...

We survey the use of Abstract State Machines in the area of programming languages, namely to define behavioral properties of programs at source, intermediate and machine levels in a way that is amenable to mathematical and experimental analysis by practitioners, like correctness and completeness of compilers, etc. We illustrate how theorems about such properties can be integrated into a modular...