The paper presents an extended version of the consumer choice problem. Different from the standard model, prices are not fixed but arise from Walrasian interactions of total demand and a stylized supply function for each of the goods. Three different types of evolutionary algorithms are set up...

This paper, using the different alternative methods of dynamic optimization (the Lagrange/Kuhn-Tucker (LKT) method, the substitution method, the Hamiltonian method, and the dynamic programming approach) derives the conditions that must be satisfied by the solution to the so-called Ramsey...

One attractive objective for a pensioner using the income drawdown option is to minimise the deviation of the pension fund from a prescribed deterministic target. Typically, this problem is formulated as a linear-quadratic optimal control problem, which has the shortcoming that over-performance...

This paper proposes a novel method of global optimization based on cuckoo-host co-evaluation. It also develops a Fortran-77 code for the algorithm. The algorithm has been tested on 96 benchmark functions (of which the results of 30 relatively harder problems have been reported). The proposed...

This paper introduces recent developments in the analysis of inventory systems with partial observations. The states of these systems are typically conditional distributions, which evolve in infinite dimensional spaces over time. Our analysis involves introducing unnormalized probabilities to...

This paper considers the dynamic lot sizing problem of H. M. Wagner and T. M. Whitin with the assumption that the total cost of n setups is a concave nondecreasing function of n. Such setup costs could arise from the worker learning in setups and/or technological improvements in setup methods....

The set covering problem is an NP-hard combinatorial optimization problem that arises in applications ranging from crew scheduling in airlines to driver scheduling in public mass transport. In this paper we analyze search space characteristics of a widely used set of benchmark instances through...

This paper introduces a flexible method based on dynamic programming to calculate the quantitative value of any approach to managing the innovation process. The quantification lets managers precisely compare the values of different approaches, and so identify those that are optimised for their...