Smoothed Analysis of Condition Numbers and Complexity Implications for Linear Programming

Mathematical Programming, Series B - Germany
doi 10.1007/s10107-009-0278-5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Smoothed Analysis of Condition Numbers

English

Unifying Condition Numbers for Linear Programming

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2003English

Incorporating Condition Measures Into the Complexity Theory of Linear Programming

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
1995English

The Complexity of Egalitarian Mechanisms for Linear Programming Games

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2014English

Bilevel Programming for Analysis of Low-Complexity Control of Linear Systems With Constraints

2009English

On the Worst Case Complexity of Potential Reduction Algorithms for Linear Programming

Mathematical Programming, Series B
MathematicsSoftware
1997English

Improving the Smoothed Complexity of FLIP for Max Cut Problems

2019English

The Generalized Condition Numbers of Bounded Linear Operators in Banach Spaces

Journal of the Australian Mathematical Society
Mathematics
2004English

A Straightforward Approach for Solving Fully Fuzzy Linear Programming Problem With Lr-Type Fuzzy Numbers

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy