On the convexity of probabilitistically constrained linear programs

    Research output: Contribution to journalArticle

    8 Citations (Scopus)

    Abstract

    The focal point of this paper is the so-called Probabilistically Constrained Linear Program (PCLP), also known as Chance Constrained Linear Program. We prove that PCLP is a convex program when the uncertain parameters are uniformly distributed over a convex symmetric set Q. By symmetric we mean that if q qq Q then -q qq Q. Furthermore, we provide a deterministic equivalent of the PCLP which, in some cases, leads to an implementation that does not require the use of Stochastic Programming; only commonly available optimization tools are required. Finally, the concept of Probabilistically Robust Linear Program (PRLP) is introduced. The PRLP is a generalization of the PCLP for the case when the distribution of the uncertain coefficients is not known. The only assumption is that their distribution belongs to a known class F. Since the true distribution of the uncertain parameters is not available, in the PRLP it is required that the probability of satisfaction of the constraints is greater than a given risk level ε for all possible distributions f qq F. It is proven that the PRLP is also a convex program for the class F first introduced in [3].

    Original languageEnglish (US)
    Pages (from-to)516-521
    Number of pages6
    JournalProceedings of the IEEE Conference on Decision and Control
    Volume1
    StatePublished - 1999

    Fingerprint

    Stochastic programming
    Linear Program
    Convexity
    Convex Program
    Uncertain Parameters
    Stochastic Programming

    All Science Journal Classification (ASJC) codes

    • Chemical Health and Safety
    • Control and Systems Engineering
    • Safety, Risk, Reliability and Quality

    Cite this

    @article{5ddc8d12a31544a789d60817778cdc89,
    title = "On the convexity of probabilitistically constrained linear programs",
    abstract = "The focal point of this paper is the so-called Probabilistically Constrained Linear Program (PCLP), also known as Chance Constrained Linear Program. We prove that PCLP is a convex program when the uncertain parameters are uniformly distributed over a convex symmetric set Q. By symmetric we mean that if q qq Q then -q qq Q. Furthermore, we provide a deterministic equivalent of the PCLP which, in some cases, leads to an implementation that does not require the use of Stochastic Programming; only commonly available optimization tools are required. Finally, the concept of Probabilistically Robust Linear Program (PRLP) is introduced. The PRLP is a generalization of the PCLP for the case when the distribution of the uncertain coefficients is not known. The only assumption is that their distribution belongs to a known class F. Since the true distribution of the uncertain parameters is not available, in the PRLP it is required that the probability of satisfaction of the constraints is greater than a given risk level ε for all possible distributions f qq F. It is proven that the PRLP is also a convex program for the class F first introduced in [3].",
    author = "Lagoa, {Constantino Manuel}",
    year = "1999",
    language = "English (US)",
    volume = "1",
    pages = "516--521",
    journal = "Proceedings of the IEEE Conference on Decision and Control",
    issn = "0191-2216",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",

    }

    TY - JOUR

    T1 - On the convexity of probabilitistically constrained linear programs

    AU - Lagoa, Constantino Manuel

    PY - 1999

    Y1 - 1999

    N2 - The focal point of this paper is the so-called Probabilistically Constrained Linear Program (PCLP), also known as Chance Constrained Linear Program. We prove that PCLP is a convex program when the uncertain parameters are uniformly distributed over a convex symmetric set Q. By symmetric we mean that if q qq Q then -q qq Q. Furthermore, we provide a deterministic equivalent of the PCLP which, in some cases, leads to an implementation that does not require the use of Stochastic Programming; only commonly available optimization tools are required. Finally, the concept of Probabilistically Robust Linear Program (PRLP) is introduced. The PRLP is a generalization of the PCLP for the case when the distribution of the uncertain coefficients is not known. The only assumption is that their distribution belongs to a known class F. Since the true distribution of the uncertain parameters is not available, in the PRLP it is required that the probability of satisfaction of the constraints is greater than a given risk level ε for all possible distributions f qq F. It is proven that the PRLP is also a convex program for the class F first introduced in [3].

    AB - The focal point of this paper is the so-called Probabilistically Constrained Linear Program (PCLP), also known as Chance Constrained Linear Program. We prove that PCLP is a convex program when the uncertain parameters are uniformly distributed over a convex symmetric set Q. By symmetric we mean that if q qq Q then -q qq Q. Furthermore, we provide a deterministic equivalent of the PCLP which, in some cases, leads to an implementation that does not require the use of Stochastic Programming; only commonly available optimization tools are required. Finally, the concept of Probabilistically Robust Linear Program (PRLP) is introduced. The PRLP is a generalization of the PCLP for the case when the distribution of the uncertain coefficients is not known. The only assumption is that their distribution belongs to a known class F. Since the true distribution of the uncertain parameters is not available, in the PRLP it is required that the probability of satisfaction of the constraints is greater than a given risk level ε for all possible distributions f qq F. It is proven that the PRLP is also a convex program for the class F first introduced in [3].

    UR - http://www.scopus.com/inward/record.url?scp=0032620420&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0032620420&partnerID=8YFLogxK

    M3 - Article

    VL - 1

    SP - 516

    EP - 521

    JO - Proceedings of the IEEE Conference on Decision and Control

    JF - Proceedings of the IEEE Conference on Decision and Control

    SN - 0191-2216

    ER -