Abstract
Define a design to be any planar setD of known areaa, but of unknown shape and location; more generally, a design can be any set inR d of measurea. For example, a design might be one floor of a warehouse, or a sports arena of known seating capacity. Suppose that the design has, say,m users, or evaluators, with user/evaluatori having a design disutility functionu i , 1≤i≤m, which can be defined for all points in the plane independently of the designs of interest. Given any designD, denote byG i (D) the disutility ofD to user/evaluatori where, by definition,G i (D) is the supremum ofu i over the setD, 1≤i≤m. LetG(D) be the vector with entriesG i (D), 1≤i≤m, and define a design to be efficient if it solves the vector minimization problem obtained using the set of vectors {G(D):D a design}. Given mild assumptions about the disutility functions, and a slight refinement of the design definition to rule out certain pathologies, we present necessary and sufficient conditions for a design to be efficient, and study properties of efficient designs. In the final section, we extend the analysis to more generall p -measures of design disutility.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.