A method for the parametric center problem, with a strictly monotone polynomial-time algorithm for linear programming

A method for the parametric center problem, with a strictly monotone polynomial-time algorithm for linear programming

Also issued as: Working paper (Sloan School of Management) ; WP 2100-89.

Bibliographic Details
Other Authors:	Freund, Robert M.
Language:	eng
Published:	Massachusetts Institute of Technology, Operations Research Center 2004
Subjects:	Q175.M41 O616 no.192-89
Online Access:	http://hdl.handle.net/1721.1/5247

Similar Items

Progressive equilibration algorithms : the case of linear transaction costs
Published: (2004)

Mathematical programming models and methods for production planning and scheduling
Published: (2004)

Equilibration operators for the solution of constrained matrix problems
Published: (2004)

Punishment policies' effect on illicit drug users' purchasing habits
Published: (2004)

Jackson's rule for one-machine scheduling : making a good heuristic better
Published: (2004)

The theory of cyclic transfers
Published: (2004)

The application of variational inequality theory to the study of spatial equilibrium and disequilibrium
Published: (2004)

A faster strongly polynomial minimum cost flow algorithm
Published: (2004)

Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
Published: (2004)

An analog of Karmarkar's algorithm for inequality constrained linear programs, with a "new" class of projective transformations for centering a polytope
Published: (2004)

Stopping time equilibria in games with stochastically monotone payoffs
Published: (2004)

Condition measures and properties of the central trajectory of a linear program
Published: (2004)

A linearization and decomposition algorithm for computing urban traffic equilibria
Published: (2004)

Condition measures and properties of the central trajectory of a linear program
Published: (2003)

Projective transformations for interior point methods, Part I: Basic Theory and Linear Programming
Published: (2004)

Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm
Published: (2004)

A new algebraic geometry algorithm for integer programming
Published: (2004)

Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
Published: (2004)

Duality and sensitivity analysis for fractional programs
Published: (2004)

An algorithm for reliability analysis of planar graphs
Published: (2004)

Successive discretization procedures for stochastic programming with recourse
Published: (2004)

Implementing primal-dual network flow algorithms
Published: (2004)

A fast and simple algorithm for the maximum flow problem
Published: (2004)

An optimal parallel implementation of a quadratic transportation algorithm
Published: (2004)

New scaling algorithms for the assignment for minimum cycle mean problems
Published: (2004)

Decomposition methods for mathematical programming/economic equilibrium energy planning models
Published: (2004)

OPT2--an interactive computer program for conducting Bayesian hypothesis tests
Published: (2004)

Reference guide to the framework presented in "Implementing reusable solvers : an objected-oriented framework for operations research algorithms"
Published: (2004)

Finding fixed points by averaging with well-behaved maps
Published: (2004)

Networks as an aid in transportation and contingency planning
Published: (2004)

Improved time bounds for the maximum flow problem
Published: (2004)

Equilibria on a congested transportation network
Published: (2004)

Approximate analysis of unreliable transfer lines with rework or scrapping of parts
Published: (2004)

Polyhedral properties of the network restoration problem-with the convex hull of a special case
Published: (2004)

Solving variational inequality and fixed point problems by averaging and optimizing potentials
Published: (2004)

A nested decomposition method for vehicle routing and scheduling
Published: (2004)

Analysis of a contingent experimental design : a before-and-after experiment with a baseline period of random duration
Published: (2004)

Exact solution for the Bradford distribution and its use in modelling informational data
Published: (2004)

Tailoring Benders Decomposition for Uncapacitated Network Design
by: Wong, Richard T., et al.
Published: (2004)

An analytic approach to a general class of G/G/s queueing systems
Published: (2004)