Modelling integer linear programs with Petri nets
Modelling integer linear programs with petri nets*
We show in this paper that timed Petri nets, with one resource shared by all the transitions, are directly connected to the modelling of integer linear programs (ILP). To an ILP can be automatically associated an equivalent Petri net. The optimal reachability delay is an optimal solution of the ILP. We show next that a net can model any ILP. I order to do this, we give a new sufficient reachability condition for the marking equation, which also holds for general Petri nets without timed transitions. ...
Modelling of the automatic depth control electrohydraulic system using RBF neural network and genetic algorithm.
Modelos auxiliares para problemas de programación lineal con coeficientes imprecisos en las restricciones.
En este artículo se considera un programa de Programación Lineal en el que los coeficientes del sistema de inecuaciones lineales, que definen el conjunto de restricciones, están dados de forma imprecisa o vaga. Se supone entonces que tales coeficientes pueden ser definidos mediante números difusos. Se propone un enfoque de resolución basado en las distintas versiones existentes para la comparación de números difusos. Finalmente, se obtienen diferentes modelos auxiliares de Programación Lineal, que...
Moderní pohled na „jistý problém minimální‟
Modifications of the limited-memory BFGS method based on the idea of conjugate directions
Simple modifications of the limited-memory BFGS method (L-BFGS) for large scale unconstrained optimization are considered, which consist in corrections of the used difference vectors (derived from the idea of conjugate directions), utilizing information from the preceding iteration. For quadratic objective functions, the improvement of convergence is the best one in some sense and all stored difference vectors are conjugate for unit stepsizes. The algorithm is globally convergent for convex sufficiently...
Modified golden ratio algorithms for pseudomonotone equilibrium problems and variational inequalities
We propose a modification of the golden ratio algorithm for solving pseudomonotone equilibrium problems with a Lipschitz-type condition in Hilbert spaces. A new non-monotone stepsize rule is used in the method. Without such an additional condition, the theorem of weak convergence is proved. Furthermore, with strongly pseudomonotone condition, the $R$-linear convergence rate of the method is established. The results obtained are applied to a variational inequality problem, and the convergence rate...
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.
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.