Forest management aims at building ecological networks that minimize the impacts on timber production. We formalize the construction of ecological networks in forest environments as the optimal control dynamic graph-theoretic problem. The ecological network is based on a set of bioreserves and...

We establish explicit socially optimal rules for an irreversible investment decision with time-to-build and uncertainty. Assuming a price sensitive demand function with a random intercept, we provide comparative statics and economic interpretations for three models of demand (arithmetic...

We develop a continuous-time dynamic model with switching costs. In a relatively simple Markov Perfect equilibrium, the dominant firm concedes market share by charging higher prices than the smaller firm. In the short-run, switching costs might have two types of anti-competitive effects: first,...

Modern macroeconomic theory utilises optimal control techniques to model the maximisation of individual well-being using a lifetime utility function. Agents face choices over current and future consumption (with resultant implied savings decisions) seeking to maximise the present value of...

This paper examines the dividend and investment policies of a cash constrained firm that has access to costly external funding. We depart from the literature by allowing the firm to issue collateralized debt to increase its investment in productive assets resulting in a performance sensitive...

This paper examines the dividend and investment policies of a cash constrained firm that has access to costly external funding. We depart from the literature by allowing the firm to issue collateralized debt to increase its investment in productive assets resulting in a performance sensitive...

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

In this paper we consider the linear quadratic differential game for descriptor systems that have index one. We derive both necessary and sufficient conditions for existence of an open-loop Nash equilibrium.

This paper adresses the robust counterparts of optimization problems containing sums of maxima of linear functions and proposes several reformulations. These problems include many practical problems, e.g. problems with sums of absolute values, and arise when taking the robust counterpart of a...

We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: [R.E....