Convexity and Optimization in Finite Dimensions I

TL;DR: There are many useful operations, such as adding slack variables, taking scalar multiples of inequalities, and applying Fourier-Motzkin elimination, that can be performed on a linear system such that if the system defines an integer polyhedron then so does the derived system as mentioned in this paper.

TL;DR: An axiomatic characterisation of time-preference with various forms of discounting, including weakly present-biased, quasi-hyperbolic, and exponential, is developed and testable restrictions for each specification are determined.

TL;DR: The problem of finding several users with the same optimization goal is addressed by the problem of establishing a conference call between mobile users and it is proved that a natural heuristic is an e/(e - 1 )-approximation solution.