Showing papers by "Abraham Charnes published in 1977"

Coalitional and Chance-Constrained Solutions to n-Person Games, II: Two-Stage Solutions

Abstract: We extend the theory of n-person cooperative games in characteristic function form to games with stochastic characteristic functions. We propose a payoff process to the players in these games that is composed of two parts. In the first part the players are promised some prior payoffs. In the second part we use the two-stage solution concepts to modify the prior payoffs in a manner acceptable to the players. We verify the existence of these solution concepts and explore some of their properties.

Managerial Economics -- Past, Present and Future.

Abstract: : In this paper the present state of managerial economics is portrayed against the backdrop of a still-continuing series of methodological developments which began to impact on the civilian management sector in the late 1950's. Historically these developments were associated with changes that were occurring in disciplines like Operations Research, Management Science, and Systems Sciences. The latter involved an orientation toward civilian (private enterprise) management in place of a previous almost exclusive focus on problems in military management. This, in turn, caused these disciplines to interact with and impact on developments in managerial economics. This paper suggests that managerial economics, and these other disciplines should (and will) expand their focus in the near future to include management problems in the public sector. This should increase the interactions between them and also improve their ability to deal with problems in private (and military) management as well. Examples of how this might be accomplished are suggested in this paper via PPBS formats for local government and private enterprise management, along with methods of measuring management performance directed to multiple objectives in private as well as public sector management. (Author)

Constructive proofs of theorems relating to:F(x) = y, with applications

Abstract: Some theorems are given which relate to approximating and establishing the existence of solutions to systemsF(x) = y ofn equations inn unknowns, for variousy, in a region of euclideann-space E n . They generalize known theorems. Viewing complementarity problems and fixed-point problems as examples, known results or generalizations of known results are obtained. A familiar use is made of homotopies H: E n × [0, 1]→E n of the formH(x, t) = (1 −t)F 0 (x) + t[F(x) − y] where theF 0 in this paper is taken to be linear. Simplicial subdivisionsT k of E n × [0, 1] furnish piecewise linear approximatesG k toH. The basic computation is via the generation of piecewise linear curvesP k which satisfyG k (x, t) = 0. Visualizing a sequence {T k } of such subdivisions, with mesh size going to zero, arguments are made on connected, compact limiting curvesP on whichH(x, t) = 0. This paper builds upon and continues recent work of C.B. Garcia.

Technical Note-On Intersection Cuts in Interval Integer Linear Programming

Abstract: In this note we use the concept of intersection cut, introduced by Balas for integer programming problems, to develop a cutting-plane algorithm for solving integer interval linear programming problems. The idea is to apply the cutting-plane algorithm directly on the interval problem without transforming the problem into an equivalent standard integer problem. Such a transformation would significantly increase the effective size of the problem.