OPTIMAL SELECTION OF MATCHED PAIRS FROM LARGE DATA BASES

This paper considers the problem of selecting matched pairs of observations for the reduction of bias in statistical hypothesis testing. A Euclidean distance function is suggested for measuring the similarity between paired observations. The matching process is then formulated initially as an assignment problem. Alternative formulations of the problem that would reduce computational difficulty are considered.     

THE USE OF ARCS AND NODES FOR THE DETERMINATION OF CRITICAL PATHS IN PERT/CPM NETWORKS

The critical path in a PERT/CPM network is determined in various textbooks by finding the path with associated minimal slack for the network arcs or by finding the path with associated minimal slack for the network nodes. This paper points out that the use of nodes can result in a network path being incorrectly identified as a path of maximum length.     

SENSITIVITY ANALYSIS WITH INTERACTION EFFECTS

The purpose of this paper is to extend the sensitivity analysis methodology as it applies to linear programming. The methodology developed herein is concerned with those changes in a technological coefficient that cause simultaneous changes in the relevant cost coefficients of the objective function. By proceeding from the definitions of feasibility and optimality, the authors develop formulas for determining bounds on the extent to which a technological coefficient, which has a predetermined effect on the corresponding cost coefficient, can vary without changing the optimal set of activities. After the formulas are developed, their use is demonstrated on a product-mix problem. This technique is of interest because changes in the rate at which an input is utilized can be expected to change the cost per unit of a resulting product. This interdependence should be recognized whenever a sensitivity analysis is performed on a technological coefficient of either a cost minimization or a contribution margin maximization problem.     

ON PREDICTING COMPUTATIONAL TIME OF A BRANCH AND BOUND ALGORITHM FOR THE ASSIGNMENT OF FACILITIES

Experience with branch and bound algorithms indicates that computational time is a function of not only the size of the problem, but also the nature of the input data. This paper formulates statistically-based variables which describe certain characteristics of the input data and experimentally evaluates their ability to predict computational time for one branch and bound algorithm, the relative location of facilities or “plant layout” problem. Results suggest that the described experimental procedure may be useful for an a priori assessment of the computational difficulty of specific branch and bound problems.     

Dynamic reasoning and time pressure: Transition from analytical operations to experiential responses

Based upon the Decision Field Theory (Busemeyer and Townsend 1993), we tested a model of dynamic reasoning to predict the effect of time pressure on analytical and experiential processing during decision-making. Forty-six participants were required to make investment decisions under four levels of time pressure. In each decision, participants were presented with experiential cues which were either congruent or incongruent with the analytical information. The congruent/incongruent conditions allowed us to examine how many decisions were based upon the experiential versus the analytical information, and to see if this was affected by the varying degrees of time pressure. As expected, the overall accuracy was reduced with greater time pressure and accuracy was higher when the experiential and analytical cues were congruent than when they were incongruent. Of great interest was the data showing that under high time pressure participants used more experiential cues than at other time pressures. We suggest that the dynamic reasoning paradigm has some future potential for predicting the effects of experiential biases in general, and specifically under time pressure.     

Trade, education, and innovation: Prospects for the U.S. economy

This paper examines international trade issues as vital indicators of the economic prospects of the United States and other developed economies. In particular, it challenges misuses of the doctrine of mutual gains from trade and instead argues that comparative advantage does not guarantee increases in benefits to both trading partners—especially when one partner seeks to distort the market mechanism in its favor. In the face of such mercantilist or protectionist practices, efforts to advance innovation, without retaining manufacturing jobs, will not ensure continued prosperity, as the number of jobs entailed in the invention process is small compared with the number of jobs associated with manufacturing an innovative product for mass consumption. These matters call for the urgent rethinking of trade policy by the United States and other developed nations, if they are to balance their imports and exports and ensure continued economic growth.