On the Complexity of Nonoverlapping Multivariate Marginal Bounds for Probabilistic Combinatorial Optimization Problems

Authors:
Xuan Vinh Doan;Karthik Natarajan
Affiliations:
DIMAP and ORMS Group, Warwick Business School, University of Warwick, Coventry CV4 7AL, United Kingdom;Department of Management Sciences, College of Business, City University of Hong Kong, Hong Kong
Venue:
Operations Research
Year:
2012

Citing 14
Cited 0

Stochastic bounds on distributions of optimal value functions with applications to PERT, network flows and reliability

Operations Research
Copulae of probability measures on product spaces

Journal of Multivariate Analysis
Linkages: a tool for the construction of multivariate distributions with given nonoverlapping multivariate marginals

Journal of Multivariate Analysis
Scheduling under uncertainty: bounding the makespan distribution

Computational Discrete Mathematics
Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds

SIAM Journal on Optimization
Timing

Timing
Bounds for functions of multivariate risks

Journal of Multivariate Analysis
Persistence in discrete optimization under data uncertainty

Mathematical Programming: Series A and B
Persistency Model and Its Applications in Choice Modeling

Management Science
PERT as an aid to logic design

IBM Journal of Research and Development
Probabilistic PERT

IBM Journal of Research and Development
Statistical timing analysis using bounds and selective enumeration

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
First-Order Incremental Block-Based Statistical Timing Analysis

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Statistical Timing Analysis: From Basic Principles to State of the Art

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a combinatorial optimization problem with an arbitrary partition of the set of random objective coefficients, we evaluate the tightest-possible bound on the expected optimal value for joint distributions consistent with the given multivariate marginals of the subsets in the partition. For univariate marginals, this bound was first proposed by Meilijson and Nadas [Meilijson, I., A. Nadas. 1979. Convex majorization with an application to the length of critical path. J. Appl. Probab.16(3) 671--677]. We generalize the bound to nonoverlapping multivariate marginals using multiple-choice integer programming. New instances of polynomial-time computable bounds are identified for discrete distributions. For the problem of selecting up to M items out of a set of N items of maximum total weight, the multivariate marginal bound is shown to be computable in polynomial time, when the size of each subset in the partition is O(log N). For an activity-on-arc PERT network, the partition is naturally defined by subsets of incoming arcs into nodes. The multivariate marginal bound on expected project duration is shown to be computable in time polynomial in the maximum number of scenarios for any subset and the size of the network. As an application, a polynomial-time solvable two-stage stochastic program for project crashing is identified. An important feature of the bound developed in this paper is that it is exactly achievable by a joint distribution, unlike many of the existing bounds.