Finding the lexicographic maximum of a polytope in Rn can be achieved by solving a suitable LP-problem.

In this paper, a general method is described to determine uncertainty intervals for performance measures of Markov chains given an uncertainty region for the parameters of the Markov chains. We investigate the effects of uncertainties in the transition probabilities on the limiting...

AMS classifications: 90C22; 90C20;

The problem of minimizing a quadratic form over the standard simplex is known as the standard quadratic optimization problem (SQO).It is NPhard, and contains the maximum stable set problem in graphs as a special case.In this note we show that the SQO problem may be reformulated as an...

Much research focuses on development of new agricultural technologies to reduce poverty levels of the large population of smallholder farms in Sub Saharan Africa. In this paper we argue that smallholders can also increase their production in a different way, namely by using their resources more...

Given an arbitrary polytope P in the n-dimensional Euclidean space R n , the question is to determine whether P contains an integral point or not. We propose a simplicial algorithm to answer this question based on a specifc integer labeling rule and a specific triangulation of R n . Starting...

In this paper we study several issues related to the characterization of speci c classes of multivariate quadratic mappings that are nonnegative over a given domain, with nonnegativity de ned by a pre-speci ed conic order.In particular, we consider the set (cone) of nonnegative quadratic...