Decision Making and Productivity Measurement

Decision Making and Productivity Measurement

Decision Making and Productivity Measurement
by Dariush Khezrimotlagh

Publisher: arXiv 2016
Number of pages: 214

I wrote this book as a self-teaching tool to assist every teacher, student, mathematician or non-mathematician for educating herself or others, and to support their understanding of the elementary concepts on assessing the performance of a set of homogenous firms, as well as how to correctly adapt mathematics to these concepts step by step, in order to underpin this area and rebuild the foundation and columns of efficiency measurement for further research.

Home page url

Download or read it online here:
Download link
(4.6MB, PDF)

Similar books

Optimization Algorithms on Matrix ManifoldsOptimization Algorithms on Matrix Manifolds
by P.-A. Absil, R. Mahony, R. Sepulchre - Princeton University Press
Many science and engineering problems can be rephrased as optimization problems on matrix search spaces endowed with a manifold structure. This book shows how to exploit the structure of such problems to develop efficient numerical algorithms.
Optimal Stopping and ApplicationsOptimal Stopping and Applications
by Thomas S. Ferguson - UCLA
From the table of contents: Stopping Rule Problems; Finite Horizon Problems; The Existence of Optimal Rules; Applications. Markov Models; Monotone Stopping Rule Problems; Maximizing the Rate of Return; Bandit Problems; Solutions to the Exercises.
Linear Complementarity, Linear and Nonlinear ProgrammingLinear Complementarity, Linear and Nonlinear Programming
by Katta G. Murty
This book provides an in-depth and clear treatment of all the important practical, technical, computational, geometric, and mathematical aspects of the Linear Complementarity Problem, Quadratic Programming, and their various applications.
Iterative Methods for OptimizationIterative Methods for Optimization
by C.T. Kelley - Society for Industrial Mathematics
This book presents a carefully selected group of methods for unconstrained and bound constrained optimization problems and analyzes them in depth both theoretically and algorithmically. It focuses on clarity in algorithmic description and analysis.