In the context of convex mixed integer nonlinear programming (MINLP), we investigate how the outer approximation method and the generalized Benders decomposition method are affected when the respective nonlinear programming (NLP) subproblems are solved inexactly. We show that the cuts in the...

We study the structure of pairwise stable networks from a very general point. Rather than assuming a particular functional form of utility, we simply assume that the society is homogeneous, i.e. that agents’ utilities differ only with respect to their network position while their names do not...

When dealing with location problems we are usually given a set of existing facilities and we are looking for the location of one or several new facilities. In the classical approaches weights are assigned to existing facilities expressing the importance of the new facilities for the existing...

Following a few words on multifunctions in the mathematical literature, a very brief recall on dual spaces, some preliminary notations and definitions in the introduction, we give some results on those functions in the second paragraph. In the third paragraph, a duality theory in...

In this paper we present compelling evidence from a detailed analysis of historical prepayment data to demonstrate that a mortgage cohort remembers the level of the previous mortgage rate troughs experienced by the cohort. This is a general property, observed ubiquitously, that inescapably leads...

In this paper we study a class of cooperative sequencing games that arise from one-machine sequencing situations in which chain precedence relations are imposed on the jobs. It is shown that these sequencing games are convex.