In the literature, methods for the construction of piecewise linear upper and lower bounds for the approximation of univariate convex functions have been proposed.We study the effect of the use of increasing convex or increasing concave transformations on the approximation of univariate (convex)...

The main contents of this paper is two-fold.First, we present a method to approximate multivariate convex functions by piecewise linear upper and lower bounds.We consider a method that is based on function evaluations only.However, to use this method, the data have to be convex.Unfortunately,...

In this paper, piecewise linear upper and lower bounds for univariate convex functions are derived that are only based on function value information. These upper and lower bounds can be used to approximate univariate convex functions. Furthermore, new Sandwich algo- rithms are proposed, that...

This study considers a simple newsvendor situation that consists of n retailers, all selling the same item with common purchasing costs and common selling prices.Groups of retailers might increase their expected joint profit by inventory centralization, which means that they make a joint order...

Two classes of one machine sequencing situations are considered in which each job corresponds to exactly one player but a player may have more than one job to be processed, so called RP(repeated player) sequencing situations.In max-RP sequencing situations it is assumed that each player's cost...

We study transferable utility games with limited cooperation between the agents. The focus is on communication structures where the set of agents forms a circle, so that the possibilities of cooperation are represented by the connected sets of nodes of an undirected circular graph. Agents are...

In this paper we study the relation between convexity of TU games and marginal vectors.We show that if specfic marginal vectors are core elements, then the game is convex.We characterize sets of marginal vectors satisfying this property, and we derive the formula for the minimum number of...

In this paper standard oligopolies are interpreted in two ways, namely as oligopolies without transferable technologies and as oligopolies with transferable technologies.From a cooperative point of view this leads to two different classes of cooperative games.We show that cooperative oligopoly...

Abstract: A new solution is presented for transferable utility games with graph communication where the cooperation possibilities are represented by a graph. Players are only able to cooperate and obtain some worth in a coalition if they form a connected set in the given graph. To determine the...

In this paper we construct sets of marginal vectors of a TU game with the property that if the marginal vectors from these sets are core elements, then the game is convex.This approach leads to new upperbounds on the number of marginal vectors needed to characterize convexity.An other result is...