Abstract
In this paper, we study joint probabilistic constrained linear programs with dependent rows. We take the special case where the dependence between the rows is driven by Gumbel–Hougaard copula. We first transform the problem into a deterministic biconvex optimization problem. Then, we solve the obtained problem using a dynamical neural network based on the partial KKT system. We show the stability and the convergence of the proposed neural network. The main feature of our approach is to solve the joint probabilistic constraints problem without the use of any convex approximations. We finally use a problem of profit maximization to evaluate the performances of our approach.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
