A METHOD FOR SOLVING LINEAR PROGRAMS WITH VARIABLE RESOURCES

This paper is concerned with the solution of linear and linear goal programming problems in which the values of the right-hand side parameters are not fixed constants. Specifically, we are concerned with linear optimization problems in which the right-hand sides of the constraining equations are free to vary subject to a set of linear constraining equations. By formulating a relaxed linear program wherein the right-hand sides are treated as variables, we show how it is possible to solve one larger linear program that yields as a solution not only the optimal values for the decision variables, but also the optimal values for the right-hand sides.     

THE DEVELOPMENT OF AN INTEGRATIVE CURRICULUM IN AN UNDERGRADUATE BUSINESS PROGRAM*

This paper describes how the core portion of the undergraduate business program at Indiana University was revised to facilitate integration of basic functionally oriented decision making skills and thus help students gain a deeper understanding of the interdependence of business decisions. It relates, in essence, why and how a single computer-oriented case study which demanded a solution to a large-scale, unified finance-marketing-production problem was used at Indiana University, mentions how we plan to accomplish further integration of functional material, and provides some insight into student reaction to what was, in fact, a massive project from both student and administrative points of view.     

OPTIMIZING UNIVERSITY ADMISSIONS PLANNING

The crucial issues in the administration of higher education embody the very purpose, function, and concept of each institution. The institution's administrative policies are based on the combined philosophy of many conflicting interest groups such as taxpayers, donors, administrators, faculty, students, staff, and users of university services. A function performed by the university which is receiving increasing attention and outside pressure is the formulation of admissions policy for newly entering students. This paper investigates problems involved in the admissions planning and presents a goal programming model as an optimization tool for the problem.     

A new heteroscedastic regression to analyze mass loss of wood in civil construction in Brazil

A heteroscedastic regression based on the odd log-logistic Marshall–Olkin normal (OLLMON) distribution is defined by extending previous models. Some structural properties of this distribution are presented. The estimation of the parameters is addressed by maximum likelihood. For different parameter settings, sample sizes and some scenarios, various simulations investigate the performance of the heteroscedastic OLLMON regression. We use residual analysis to detect influential observations and to check the model assumptions. The new regression explains the mass loss of different wood species in civil construction in Brazil.     

Information theory and risk in capital markets

The present empirical study applies the methodology of information theory to the problem of assessing and separating capital market risk, which is separated into its systematic and unsystematic components. Monthly return relatives for all securities traded on the New York Stock Exchange are examined for the period 1926 to 1971, which is segmented into six 7-year subperiods. The securities are combined into portfolios of various sizes and ranked. It is concluded that although both systematic and unsystematic risks have increased over the 45-year interval—particularly between the pre-1940 and post-1940 periods—they have maintained their relative share of the total risk over the same period.     

Physician career management: organizational strategies for the 21st century.

Burnout is a state of physical, emotional, and mental exhaustion caused by long-term involvement in situations that are emotionally demanding. It is not stress, per se, that causes burnout, as many thrive in stressful, demanding careers. Rather, burnout results when stress continuously outweighs the sense of effectiveness, accomplishment, and reward. And, this fate is sealed when one feels helpless to effect significant change in the conditions that fuel the stress. Establishing an organizational environment that reduces the risk of physician burnout requires a new commitment of resources, one that can be challenging to justify to decision-makers with a strictly short-term, bottom line orientation. The key issues to consider in shaping a physician career management program include: (1) entry of new physician employees into the organization; (2) productivity measures; (3) responsiveness to safety concerns; (4) administrative and policy issues; and (5) variety and growth opportunities.     

Contractors and their Psychological Contracts

It is commonly assumed that contractors are largely calculative, instrumental and self-interested in their relationship with organizations and interface with them accordingly (e.g. low corporate interest and emotional investment). This paper describes a survey involving 117 contractors (62 on 'permanent' agency contracts and 55 on 'temporary' agency contracts) and a comparable (age, job level/grade, years of work experience) group of 86 direct employees (on fixed-term contracts). The survey comprised measures of the psychological contract, of organizational identification, social (corporate) attraction, team spirit and intention to leave. The findings show that contractors are not inevitably 'emotionally' detached from their place of work, in some cases investing in it as much as direct company employees. While transactional (e.g. financial gain, instrumentality) exchange considerations were more salient among contractors than employees, this did not appear to preclude the development of a relational (e.g. corporate integration and long-term investment) contractual orientation. 'Team spirit' and 'organizational identification' predicted the development of relational contracts over and above contractual status. The findings and their management implications are discussed in terms of 'strategic partnership'.     

Compact labelings for efficient first-order model-checking

We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the graphs of every class that is nicely locally clique-width-decomposable. This notion generalizes that of a nicely locally tree-decomposable class. The graphs of such classes can be covered by graphs of bounded clique-width with limited overlaps. We also consider such labelings for bounded first-order formulas on graph classes of bounded expansion. Some of these results are extended to counting queries.     

On the number of separable partitions

Consider partitions of a given set A of n distinct points in general position in ℝ ^d into parts where each pair of parts can be separated by a hyperplane that contains a given set of points E. We consider the problem of counting and generating all such partitions (correcting a classic 1967 result of Harding about the number of such partitions into two parts). Applications of the result to partition problems are presented.