Abstract
We consider combinatorial optimization problems with random jointly normal costs. Target-probability efficient solutions are those that grant a given target at a certain probability and no other solution can grant the same target at a higher probability. Since the costs belong to a location-scale family the efficient solutions have a simple geometric characterization in terms of mean and variance. Computing efficient solutions can be carried out by an iteration scheme calling for the solution of a constrained integer programming problem.
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.
