Maximization of an Asymmetric Utility Function by the Least Squares
Journal Title: Decision Making in Manufacturing and Services - Year 2014, Vol 8, Issue 1
Abstract
This note points out that a utility maximization procedure proposed in an earlier paper may be reduced to the least squares.The utility function is asymmetric in the sense that for each cue an ideal value and a permissible range are assigned in such a way that the ideal value is not necessarily at the center of the interval, like "a beer of 350 [ml] would be ideal, but acceptable if within [100, 500]". A practical consequence of the observation is that very little programming will be needed to deploy the utility maximization, since software for the least squares is widely available.
Authors and Affiliations
Kiyoshi Yoneda, Antonio Moretti
Keywords
Related Articles
- EP ID EP165613
- DOI 10.7494/dmms.2014.8.1.5
- Views 121
- Downloads 0
A Transfer Line Balancing Problem by Heuristic Methods: Industrial Case Studies
The paper deals with the problem of optimal configuration of a type of transfer lines which are equipped with transfer machines. Such machines perform operations with standard modular spindle heads which are activated se...
An Incremental Approach for Storage and Delivery Planning Problems
We consider a logistic planning problem for simultaneous optimization of the storage and the delivery. This problem arises in the consolidate shipment using an intermediate storage in a supply chain, which is typically f...
Corrigendum to ”Extended Model Formulation of the Proportional Lot-Sizing and Scheduling Problem with Lost Demand Costs”
Amendment to Decision Making in Manufacturing and Services, vol. 5 (1–2), 2011, pp. 49–56
Scheduling of Identical Jobs with Bipartite Incompatibility Graphs on Uniform Machines. Computational Experiments
In the paper we consider the problem of scheduling of unit-length jobs on 3 or 4 uniform parallel machines to minimize schedule length or total completion time. We assume that jobs are subject to some kind of mutual excl...
Insertion Algorithms with Justification for Solving the Resource-Constrained Project Scheduling
The paper presents the resource-constrained project scheduling problem with the makespan minimisation criterion. To solve the problem, the authors propose insertion algorithms which generate schedules with use of forward...