Scaling Invariance and a Characterization of Linear Objective Functions. Saša Pekeč
|
|
- Cornelius Gray
- 5 years ago
- Views:
Transcription
1 Scaling Invariance and a Characterization of Linear Objective Functions Saša Pekeč Decision Sciences The Fuqua School of Business Duke University pekec@duke.edu ADT 2011 October 27, 2011
2 A Generic Discrete Choice Problem A finite set of alternatives [n] := {1, 2,..., n} Info about alternatives given by w = (w 1,..., w n ) R n Value of choice S, S [n], determined by f S : R n R: f S (w) The set of all feasible choices S: H 2 [n] The decision-maker chooses the "best" S H: max S H f S(w) Saša Pekeč (Duke University) Invariance to Linear Scaling ADT / 20
3 A Generic Discrete Choice Problem max f S (w) S H f S can have different functional forms Example: a simple unique functional form can be represented as f S (w) = i S w i max w x Ax b x {0, 1} n 0-1 integer programming problem Note: linear objective function w x is a modeling choice. Saša Pekeč (Duke University) Invariance to Linear Scaling ADT / 20
4 Data representation What do values w 1,..., w n typically represent? money, time, physical measurement (e.g., volume, length, etc.),... What is the effect of the unit of measurement convention to the optimal choice? Should optimal choice be different if money is measured in EUR or USD or GBP? Should optimal choice be different if time is measured in seconds or minutes? A modest scaling invariance requirement: S is an optimal choice for w if and only if S is an optimal choice for λw, λ > 0 Saša Pekeč (Duke University) Invariance to Linear Scaling ADT / 20
5 Invariance to Linear Scaling Invariance to Linear Scaling (ILS) w R n, λ > 0 : f S (w) = max{f S (w) : S H} f S (λw) = max{f S (λw) : S H} minimal invariance requirement: same scale for all w i concept of meaningfulness from Measurement Theory linear objective w x (f S (w) = i S w i) satisfies (ILS) What constraints, if any, does (ILS) impose on the choice of the objective function {f S }? Saša Pekeč (Duke University) Invariance to Linear Scaling ADT / 20
6 (ILS) and linear objectives Note that there are 2 n 1 objective functions f S. (ILS) is a single-parameter linear scaling property. Still, we show that (ILS) severely limits plausible objective functions. Under "reasonable" conditions, all f S have to be linear for (ILS) to hold "Reasonable conditions"??? Saša Pekeč (Duke University) Invariance to Linear Scaling ADT / 20
7 Conditions (L) Locality (N) Normality (C) Completeness (S) Separability Theorem (Preview) If (ILS), (L), (N), (C), (S) all hold, then all f S are linear. Saša Pekeč (Duke University) Invariance to Linear Scaling ADT / 20
8 (L) Locality It is reasonable to assume that the value f S (w) only depends on the weights corresponding to the elements from S. Changing the weight w j corresponding to any element j S, will not change the value of f S. (L) Locality Family of functions {f S } has property (L) if S [n], j S : f S w j = 0 Saša Pekeč (Duke University) Invariance to Linear Scaling ADT / 20
9 (N) Normality The weights w should (in a transparent way) indicate the value of f S for all singletons S. (N) Normality Family of functions {f S } has property (N) if, i, w R n, f {i} (w) = w i The property (N) should not be considered restrictive: If {f S } were not normalized, the problem could be reformulated by introducing new weights w defined by w i := f {i} (w i ). Of course, all other f S would need to be redefined: f S ( w) := f S (w). Saša Pekeč (Duke University) Invariance to Linear Scaling ADT / 20
10 (C) Completeness An unbounded change in w should result in unbounded change in f S (w). In fact, we require that f S (R n ) = R. (C) Completeness Family of functions {f S } has property (C) if every f S is surjective. (The main result holds with a considerably weaker condition.) Saša Pekeč (Duke University) Invariance to Linear Scaling ADT / 20
11 (S) Separability The rate of change of f S (w) with respect to changing w i should depend only on w i (and not on the values of w j, j i). Furthermore, this dependence should be "smooth". (S) Separability A function f has property (S) if for any i [n], there exists a function g i : R R, g i C 1 (R), such that f w i (w) = g i (w i ). Family of functions {f S } has property (S) if every function in the family has property (S). The separability is restrictive from the modeling point of view. Saša Pekeč (Duke University) Invariance to Linear Scaling ADT / 20
12 (S) Separability (S) Separability A function f has property (S) if for any i [n], there exists a function g i : R R, g i C 1 (R), such that f w i (w) = g i (w i ). Family of functions {f S } has property (S) if every function in the family has property (S). The separability is restrictive from the modeling point of view. It excludes: norms: f S (w) = w S p, with p 1 OWA operators: f S (w) = c i w r(i), where r is the rank ordering permutation of w i on S (max and min are special cases) fuzzy measure-based operators ( e.g. Choquet capacity idea) Saša Pekeč (Duke University) Invariance to Linear Scaling ADT / 20
13 The Main Theorem Proposition {f S } satisfies (ILS) for any H if and only if S, T [n], w R n, λ R + : f S (w) f T (w) f S (λw) f T (λw) Theorem Suppose that {f S } satisfies (L), (N), (C), and (S). Then {f S } has property (ILS) if and only if every f S is linear, that is, if and only if for every S [n] there exist constants C S,i, i S, such that f S (w) = i S C S,i w i. Saša Pekeč (Duke University) Invariance to Linear Scaling ADT / 20
14 Proof of the Main Theorem Def. f : R n R is r-homogeneous if λ > 0, w, f (λw) = λ r f (w) If (L), (C), and (ILS) hold, then for S, T [n], f S is r-homogeneous f T is r-homogeneous. Euler s homogeneity relation (Eichhorn, 1978). For r-homogeneous, differentiable f : rf (w) = f (w) w 1 + w 1 f (w) f (w) w w n. w 2 w k For r-homogeneous f that satisfies (S), C i so that n f (w 1,..., w n ) = C i wi r. i=1 (N) implies 1-homogeneity for {f S } Saša Pekeč (Duke University) Invariance to Linear Scaling ADT / 20
15 Main Theorem Variations (N) and (C) are not necessary. Theorem. Suppose that {f S } satisfies (L), and (S) and that at least one f S is r-homogeneous. Also, suppose that S, T, f S (R n ) = f T (R n ). Then (ILS) holds if and only if all f S are linear. Note that (S) is critical: f S = [ (w i ) p] 1/p i S with p > 1 and odd, satisfies all conditions except (S). Saša Pekeč (Duke University) Invariance to Linear Scaling ADT / 20
16 Optimal Aggregation Conditions Aggregating different subsets of {w 1, w 2,..., w n } Each subset S has its own aggregation function f S Want (ILS): w, λ > 0: Properties. f S (w) f T (w) f S (λw) f T (λw) (U) Unanimity. S, w R, f S (w, w,..., w) = w. Note that (U) (N). (Y) Symmetry. Let Π S = {π Π n : π(s) = S} Then for any w and any π Π S f S (w 1, w 2,..., w n ) = f S (w π(1), w π(2),..., w π(n) ) Saša Pekeč (Duke University) Invariance to Linear Scaling ADT / 20
17 ILS and the Arithmetic Mean Theorem Suppose that {f S } satisfies (L), (C), (S), (U), and (Y). Then (ILS) holds if and only if every f S is the arithmetic mean of {w i : i S}. Every f S is linear by the main theorem (and (U) (N)). By (Y), linear coefficients in f S are equal. By (U), linear coefficients are 1/ S. Saša Pekeč (Duke University) Invariance to Linear Scaling ADT / 20
18 Recap Parameters of the decision/optimization problem rarely have unique representation. Representation invariance constrains modeling choices. The simplest case of invariance to linear scaling (money, time, etc.) together with Separability, dictates that any "well-behaved" objective function must be linear. (The Main Theorem.) Symmetry and Unanimity further imply that the arithmetic mean is the only sensible aggregation choice. (Opt. Aggregation Thm.) Saša Pekeč (Duke University) Invariance to Linear Scaling ADT / 20
19 Comments Separability condition without differentiability? Ordinal scales and OWA operators characterization? Issues with meaningfulness: only order statistics survive (i.e., degenerate weight with w i 0 for only one i). If data representation has more degrees of freedom (e.g., interval scales, ordinal scales), constraints are imposed on the structure of the set of feasible solutions. What if the feasible set H depends on parameter representation? Saša Pekeč (Duke University) Invariance to Linear Scaling ADT / 20
20 Scaling Invariance and a Characterization of Linear Objective Functions Saša Pekeč Decision Sciences The Fuqua School of Business Duke University pekec@duke.edu ADT 2011 October 27, 2011
On tolerant or intolerant character of interacting criteria in aggregation by the Choquet integral
On tolerant or intolerant character of interacting criteria in aggregation by the Choquet integral Jean-Luc Marichal Department of Mathematics, Brigham Young University 292 TMCB, Provo, Utah 84602, U.S.A.
More informationAn axiomatic approach of the discrete Sugeno integral as a tool to aggregate interacting criteria in a qualitative framework
An axiomatic approach of the discrete Sugeno integral as a tool to aggregate interacting criteria in a qualitative framework Jean-Luc Marichal Revised version, September 20, 2000 Abstract We present a
More informationOrdinal aggregation and ranking
Ordinal aggregation and ranking Dieter Denneberg, Universität Bremen denneberg@math.uni-bremen.de October 2011 Abstract In applications often the scales of functions are not naturally embedded in the real
More informationAggregation on Finite Ordinal Scales by Scale Independent Functions
Aggregation on Finite Ordinal Scales by Scale Independent Functions Jean-Luc MARICHAL (jean-luc.marichal[at]uni.lu) Faculty of Law, Economics, and Finance, University of Luxembourg 162A, avenue de la Faïencerie,
More information31.1.1Partial derivatives
Module 11 : Partial derivatives, Chain rules, Implicit differentiation, Gradient, Directional derivatives Lecture 31 : Partial derivatives [Section 31.1] Objectives In this section you will learn the following
More informationEC487 Advanced Microeconomics, Part I: Lecture 2
EC487 Advanced Microeconomics, Part I: Lecture 2 Leonardo Felli 32L.LG.04 6 October, 2017 Properties of the Profit Function Recall the following property of the profit function π(p, w) = max x p f (x)
More informationInverse Optimization for Linear Fractional Programming
444 International Journal of Physical and Mathematical Sciences Vol 4, No 1 (2013) ISSN: 2010 1791 International Journal of Physical and Mathematical Sciences journal homepage: http://icoci.org/ijpms Inverse
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
More informationA Complete Description of Comparison Meaningful Functions
A Complete Description of Comparison Meaningful Functions Jean-Luc MARICHAL Radko MESIAR Tatiana RÜCKSCHLOSSOVÁ Abstract Comparison meaningful functions acting on some real interval E are completely described
More informationSubmodular Functions Properties Algorithms Machine Learning
Submodular Functions Properties Algorithms Machine Learning Rémi Gilleron Inria Lille - Nord Europe & LIFL & Univ Lille Jan. 12 revised Aug. 14 Rémi Gilleron (Mostrare) Submodular Functions Jan. 12 revised
More informationFuzzy Sets and Fuzzy Techniques. Sladoje. Introduction. Operations. Combinations. Aggregation Operations. An Application: Fuzzy Morphologies
Sets and Sets and Outline of Sets and Lecture 8 on Sets of 1 2 Centre for Image alysis Uppsala University 3 of February 15, 2007 4 5 Sets and Standard fuzzy operations Sets and Properties of the standard
More informationThe Axiomatic Method in Social Choice Theory:
The Axiomatic Method in Social Choice Theory: Preference Aggregation, Judgment Aggregation, Graph Aggregation Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss
More informationFavoring Consensus and Penalizing Disagreement in Group Decision Making
Favoring Consensus and Penalizing Disagreement in Group Decision Making Paper: jc*-**-**-**** Favoring Consensus and Penalizing Disagreement in Group Decision Making José Luis García-Lapresta PRESAD Research
More informationA NOVEL TRIANGULAR INTERVAL TYPE-2 INTUITIONISTIC FUZZY SETS AND THEIR AGGREGATION OPERATORS
1 A NOVEL TRIANGULAR INTERVAL TYPE-2 INTUITIONISTIC FUZZY SETS AND THEIR AGGREGATION OPERATORS HARISH GARG SUKHVEER SINGH Abstract. The obective of this work is to present a triangular interval type- 2
More informationDuality and Projections
Duality and Projections What s the use? thst@man.dtu.dk DTU-Management Technical University of Denmark 1 Outline Projections revisited... Farka s lemma Proposition 2.22 and 2.23 Duality theory (2.6) Complementary
More informationTighter Bounds for Facility Games
Tighter Bounds for Facility Games Pinyan Lu 1, Yajun Wang 1, and Yuan Zhou 1 Microsoft Research Asia {pinyanl, yajunw}@microsoft.com Carnegie Mellon University yuanzhou@cs.cmu.edu Abstract. In one dimensional
More informationCO350 Linear Programming Chapter 8: Degeneracy and Finite Termination
CO350 Linear Programming Chapter 8: Degeneracy and Finite Termination 27th June 2005 Chapter 8: Finite Termination 1 The perturbation method Recap max c T x (P ) s.t. Ax = b x 0 Assumption: B is a feasible
More informationDef. A topological space X is disconnected if it admits a non-trivial splitting: (We ll abbreviate disjoint union of two subsets A and B meaning A B =
CONNECTEDNESS-Notes Def. A topological space X is disconnected if it admits a non-trivial splitting: X = A B, A B =, A, B open in X, and non-empty. (We ll abbreviate disjoint union of two subsets A and
More informationContents Propositional Logic: Proofs from Axioms and Inference Rules
Contents 1 Propositional Logic: Proofs from Axioms and Inference Rules... 1 1.1 Introduction... 1 1.1.1 An Example Demonstrating the Use of Logic in Real Life... 2 1.2 The Pure Propositional Calculus...
More informationAGGREGATION OPERATORS FOR MULTICRITERIA DECISION AID. Jean-Luc Marichal University of Liège
AGGREGATION OPERATORS FOR MULTICRITERIA DECISION AID by Jean-Luc Marichal University of Liège 1 2 1. Aggregation in MCDM Set of alternatives A = {a, b, c,...} Set of criteria N = {1,..., n}. For all i
More informationFOMBA Soumana, Toulouse University, France and Bamako University, Mali ZARATE Pascale, Toulouse University, France KILGOUR Marc, Wilfrid Laurier
FOMBA Soumana, Toulouse University, France and Bamako University, Mali ZARATE Pascale, Toulouse University, France KILGOUR Marc, Wilfrid Laurier University, Waterloo, Canada 1 Introduction Aggregation
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationChoquet Integral and Applications
Choquet Integral and Applications Brice Mayag brice.mayag@ecp.fr École Centrale Paris 14 Janvier 2011 Brice Mayag brice.mayag@ecp.fr (École Centrale Paris) Choquet Integral and Applications 14 Janvier
More informationOptimization under Ordinal Scales: When is a Greedy Solution Optimal?
Optimization under Ordinal Scales: When is a Greedy Solution Optimal? Aleksandar Pekeč BRICS Department of Computer Science University of Aarhus DK-8000 Aarhus C, Denmark pekec@brics.dk Abstract Mathematical
More informationRoots of Polynomials in Subgroups of F p and Applications to Congruences
Roots of Polynomials in Subgroups of F p and Applications to Congruences Enrico Bombieri, Jean Bourgain, Sergei Konyagin IAS, Princeton, IAS Princeton, Moscow State University The decimation problem Let
More information3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2014 1 3 FUNCTIONS 3.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from A to B is a rule that assigns to each element in the set
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More informationProspect Theory and the Wisdom of the Inner Crowd
Prospect Theory and the Wisdom of the Inner Crowd Stephan Hartmann July 23, 2017 Abstract We give a probabilistic justification of the shape of one of the probability weighting functions used in Prospect
More informationRegional Solution of Constrained LQ Optimal Control
Regional Solution of Constrained LQ Optimal Control José DeDoná September 2004 Outline 1 Recap on the Solution for N = 2 2 Regional Explicit Solution Comparison with the Maximal Output Admissible Set 3
More informationUNIVERSITY OF NOTTINGHAM. Discussion Papers in Economics. Contraction consistent stochastic choice correspondence
UNIVERSITY OF NOTTINGHM Discussion Papers in Economics Discussion Paper No. 08/04 Contraction consistent stochastic choice correspondence y Indraneel Dasgupta June 2008 2008 DP 08/04 Contraction consistent
More informationHASSE-MINKOWSKI THEOREM
HASSE-MINKOWSKI THEOREM KIM, SUNGJIN 1. Introduction In rough terms, a local-global principle is a statement that asserts that a certain property is true globally if and only if it is true everywhere locally.
More informationFollow links for Class Use and other Permissions. For more information send to:
COPYRIGHT NOTICE: Ariel Rubinstein: Lecture Notes in Microeconomic Theory is published by Princeton University Press and copyrighted, c 2006, by Princeton University Press. All rights reserved. No part
More informationNon Additive Measures for Group Multi Attribute Decision Models
Non Additive Measures for Group Multi Attribute Decision Models Marta Cardin, Silvio Giove Dept. of Applied Mathematics, University of Venice Venice, Italy Email: mcardin@unive.it, sgiove@unive.it Abstract
More information6.207/14.15: Networks Lecture 24: Decisions in Groups
6.207/14.15: Networks Lecture 24: Decisions in Groups Daron Acemoglu and Asu Ozdaglar MIT December 9, 2009 1 Introduction Outline Group and collective choices Arrow s Impossibility Theorem Gibbard-Satterthwaite
More informationLinear Programming: Simplex
Linear Programming: Simplex Stephen J. Wright 1 2 Computer Sciences Department, University of Wisconsin-Madison. IMA, August 2016 Stephen Wright (UW-Madison) Linear Programming: Simplex IMA, August 2016
More informationComputational Aspects of Aggregation in Biological Systems
Computational Aspects of Aggregation in Biological Systems Vladik Kreinovich and Max Shpak University of Texas at El Paso, El Paso, TX 79968, USA vladik@utep.edu, mshpak@utep.edu Summary. Many biologically
More informationChapter 2. Decision Making under Risk. 2.1 Consequences and Lotteries
Chapter 2 Decision Making under Risk In the previous lecture I considered abstract choice problems. In this section, I will focus on a special class of choice problems and impose more structure on the
More informationAM 106/206: Applied Algebra Madhu Sudan 1. Lecture Notes 12
AM 106/206: Applied Algebra Madhu Sudan 1 Lecture Notes 12 October 19 2016 Reading: Gallian Chs. 27 & 28 Most of the applications of group theory to the physical sciences are through the study of the symmetry
More informationWeighting Expert Opinions in Group Decision Making for the Influential Effects between Variables in a Bayesian Network Model
Weighting Expert Opinions in Group Decision Making for the Influential Effects between Variables in a Bayesian Network Model Nipat Jongsawat 1, Wichian Premchaiswadi 2 Graduate School of Information Technology
More information1 Invariant subspaces
MATH 2040 Linear Algebra II Lecture Notes by Martin Li Lecture 8 Eigenvalues, eigenvectors and invariant subspaces 1 In previous lectures we have studied linear maps T : V W from a vector space V to another
More informationLexicographic Choice under Variable Capacity Constraints
Lexicographic Choice under Variable Capacity Constraints Battal Doğan Serhat Doğan Kemal Yıldız May 14, 2017 Abstract In several matching markets, in order to achieve diversity, agents priorities are allowed
More informationNorm-Constrained Choices
Analyse & Kritik 29/2007 ( c Lucius & Lucius, Stuttgart) p. 329 339 Yongsheng Xu Norm-Constrained Choices Abstract: This paper develops a general and unified framework to discuss individual choice behaviors
More informationminimize x subject to (x 2)(x 4) u,
Math 6366/6367: Optimization and Variational Methods Sample Preliminary Exam Questions 1. Suppose that f : [, L] R is a C 2 -function with f () on (, L) and that you have explicit formulae for
More informationarxiv: v2 [cs.ds] 27 Nov 2014
Single machine scheduling problems with uncertain parameters and the OWA criterion arxiv:1405.5371v2 [cs.ds] 27 Nov 2014 Adam Kasperski Institute of Industrial Engineering and Management, Wroc law University
More informationGRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.
GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,
More information1. Introduction Recap
1. Introduction Recap 1. Tractable and intractable problems polynomial-boundness: O(n k ) 2. NP-complete problems informal definition 3. Examples of P vs. NP difference may appear only slightly 4. Optimization
More informationOn lower bounds for integration of multivariate permutation-invariant functions
On lower bounds for of multivariate permutation-invariant functions Markus Weimar Philipps-University Marburg Oberwolfach October 2013 Research supported by Deutsche Forschungsgemeinschaft DFG (DA 360/19-1)
More informationOn Generalization of Fuzzy Connectives
n Generalization of Fuzzy Connectives Imre J. Rudas udapest Tech Doberdó út 6, H-1034 udapest, Hungary rudas@bmf.hu bstract: In real applications of fuzzy logic the properties of aggregation operators
More informationRules for Aggregating Information
Rules for Aggregating Information Christopher P. Chambers and Alan D. Miller May 1, 2010 Abstract We present a model of information aggregation in which agents information is represented through partitions
More informationAggregation and Non-Contradiction
Aggregation and Non-Contradiction Ana Pradera Dept. de Informática, Estadística y Telemática Universidad Rey Juan Carlos. 28933 Móstoles. Madrid. Spain ana.pradera@urjc.es Enric Trillas Dept. de Inteligencia
More informationIE418 Integer Programming
IE418: Integer Programming Department of Industrial and Systems Engineering Lehigh University 23rd February 2005 The Ingredients Some Easy Problems The Hard Problems Computational Complexity The ingredients
More informationChapter 2 An Overview of Multiple Criteria Decision Aid
Chapter 2 An Overview of Multiple Criteria Decision Aid Abstract This chapter provides an overview of the multicriteria decision aid paradigm. The discussion covers the main features and concepts in the
More informationDimension reduction for semidefinite programming
1 / 22 Dimension reduction for semidefinite programming Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology
More informationLINKED HOM SPACES BRIAN OSSERMAN
LINKED HOM SPACES BRIAN OSSERMAN Abstract. In this note, we describe a theory of linked Hom spaces which complements that of linked Grassmannians. Given two chains of vector bundles linked by maps in both
More informationChern forms and the Fredholm determinant
CHAPTER 10 Chern forms and the Fredholm determinant Lecture 10: 20 October, 2005 I showed in the lecture before last that the topological group G = G (Y ;E) for any compact manifold of positive dimension,
More informationThe dual simplex method with bounds
The dual simplex method with bounds Linear programming basis. Let a linear programming problem be given by min s.t. c T x Ax = b x R n, (P) where we assume A R m n to be full row rank (we will see in the
More informationMODEL ANSWERS TO THE FIRST QUIZ. 1. (18pts) (i) Give the definition of a m n matrix. A m n matrix with entries in a field F is a function
MODEL ANSWERS TO THE FIRST QUIZ 1. (18pts) (i) Give the definition of a m n matrix. A m n matrix with entries in a field F is a function A: I J F, where I is the set of integers between 1 and m and J is
More informationPartial Path Column Generation for the Vehicle Routing Problem with Time Windows
Partial Path Column Generation for the Vehicle Routing Problem with Time Windows Bjørn Petersen & Mads Kehlet Jepsen } DIKU Department of Computer Science, University of Copenhagen Universitetsparken 1,
More information1. Factorization Divisibility in Z.
8 J. E. CREMONA 1.1. Divisibility in Z. 1. Factorization Definition 1.1.1. Let a, b Z. Then we say that a divides b and write a b if b = ac for some c Z: a b c Z : b = ac. Alternatively, we may say that
More informationData-driven signal processing
1 / 35 Data-driven signal processing Ivan Markovsky 2 / 35 Modern signal processing is model-based 1. system identification prior information model structure 2. model-based design identification data parameter
More informationA necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of
More informationEfficient Binary Fuzzy Measure Representation and Choquet Integral Learning
Efficient Binary Fuzzy Measure Representation and Choquet Integral Learning M. Islam 1 D. T. Anderson 2 X. Du 2 T. Havens 3 C. Wagner 4 1 Mississippi State University, USA 2 University of Missouri, USA
More informationWhat is an integer program? Modelling with Integer Variables. Mixed Integer Program. Let us start with a linear program: max cx s.t.
Modelling with Integer Variables jesla@mandtudk Department of Management Engineering Technical University of Denmark What is an integer program? Let us start with a linear program: st Ax b x 0 where A
More information( ) ( ) ( ) ( ) Given that and its derivative are continuous when, find th values of and. ( ) ( )
1. The piecewise function is defined by where and are constants. Given that and its derivative are continuous when, find th values of and. When When of of Substitute into ; 2. Using the substitution, evaluate
More informationCommutative Algebra MAS439 Lecture 3: Subrings
Commutative Algebra MAS439 Lecture 3: Subrings Paul Johnson paul.johnson@sheffield.ac.uk Hicks J06b October 4th Plan: slow down a little Last week - Didn t finish Course policies + philosophy Sections
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize
More informationYale University Department of Computer Science
Yale University Department of Computer Science Optimal ISP Subscription for Internet Multihoming: Algorithm Design and Implication Analysis Hao Wang Yale University Avi Silberschatz Yale University Haiyong
More informationFINITE-DIMENSIONAL LINEAR ALGEBRA
DISCRETE MATHEMATICS AND ITS APPLICATIONS Series Editor KENNETH H ROSEN FINITE-DIMENSIONAL LINEAR ALGEBRA Mark S Gockenbach Michigan Technological University Houghton, USA CRC Press Taylor & Francis Croup
More informationSYSU Lectures on the Theory of Aggregation Lecture 2: Binary Aggregation with Integrity Constraints
SYSU Lectures on the Theory of Aggregation Lecture 2: Binary Aggregation with Integrity Constraints Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam [ http://www.illc.uva.nl/~ulle/sysu-2014/
More information10. Rank-nullity Definition Let A M m,n (F ). The row space of A is the span of the rows. The column space of A is the span of the columns.
10. Rank-nullity Definition 10.1. Let A M m,n (F ). The row space of A is the span of the rows. The column space of A is the span of the columns. The nullity ν(a) of A is the dimension of the kernel. The
More informationThis corresponds to a within-subject experiment: see same subject make choices from different menus.
Testing Revealed Preference Theory, I: Methodology The revealed preference theory developed last time applied to a single agent. This corresponds to a within-subject experiment: see same subject make choices
More information1.2. Some BRT settings.
1 1.2. Some BRT settings. The BRT settings were defined in Definition 1.11. Most areas of mathematics have a naturally associated family of (multivariate) functions and sets. This usually forms a natural
More informationMA651 Topology. Lecture 9. Compactness 2.
MA651 Topology. Lecture 9. Compactness 2. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology
More informationAcyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs
Acyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs Raphael Louca & Eilyan Bitar School of Electrical and Computer Engineering American Control Conference (ACC) Chicago,
More informationA Strongly Polynomial Simplex Method for Totally Unimodular LP
A Strongly Polynomial Simplex Method for Totally Unimodular LP Shinji Mizuno July 19, 2014 Abstract Kitahara and Mizuno get new bounds for the number of distinct solutions generated by the simplex method
More informationApproval Voting for Committees: Threshold Approaches
Approval Voting for Committees: Threshold Approaches Peter Fishburn Aleksandar Pekeč WORKING DRAFT PLEASE DO NOT CITE WITHOUT PERMISSION Abstract When electing a committee from the pool of individual candidates,
More information3.3 Easy ILP problems and totally unimodular matrices
3.3 Easy ILP problems and totally unimodular matrices Consider a generic ILP problem expressed in standard form where A Z m n with n m, and b Z m. min{c t x : Ax = b, x Z n +} (1) P(b) = {x R n : Ax =
More informationInteger Programming: Cutting Planes
OptIntro 1 / 39 Integer Programming: Cutting Planes Eduardo Camponogara Department of Automation and Systems Engineering Federal University of Santa Catarina October 2016 OptIntro 2 / 39 Summary Introduction
More informationMath 273a: Optimization The Simplex method
Math 273a: Optimization The Simplex method Instructor: Wotao Yin Department of Mathematics, UCLA Fall 2015 material taken from the textbook Chong-Zak, 4th Ed. Overview: idea and approach If a standard-form
More information56:171 Operations Research Fall 1998
56:171 Operations Research Fall 1998 Quiz Solutions D.L.Bricker Dept of Mechanical & Industrial Engineering University of Iowa 56:171 Operations Research Quiz
More informationAn axiomatic approach of the discrete Choquet integral as a tool to aggregate interacting criteria
An axiomatic approach of the discrete Choquet integral as a tool to aggregate interacting criteria Jean-Luc Marichal Revised version, December 22, 999 Abstract The most often used operator to aggregate
More informationOn pairwise comparison matrices that can be made consistent by the modification of a few elements
Noname manuscript No. (will be inserted by the editor) On pairwise comparison matrices that can be made consistent by the modification of a few elements Sándor Bozóki 1,2 János Fülöp 1,3 Attila Poesz 2
More informationEconomics Bulletin, 2012, Vol. 32 No. 1 pp Introduction. 2. The preliminaries
1. Introduction In this paper we reconsider the problem of axiomatizing scoring rules. Early results on this problem are due to Smith (1973) and Young (1975). They characterized social welfare and social
More informationAn axiomatic characterization of the prudent order preference function
An axiomatic characterization of the prudent order preference function Claude Lamboray Abstract In this paper, we are interested in a preference function that associates to a profile of linear orders the
More informationThe Relation Between Pseudonormality and Quasiregularity in Constrained Optimization 1
October 2003 The Relation Between Pseudonormality and Quasiregularity in Constrained Optimization 1 by Asuman E. Ozdaglar and Dimitri P. Bertsekas 2 Abstract We consider optimization problems with equality,
More informationLinear Analysis Lecture 16
Linear Analysis Lecture 16 The QR Factorization Recall the Gram-Schmidt orthogonalization process. Let V be an inner product space, and suppose a 1,..., a n V are linearly independent. Define q 1,...,
More informationLinear vector spaces and subspaces.
Math 2051 W2008 Margo Kondratieva Week 1 Linear vector spaces and subspaces. Section 1.1 The notion of a linear vector space. For the purpose of these notes we regard (m 1)-matrices as m-dimensional vectors,
More informationSocial Welfare Functions that Satisfy Pareto, Anonymity, and Neutrality: Countable Many Alternatives. Donald E. Campbell College of William and Mary
Social Welfare Functions that Satisfy Pareto, Anonymity, and Neutrality: Countable Many Alternatives Donald E. Campbell College of William and Mary Jerry S. Kelly Syracuse University College of William
More informationFUZZY CRITERIA IMPORTANCE DEPENDING ON MEMBERSHIP DEGREES OF FUZZY RELATIONS
,n;okji~ na Br.nrapcxera aka,n;emlrn na HaYKMTe Comptes rendus de l'academic bulgare des Sciences Tome 61, No 5, 2008 MATHEMATIQUES Sous-ensemble flous FUZZY CRITERIA IMPORTANCE DEPENDING ON MEMBERSHIP
More informationNumerical Methods for ODEs. Lectures for PSU Summer Programs Xiantao Li
Numerical Methods for ODEs Lectures for PSU Summer Programs Xiantao Li Outline Introduction Some Challenges Numerical methods for ODEs Stiff ODEs Accuracy Constrained dynamics Stability Coarse-graining
More informationJOSEPH B. KADANE AND JIASHUN JIN, IN HONOR OF ARNOLD ZELLNER
UNIFORM DISTRIBUTIONS ON THE INTEGERS: A CONNECTION TO THE BERNOUILLI RANDOM WALK JOSEPH B. KADANE AND JIASHUN JIN, IN HONOR OF ARNOLD ZELLNER Abstract. Associate to each subset of the integers its almost
More informationStrategic Manipulation and Regular Decomposition of Fuzzy Preference Relations
Strategic Manipulation and Regular Decomposition of Fuzzy Preference Relations Olfa Meddeb, Fouad Ben Abdelaziz, José Rui Figueira September 27, 2007 LARODEC, Institut Supérieur de Gestion, 41, Rue de
More informationUC Berkeley Department of Electrical Engineering and Computer Science. EECS 227A Nonlinear and Convex Optimization. Solutions 5 Fall 2009
UC Berkeley Department of Electrical Engineering and Computer Science EECS 227A Nonlinear and Convex Optimization Solutions 5 Fall 2009 Reading: Boyd and Vandenberghe, Chapter 5 Solution 5.1 Note that
More informationMilford Public Schools Curriculum. Department: Mathematics Course Name: Algebra 1 Level 2
Milford Public Schools Curriculum Department: Mathematics Course Name: Algebra 1 Level 2 UNIT 1 Unit Title: Intro to Functions and Exponential Expressions Unit Description: Students explore the main functions
More informationRoth s theorem on 3-arithmetic progressions. CIMPA Research school Shillong 2013
Roth s theorem on 3-arithmetic progressions CIPA Research school Shillong 2013 Anne de Roton Institut Elie Cartan Université de Lorraine France 2 1. Introduction. In 1953, K. Roth [6] proved the following
More informationBoundary Behavior of Excess Demand Functions without the Strong Monotonicity Assumption
Boundary Behavior of Excess Demand Functions without the Strong Monotonicity Assumption Chiaki Hara April 5, 2004 Abstract We give a theorem on the existence of an equilibrium price vector for an excess
More informationModularity of Abelian Varieties
1 Modularity of Abelian Varieties This is page 1 Printer: Opaque this 1.1 Modularity Over Q Definition 1.1.1 (Modular Abelian Variety). Let A be an abelian variety over Q. Then A is modular if there exists
More informationApplied Lagrange Duality for Constrained Optimization
Applied Lagrange Duality for Constrained Optimization February 12, 2002 Overview The Practical Importance of Duality ffl Review of Convexity ffl A Separating Hyperplane Theorem ffl Definition of the Dual
More informationUnit-Consistent Decomposable Inequality Measures: Some Extensions
WORKING PAPER SERIES NOVEMBER 2005 WORKING PAPER No. 05-02 Unit-Consistent Decomposable Inequality Measures: Some Extensions by Buhong Zheng DEPARTMENT OF ECONOMICS UNIVERSITY OF COLORADO AT DENVER AND
More informationA characterization of the 2-additive Choquet integral
A characterization of the 2-additive Choquet integral Brice Mayag Thales R & T University of Paris I brice.mayag@thalesgroup.com Michel Grabisch University of Paris I Centre d Economie de la Sorbonne 106-112
More information