Modified PSO method for robust control of 3RPS parallel manipulators.
Modified T-F function method for finding global minimizer on unconstrained optimization.
Modular production line optimization: The exPLOre architecture.
Mond-Weir duality in vector programming with generalized invex functions on differentiable manifolds.
Monotone interval eigenproblem in max–min algebra
The interval eigenproblem in max-min algebra is studied. A classification of interval eigenvectors is introduced and six types of interval eigenvectors are described. Characterization of all six types is given for the case of strictly increasing eigenvectors and Hasse diagram of relations between the types is presented.
Monotone optimal policies in discounted Markov decision processes with transition probabilities independent of the current state: existence and approximation
In this paper there are considered Markov decision processes (MDPs) that have the discounted cost as the objective function, state and decision spaces that are subsets of the real line but are not necessarily finite or denumerable. The considered MDPs have a cost function that is possibly unbounded, and dynamic independent of the current state. The considered decision sets are possibly non-compact. In the context described, conditions to obtain either an increasing or decreasing optimal stationary...
Monotone point-to-set vector fields.
Monotonicity of minimizers in optimization problems with applications to Markov control processes
Firstly, in this paper there is considered a certain class of possibly unbounded optimization problems on Euclidean spaces, for which conditions that permit to obtain monotone minimizers are given. Secondly, the theory developed in the first part of the paper is applied to Markov control processes (MCPs) on real spaces with possibly unbounded cost function, and with possibly noncompact control sets, considering both the discounted and the average cost as optimality criterion. In the context described,...
Monotonicity of the Lagrangian function in the parametric interior point methods of convex programming.
Monte Carlo simulation and analytic approximation of epidemic processes on large networks
Low dimensional ODE approximations that capture the main characteristics of SIS-type epidemic propagation along a cycle graph are derived. Three different methods are shown that can accurately predict the expected number of infected nodes in the graph. The first method is based on the derivation of a master equation for the number of infected nodes. This uses the average number of SI edges for a given number of the infected nodes. The second approach is based on the observation that the epidemic...
MOPP-I: an optimization package for multipurpose batch operations.
A number of algorithms have been developed -including enumeration of feasible production sequences, alternative task selection and the generation of alternative production lines- to determine the optimal sequence in which products and by-products should be produced and the times at which the various production operations for each product should be carried out to meet a given product demand pattern, taking into account the available equipment, storage costs, stopover penalties and other plant limitations.Product...
Moreau's decomposition theorem revisited
Multi-agent network flows that solve linear complementarity problems
In this paper, we consider linear complementarity problems with positive definite matrices through a multi-agent network. We propose a distributed continuous-time algorithm and show its correctness and convergence. Moreover, with the help of Kalman-Yakubovich-Popov lemma and Lyapunov function, we prove its asymptotic convergence. We also present an alternative distributed algorithm in terms of an ordinary differential equation. Finally, we illustrate the effectiveness of our method by simulations....
Multi-armed restless bandits, index policies, and dynamic priority allocation.
Multi-attribute evaluation with imprecise vector utility
We consider the multi-attribute decision making problem with incomplete information on the decision maker's preferences, given by an imprecise vector utility function. We introduce an approximation set to the utility efficient set which may be used to aid a decision maker in reaching a final compromise strategy. We provide sorne properties and an interactive procedure based on such approximation set.
Multiattribute Prediction of Terrain Stability Above Underground Mining Operations
Multibump solutions for an almost periodically forced singular Hamiltonian system.
Multi-class decision procedures for the inspection operation.
Multiclass Hammersley–Aldous–Diaconis process and multiclass-customer queues
In the Hammersley–Aldous–Diaconis process, infinitely many particles sit in ℝ and at most one particle is allowed at each position. A particle at x, whose nearest neighbor to the right is at y, jumps at rate y−x to a position uniformly distributed in the interval (x, y). The basic coupling between trajectories with different initial configuration induces a process with different classes of particles. We show that the invariant measures for the two-class process can be obtained as follows. First,...
Multi-criteria approach to comparison of inspection allocation for multi-product manufacturing systems in make-to-order sector