Details about Michael Todd
Access statistics for papers by Michael Todd.
Last updated 20191023. Update your information in the RePEc Author Service.
Shortid: pto35
Jump to Journal Articles
Working Papers
2004
 Two New Proofs of Afriat's Theorem
Econometric Society 2004 North American Summer Meetings, Econometric Society View citations (46)
Also in Yale School of Management Working Papers, Yale School of Management (2004) View citations (64) Cowles Foundation Discussion Papers, Cowles Foundation for Research in Economics, Yale University (2003) View citations (4)
See also Journal Article in Economic Theory (2004)
1996
 PrimalDual Methods and Infeasibility Detectors for Nonlinear Programming Problems
CORE Discussion Papers, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (3)
1995
 PrimalDual InteriorPoint Methods for SelfScaled Cones
CORE Discussion Papers, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (16)
1994
 SelfScaled Cones and InteriorPoint Methods in Nonlinear Programming
CORE Discussion Papers, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) View citations (10)
1992
 Barrier functions and interiorpoint algorithms for linear programming with zero, one, or twosided bounds on the variables
Working papers, Massachusetts Institute of Technology (MIT), Sloan School of Management View citations (1)
See also Journal Article in Mathematics of Operations Research (1995)
1988
 A Centered Projective Algorithm for Linear Programming
Cowles Foundation Discussion Papers, Cowles Foundation for Research in Economics, Yale University View citations (2)
See also Journal Article in Mathematics of Operations Research (1990)
1985
 Identifying the set of alwaysactive constraints in a system of linear inequalities by a single linear program
Working papers, Massachusetts Institute of Technology (MIT), Sloan School of Management View citations (5)
1978
 Efficient acceleration techniques for fixed point algorithms
CORE Discussion Papers RP, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
Also in Discussion Papers, Northwestern University, Center for Mathematical Studies in Economics and Management Science (1976) View citations (1)
 On the Jacobian of a function at a zero computed by a fixed point algorithm
CORE Discussion Papers RP, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
See also Journal Article in Mathematics of Operations Research (1978)
 Solving the generalized market area problem
CORE Discussion Papers RP, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
Journal Articles
2016
 Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers
Mathematics of Operations Research, 2016, 41, (3), 11251134 View citations (2)
2010
 Weighted Distance Weighted Discrimination and Its Asymptotic Properties
Journal of the American Statistical Association, 2010, 105, (489), 401414 View citations (7)
2007
 DistanceWeighted Discrimination
Journal of the American Statistical Association, 2007, 102, 12671271 View citations (9)
2004
 Two new proofs of Afriat’s theorem
Economic Theory, 2004, 24, (1), 211219 View citations (45)
See also Working Paper (2004)
1998
 Erratum: Probabilistic Models for Linear Programming
Mathematics of Operations Research, 1998, 23, (3), 767768
1997
 SelfScaled Barriers and InteriorPoint Methods for Convex Programming
Mathematics of Operations Research, 1997, 22, (1), 142 View citations (34)
1996
 Asymptotic Behavior of InteriorPoint Methods: A View From SemiInfinite Programming
Mathematics of Operations Research, 1996, 21, (2), 354381 View citations (3)
1995
 A Surface of Analytic Centers and PrimalDual InfeasibleInteriorPoint Algorithms for Linear Programming
Mathematics of Operations Research, 1995, 20, (1), 135162 View citations (2)
 Barrier Functions and InteriorPoint Algorithms for Linear Programming with Zero, One, or TwoSided Bounds on the Variables
Mathematics of Operations Research, 1995, 20, (2), 415440
See also Working Paper (1992)
1994
 An O(√nL)Iteration Homogeneous and SelfDual Linear Programming Algorithm
Mathematics of Operations Research, 1994, 19, (1), 5367 View citations (14)
 Commentary—Theory and Practice for InteriorPoint Methods
INFORMS Journal on Computing, 1994, 6, (1), 2831
1993
 On AdaptiveStep PrimalDual InteriorPoint Algorithms for Linear Programming
Mathematics of Operations Research, 1993, 18, (4), 964981 View citations (18)
1991
 Probabilistic Models for Linear Programming
Mathematics of Operations Research, 1991, 16, (4), 671693
1990
 A Centered Projective Algorithm for Linear Programming
Mathematics of Operations Research, 1990, 15, (3), 508529 View citations (4)
See also Working Paper (1988)
 A DantzigWolfeLike Variant of Karmarkar's InteriorPoint Linear Programming Algorithm
Operations Research, 1990, 38, (6), 10061018 View citations (6)
 Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
Mathematics of Operations Research, 1990, 15, (4), 736748 View citations (11)
1988
 Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
Mathematics of Operations Research, 1988, 13, (4), 650659 View citations (2)
1985
 The Ellipsoid Method Generates Dual Variables
Mathematics of Operations Research, 1985, 10, (4), 688700 View citations (1)
1982
 On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid
Mathematics of Operations Research, 1982, 7, (2), 253261
1981
 Approximate Labelling for Simplicial Algorithms and Two Classes of Special Subsets of the Sphere
Mathematics of Operations Research, 1981, 6, (4), 579592
 Feature Article—The Ellipsoid Method: A Survey
Operations Research, 1981, 29, (6), 10391091 View citations (5)
1980
 A Note on Optimally Dissecting Simplices
Mathematics of Operations Research, 1980, 5, (1), 6366
 Determining Optimal Use of Resources among Regional Producers under Differing Levels of Cooperation
Operations Research, 1980, 28, (4), 859866 View citations (1)
 The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4
Mathematics of Operations Research, 1980, 5, (4), 599601
 Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following PiecewiseLinear Paths
Mathematics of Operations Research, 1980, 5, (2), 242257
1979
 A note on computing equilibria in economies with activity analysis models of production
Journal of Mathematical Economics, 1979, 6, (2), 135144 View citations (3)
1978
 NoteSolving the Generalized Market Area Problem
Management Science, 1978, 24, (14), 15491554
 On the Jacobian of a Function at a Zero Computed by a Fixed Point Algorithm
Mathematics of Operations Research, 1978, 3, (2), 126132
See also Working Paper (1978)
1976
 Orientation in Complementary Pivot Algorithms
Mathematics of Operations Research, 1976, 1, (1), 5466 View citations (2)

The links between different versions of a paper are constructed automatically by matching on the titles.
Please contact if a link is incorrect.
Use this form
to add links between versions where the titles do not match.
