THE MEASUREMENT OF WELFARE GAINS FROM GENETIC PROGRESS IN FORESTRY: GENERAL EQUILIBRIUM AND DISEQUILIBRIUM RESULTS

The paper contains an extension of existing results on the economics of tree improvement programs. The properties of the indirect utility function and the present value function are used to derive general equilibrium and disequilibrium cost–benefit rules for marginal projects resulting in an improved production function. Corresponding results for projects resulting in large second order effects in both prices and quantities are also provided, and indirect methods to estimate the net benefits are suggested. It is also briefly discussed how recreational and option values can be dealt with.     

MANAGEMENT OF A RENEWABLE RESOURCE WITH A FINITE DEMAND ELASTICITY

Optimal management policies are derived for a renewable resource when the demand for output has finite elasticity. The analysis modifies traditional views of this problem by allowing for the possibility that static optimizing policies, which maximize myopic net revenues, may be superior to “Golden Rule” policies which account for longer-run stock effects.     

Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.

     

Test of the intercombination rules on the two excited states (0 and 1) potential parameters of the second group metal atoms perturbed by inert gases

A set of intercombination rules has been used to calculate the two excited (³0 and ³1) state potential parameters ε₁₂ and R₁₂ of Hg, Cd and Zn interacting with inert gases (Xe, Kr, Ar and Ne). The results obtained with these rules are compared with various experimental and theoretical results for these molecules. The rules can be very well used for determination of the position of the potential minimum for the two states of all molecules. Concerning the well depths of the two states (³0 and ³1) of these molecules, it is observed that for the more bounded excited state ³0 some of these rules give results that are in close agreement with experimental data especially for molecules consisting of heavy atoms but for the shallow excited state ³1 these rules cannot be used.     

Recursive and explicit rules: How can we build student algebraic understanding?

Differing perspectives have been offered about student use of recursive and explicit rules. These include: (a) promoting the use of explicit rules over the use of recursive rules, and (b) encouraging student use of both recursive and explicit rules. This study sought to explore students’ use of recursive and explicit rules by examining the reasoning of 25 sixth-grade students, including a focus on four target students, as they approached tasks in which they were required to develop generalizations while using computer spreadsheets as an instructional tool. The results demonstrate the difficulty that students had moving from the successful use of recursive rules toward explicit rules. In particular, two students abandoned general reasoning, instead focusing on particular values in an attempt to construct explicit rules. It is recommended that students be encouraged to connect recursive and explicit rules as a potential means for constructing successful generalizations.     

Action Principle and Modification of the Faddeev–Popov Factor in Gauge Theories

The quantum action (dynamical) principle is exploited to investigate the nature and origin of the Faddeev–Popov (FP) factor in gauge theories without recourse to path integrals. Gauge invariant as well as gauge non-invariant interactions are considered to show that the FP factor needs to be modified in more general cases and expressions for these modifications are derived. In particular we show that a gauge invariant theory does not necessarily imply the familiar FP factor for proper quantization. PACS numbers: 11.15.-q; 12.10.-g; 12.15.-y; 12.38.-t     

Complexity of local search for the p-median problem

We study the complexity of finding local minima for the p-median problem. The relationship between Swap local optima, 0–1 local saddle points, and classical Karush–Kuhn–Tucker conditions is presented. It is shown that the local search problems with some neighborhoods are tight PLS-complete. Moreover, the standard local descent algorithm takes exponential number of iterations in the worst case regardless of the tie-breaking and pivoting rules used. To illustrate this property, we present a family of instances where some local minima may be hard to find. Computational results with different pivoting rules for random and Euclidean test instances are discussed. These empirical results show that the standard local descent algorithm is polynomial in average for some pivoting rules.     

Efficient interval partitioning for constrained global optimization

A new efficient interval partitioning approach to solve constrained global optimization problems is proposed. This involves a new parallel subdivision direction selection method as well as an adaptive tree search. The latter explores nodes (intervals in variable domains) using a restricted hybrid depth-first and best-first branching strategy. This hybrid approach is also used for activating local search to identify feasible stationary points. The new tree search management technique results in improved performance across standard solution and computational indicators when compared to previously proposed techniques. On the other hand, the new parallel subdivision direction selection rule detects infeasible and suboptimal boxes earlier than existing rules, and this contributes to performance by enabling earlier reliable deletion of such subintervals from the search space.     

Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting

This paper presents a priority rule-based heuristic for the multi-mode resource-constrained project scheduling problem with the splitting of activities around unavailable resources allowed. All resources considered are renewable and each resource unit may not be available at all times due to resource vacations, which are known in advance. A new concept called moving resource strength is developed to help identify project situations where activity splitting is likely to be beneficial during scheduling. The moving resource strength concept is implemented in priority rule-based heuristics to control activity splitting when scheduling. Multiple comparisons of the performance of combination of activity–mode priority rules used in the heuristics are provided. Computational experiments demonstrate the effectiveness of the heuristic in reducing project makespan, and minimizing activity splitting.