A Utility Function to Solve Approximate Linear Equations for Decision Making
Journal Title: Decision Making in Manufacturing and Services - Year 2013, Vol 7, Issue 1
Abstract
Suppose there are a number of decision variables linearly related to a set of outcome variables. There are at least as many outcome variables as the number of decision variables since all decisions are outcomes by themselves. The quality of outcome is evaluated by a utility function. Given desired values for all outcome variables, decision making reduces to “solving” the system of linear equations with respect to the decision variables; the solution being defined as decision variable values such that maximize the utility function. This paper proposes a family of additively separable utility functions which can be defined by setting four intuitive parameters for each outcome variable: the desired value of the outcome, the lower and the upper limits of its admissible interval, and its importance weight. The utility function takes a nonnegative value within the admissible domain and negative outside; permits gradient methods for maximization; is designed to have a small dynamic range for numerical computation. Small examples are presented to illustrate the proposed method.
Authors and Affiliations
Kiyoshi Yoneda, Walter Celaschi
Keywords
Related Articles
- EP ID EP167924
- DOI 10.7494/dmms.2013.7.1.5
- Views 80
- Downloads 0
Coordinating Contracts in SCM: A Review of Methods and Literature
Supply chain coordination through contracts has been a burgeoning area of re- search in recent years. In spite of rapid development of research, there are only a few structured analyses of assumptions, methods, and appli...
Neighbourhood Properties in Some Single Processor Scheduling Problem with Variable Efficiency and Additional Resources
In the paper, we consider a problem of scheduling a set of tasks on a single processor. Each task must be preprocessed before it can be started on a processor. The efficiency of preprocessing is variable, i.e., the rate...
Competitive location under proportional choice: 1-suboptimal points on networks
This paper is concerned with a competitive or voting location problem on networks under a proportional choice rule that has previously been introduced by Bauer et al. (1993). We refine a discretization result of the auth...
Modelling Set-up Times Overlapping Two Periods in the Proportional Lot-Sizing Problem with Identical Parallel Machines
This paper presents a new mixed integer programming model for the Proportional Lot-Sizing Problem (PLSP) with identical parallel machines and set-up times overlappingtwo periods. The proposed model assumes constant perio...
Hyperbolicity of systems describing value functions in differential games which model duopoly problems
Based on the Bressan and Shen approach ([2] or [7]), we present the extension of the class of non-zero sum dierential games for which value functions are described by a weakly hyperbolic Hamilton-Jacobi system. The consi...