Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
From MaRDI portal
Publication:3109873
DOI10.1287/opre.1110.0918zbMath1231.90304OpenAlexW2095471868WikidataQ92867506 ScholiaQ92867506MaRDI QIDQ3109873
Chung-Piaw Teo, Karthik Natarajan, Zhichao Zheng
Publication date: 26 January 2012
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://ink.library.smu.edu.sg/lkcsb_research/4606
Related Items
Distributionally robust mixed integer linear programs: persistency models with applications, Process Flexibility: A Distribution-Free Bound on the Performance of k-Chain, Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming, Frameworks and results in distributionally robust optimization, Stochastic Knapsack Revisited: The Service Level Perspective, Dynamic optimization with side information, An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix, An approach to the distributionally robust shortest path problem, Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty, Optimization under uncertainty and risk: quadratic and copositive approaches, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, Disruption Risk Mitigation in Supply Chains: The Risk Exposure Index Revisited, Exploiting partial correlations in distributionally robust optimization, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, On reduced semidefinite programs for second order moment bounds with applications, Completely positive matrices: real, rational, and integral, Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality, Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations, Building a completely positive factorization, A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming, Copositive Programming, Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls, Robust Quadratic Programming with Mixed-Integer Uncertainty, The Discrete Moment Problem with Nonconvex Shape Constraints, Completely positive reformulations for polynomial optimization, Exploiting symmetry in copositive programs via semidefinite hierarchies, Distributionally Robust Chance Constrained Geometric Optimization
Uses Software
