Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
From MaRDI portal
Publication:3109873
Recommendations
- A completely positive representation of \(0\)-\(1\) linear programs with joint probabilistic constraints
- A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming
- Maximin and maximal solutions for linear programming problems with possibilistic uncertainty
- An approach to linear programming under uncertainty
- Uncertain linear programs: extended affinely adjustable robust counterparts
- Linear Programming Under Uncertainty
- Uncertain convex programs: randomized solutions and confidence levels
- A compromise solution for the multiobjective stochastic linear programming under partial uncertainty
- Letter to the Editor—Remarks on “Linear Programming Under Uncertainty”
- A linearization method for mixed 0--1 polynomial programs
Cited in
(30)- Dynamic optimization with side information
- An approach to the distributionally robust shortest path problem
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- 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
- Building a completely positive factorization
- Completely positive matrices: real, rational, and integral
- Least squares approximation to the distribution of project completion times with Gaussian uncertainty
- Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- Exploiting partial correlations in distributionally robust optimization
- Mixed integer programming for the 0--1 maximum probability model.
- Robust quadratic programming with mixed-integer uncertainty
- Finding minimum volume circumscribing ellipsoids using generalized copositive programming
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- Distributionally Robust Chance Constrained Geometric Optimization
- Completely positive reformulations for polynomial optimization
- Strong formulations of robust mixed 0-1 programming
- A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming
- On reduced semidefinite programs for second order moment bounds with applications
- The Discrete Moment Problem with Nonconvex Shape Constraints
- Copositive programming
- A completely positive representation of \(0\)-\(1\) linear programs with joint probabilistic constraints
- Distributionally robust mixed integer linear programs: persistency models with applications
- Stochastic knapsack revisited: the service level perspective
- Process flexibility: a distribution-free bound on the performance of \(k\)-chain
- Frameworks and results in distributionally robust optimization
- Exploiting symmetry in copositive programs via semidefinite hierarchies
This page was built for publication: Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3109873)
