Title
Global probability maximization for a Gaussian bilateral inequality in polynomial time.
Abstract
The present paper investigates Gaussian bilateral inequalities in view of solving related probability maximization problems. Since the function f representing the probability of satisfaction of a given Gaussian bilateral inequality is not concave everywhere, we first state and prove a necessary and sufficient condition for negative semi-definiteness of the Hessian. Then, the (nonconvex) problem of globally maximizing f over a given polyhedron in $$\\mathbb {R}^{n}$$Rn is adressed, and shown to be polynomial-time solvable, thus yielding a new-comer to the (short) list of nonconvex global optimization problems which can be solved exactly in polynomial time. Application to computing upper bounds to the maximum joint probability of satisfaction of a set of m independent Gaussian bilateral inequalities is discussed and computational results are reported.
Year
DOI
Venue
2017
10.1007/s10898-017-0501-5
J. Global Optimization
Keywords
Field
DocType
Random gaussian inequalities,Bilateral chance constraints,Global optimization,Joint probability maximization,Polynomial-time algorithm
Combinatorics,Mathematical optimization,Probability maximization,Joint probability distribution,Global optimization,Polyhedron,Hessian matrix,Inequality,Gaussian,Time complexity,Mathematics
Journal
Volume
Issue
ISSN
68
4
0925-5001
Citations 
PageRank 
References 
1
0.36
10
Authors
2
Name
Order
Citations
PageRank
Michel Minoux1741100.18
Riadh Zorgati2204.08