Developing the Concept of Transparency for Use in Supply Relationships

Management concern surrounding the supply of goods and services from business to business, and the related attempts to understand the phenomena observed therein, appears to rest upon a broad range of incompatible perspectives, from political science (often limited to considerations of power) to the logistical (akin to manipulation of a great, benign but dynamic jigsaw puzzle). It appears that all perspectives abrade against the difficulties of exchanging information, knowledge and innovation within the relationships between buying and selling organizations and the apparent chronic systemic inefficiency that transactions often represent in this context. This article addresses these concerns, exploring the concept of transparency and the developments necessary for it to be useful in exchanging sensitive information and tacit knowledge in supply relationships. Our central concern is how the understanding of transparency and its commercial importance may change when it is expressed as a manageable element of the relationship between two organizations rather than as a general property of a broader system (e.g. a supply network, industrial sub-sector, geographical cluster) and what utility this differentiation might hold for managers. The conclusion to the article, and the implication for managers, is that transparency might indeed be created and usefully managed within supply relationships but that it would differ fundamentally in meaning from previously posited concepts, with the same name, in different contexts.     

AN ANALYSIS OF THE DYNAMIC THEORY OF THE MULTI—PRODUCT FIRM USING THE CALCULUS OF VARIATIONS

The purpose of this paper is to present the theory of the multi-product firm in situations where the revenue function depends not only on the rate of output but also on changes in the rate of output, and, similarly, where the cost function depends on changes in the rate of factor utilization as well as the rate of their utilization. Since the analysis will utilize the calculus of variations, a general introduction to this technique is also presented. The model analyzed assumes perfect foresight and knowledge concerning the revenue, cost, and production functions, and the calculus of variations is used to derive the conditions for an extremum. The first section presents the mathematical model and the model of the firm, and the optimality conditions are discussed in the second section.     

GMM Estimation with persistent panel data: an application to production functions

This paper considers the estimation of Cobb-Douglas production functions using panel data covering a large sample of companies observed for a small number of time periods. GMM estimatorshave been found to produce large finite-sample biases when using the standard first-differenced estimator. These biases can be dramatically reduced by exploiting reasonable stationarity restrictions on the initial conditions process. Using data for a panel of R&Dperforming US manufacturing companies we find that the additional instruments used in our extended GMM estimator yield much more reasonable parameter estimates.     

MULTICRITERIA OPTIMIZATION: A GENERAL CHARACTERIZATION OF EFFICIENT SOLUTIONS*

In the context of deterministic multicriteria maximization, a Pareto optimal, nondominated, or efficient solution is a feasible solution for which an increase in value of any one criterion can only be achieved at the expense of a decrease in value of at least one other criterion. Without restrictions of convexity or continuity, it is shown that a solution is efficient if and only if it solves an optimization problem that bounds the various criteria values from below and maximizes a strictly increasing function of these several criteria values. Also included are discussions of previous work concerned with generating or characterizing the set of efficient solutions, and of the interactive approach for resolving multicriteria optimization problems. The final section argues that the paper's main result should not actually be used to generate the set of efficient solutions, relates this result to Simon's theory of satisficing, and then indicates why and how it can be used as the basis for interactive procedures with desirable characteristics.     

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.     

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.     

A cyclical view of the relationship between corporate governance and strategic management

The vast majority of research on the relationship between corporate governance and strategic management focuses on the impact of corporate governance on strategic management. In this article we propose a cyclical model, highlighting that strategic decisions can also affect corporate governance through shaping firm ownership structure. We discuss the impacts of strategic decisions on firm ownership structure and corporate governance in the contexts of publicly traded firms, private firms, and the privatization of state-owned enterprises. We hope that our cyclical model can promote researchers to develop a more complete view about the relationships between strategic management, ownership structure, and corporate governance.     

A Comparative Pharmacokinetic Estimate of Mercury in U.S. Infants Following Yearly Exposures to Inactivated Influenza Vaccines Containing Thimerosal

The use of thimerosal preservative in childhood vaccines has been largely eliminated over the past decade in the United States because vaccines have been reformulated in single‐dose vials that do not require preservative. An exception is the inactivated influenza vaccines, which are formulated in both multidose vials requiring preservative and preservative‐free single‐dose vials. As part of an ongoing evaluation by USFDA of the safety of biologics throughout their lifecycle, the infant body burden of mercury following scheduled exposures to thimerosal preservative in inactivated influenza vaccines in the United States was estimated and compared to the infant body burden of mercury following daily exposures to dietary methylmercury at the reference dose established by the USEPA. Body burdens were estimated using kinetic parameters derived from experiments conducted in infant monkeys that were exposed episodically to thimerosal or MeHg at identical doses. We found that the body burden of mercury (AUC) in infants (including low birth weight) over the first 4.5 years of life following yearly exposures to thimerosal was two orders of magnitude lower than that estimated for exposures to the lowest regulatory threshold for MeHg over the same time period. In addition, peak body burdens of mercury following episodic exposures to thimerosal in this worst‐case analysis did not exceed the corresponding safe body burden of mercury from methylmercury at any time, even for low‐birth‐weight infants. Our pharmacokinetic analysis supports the acknowledged safety of thimerosal when used as a preservative at current levels in certain multidose infant vaccines in the United States.     

Perceptions of Randomized Security Schedules

Security of infrastructure is a major concern. Traditional security schedules are unable to provide omnipresent coverage; consequently, adversaries can exploit predictable vulnerabilities to their advantage. Randomized security schedules, which randomly deploy security measures, overcome these limitations, but public perceptions of such schedules have not been examined. In this experiment, participants were asked to make a choice between attending a venue that employed a traditional (i.e., search everyone) or a random (i.e., a probability of being searched) security schedule. The absolute probability of detecting contraband was manipulated (i.e., 1/10, 1/4, 1/2) but equivalent between the two schedule types. In general, participants were indifferent to either security schedule, regardless of the probability of detection. The randomized schedule was deemed more convenient, but the traditional schedule was considered fairer and safer. There were no differences between traditional and random schedule in terms of perceived effectiveness or deterrence. Policy implications for the implementation and utilization of randomized schedules are discussed.