Skip to main content
SpringerLink
Log in

A new condition number for linear programming

  • Published:
Mathematical Programming Submit manuscript

Abstract.

In this paper we define a new condition number ?(A) for the following problem: given a m by n matrix A, find x∈ℝn, s.t. Ax<0. We characterize this condition number in terms of distance to ill-posedness and we compare it with existing condition numbers for the same problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong, e-mail: {50000548@plink,macucker@math}.cityu.edu.hk, , , , , , HK

    Dennis Cheung & Felipe Cucker

Authors
  1. Dennis Cheung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Felipe Cucker
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: November 5, 1999 / Accepted: November 2000¶Published online September 17, 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cheung, D., Cucker, F. A new condition number for linear programming. Math. Program. 91, 163–174 (2001). https://doi.org/10.1007/s101070100237

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s101070100237

Search

Navigation