A linear acceleration row action method for projecting onto subspaces.
A linear assignment formulation of the multiattribute decision problem
A linear programming approach to error bounds for random walks in the quarter-plane
We consider the steady-state behavior of random walks in the quarter-plane, in particular, the expected value of performance measures that are component-wise linear over the state space. Since the stationary distribution of a random walk is in general not readily available we establish upper and lower bounds on performance in terms of another random walk with perturbed transition probabilities, for which the stationary distribution is a geometric product-form. The Markov reward approach as developed...
A linear programming based analysis of the CP-rank of completely positive matrices
A real matrix A is said to be completely positive (CP) if it can be decomposed as A = BB^T, where the real matrix B has exclusively non-negative entries. Let k be the rank of A and Φ_k the least possible number of columns of the matrix B, the so-called completely positive rank (cp-rank) of A. The present work is devoted to a study of a general upper bound for the cp-rank of an arbitrary completely positive matrix A and its dependence on the ordinary rank k. This general upper bound of the cp-rank...
A linear pseudo-Boolean viewpoint on matching and other central concepts in graph theory
A Linguistic Fuzzy Approach to the Consensus Reaching in Multiple Criteria Group Decision-making Problems
The paper introduces a new method of reaching a consensus in multiple criteria group decision-making under fuzziness. This model is based on the general definition of the ‘soft’ consensus introduced by Kacprzyk and Fedrizzi in 1986. The fuzzy evaluations of alternatives express degrees of fulfillment of the given goals by the respective alternatives for each expert. The selection of the best alternative is based on the fuzzy consensus by experts. For this purpose a set of alternatives which are...
A literature review on circle and sphere packing problems: models and methodologies.
A local and global search combine particle swarm optimization algorithm for job-shop scheduling to minimize makespan.
A localization problem in geometry and complexity of discrete programming
A locally optimal insertion heuristic for a one-machine scheduling problem
A logarithm barrier method for semi-definite programming
This paper presents a logarithmic barrier method for solving a semi-definite linear program. The descent direction is the classical Newton direction. We propose alternative ways to determine the step-size along the direction which are more efficient than classical line-searches.
A logarithmic barrier function method for solving nonlinear multiobjective programming problems
A lot-size model for deteriorating items under conditions of a one-time only extended credit period.
A Markov chain model for traffic equilibrium problems
We consider a stochastic approach in order to define an equilibrium model for a traffic-network problem. In particular, we assume a markovian behaviour of the users in their movements throughout the zones of the traffic area. This assumption turns out to be effective at least in the context of urban traffic, where, in general, the users tend to travel by choosing the path they find more convenient and not necessarily depending on the already travelled part. The developed model is a homogeneous Markov...
A Markov chain model for traffic equilibrium problems
We consider a stochastic approach in order to define an equilibrium model for a traffic-network problem. In particular, we assume a Markovian behaviour of the users in their movements throughout the zones of the traffic area. This assumption turns out to be effective at least in the context of urban traffic, where, in general, the users tend to travel by choosing the path they find more convenient and not necessarily depending on the already travelled part. The developed model is a homogeneous...
A mathematical model for an optimal appointed delivery date on a home delivery market
In recent years, the home delivery market has rapidly been growing since customers can purchase a variety of products very easily via Internet. At the same time, however, customers tend to switch from a supplier to another seeking for better service for them. For this reason, it is necessary for suppliers to enclose their customers by means of various kinds of service and strategy. An appointed delivery date of a product ordered by a customer is one of important factors of supplier’s services. From...
A mathematical model for an optimal appointed delivery date on a home delivery market
In recent years, the home delivery market has rapidly been growing since customers can purchase a variety of products very easily via Internet. At the same time, however, customers tend to switch from a supplier to another seeking for better service for them. For this reason, it is necessary for suppliers to enclose their customers by means of various kinds of service and strategy. An appointed delivery date of a product ordered by a customer is one of important factors of supplier's services....
A mathematical model of storage
A measure of mutual divergence among a number of probability distributions.
A measure-theoretical max-flow-min-cut problem.