The Equalization method for the Stochastic Generalized Transportation Problem is presented. The algorithm allows to find the optimal solution to the problem of minimizing the expected total cost in the Generalized Transportation Problem with random demand. It is shown that the method is...

The Equalization method for the Stochastic Generalized Transportation Problem is presented. The algorithm allows to find the optimal solution to the problem of minimizing the expected total cost in the Generalized Transportation Problem with random demand. It is shown that the method is...

The Generalized Transportation Problem (GTP) allows us to model situations where the amount of goods leaving the supply points is not equal to the amount delivered to the destina-tions (this is the case e.g. when fragile or perishable goods are transported or complaints may occur). In this...

Utility and risk are two often competing measurements on the investment success. We show that efficient trade-off between these two measurements for investment portfolios happens, in general, on a convex curve in the two-dimensional space of utility and risk. This is a rather general pattern....

Conditional distribution functions are important statistical objects for the analysis of a wide class of problems in econometrics and statistics. We propose flexible Gaussian representations for conditional distribution functions and give a concave likelihood formulation for their global...

We consider a project scheduling problem where the precedence constraints graph is an out-tree. The processing times can be compressed by using additional resources, which causes cost and simultaneously reduces the processing times of jobs. The objective is to minimize the sum of total lateness...

This paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its corresponding central cut version. Rules that...

We address the problem of scheduling a multi-station multiclass queueing network (MQNET) with server changeover times to minimize steady-state mean job holding costs. We present new lower bounds on the best achievable cost that emerge as the values of mathematical programming problems (linear,...

This paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its corresponding central cut version. Rules that...