Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
From MaRDI portal
Publication:3109873
DOI10.1287/OPRE.1110.0918zbMATH Open1231.90304DBLPjournals/ior/NatarajanTZ11OpenAlexW2095471868WikidataQ92867506 ScholiaQ92867506MaRDI QIDQ3109873FDOQ3109873
Authors: Karthik Natarajan, Chung-Piaw Teo, 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
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)
- Completely positive matrices: real, rational, and integral
- Distributionally Robust Chance Constrained Geometric Optimization
- Exploiting partial correlations in distributionally robust optimization
- Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming
- Least squares approximation to the distribution of project completion times with Gaussian uncertainty
- Strong formulations of robust mixed 0-1 programming
- Mixed integer programming for the 0--1 maximum probability model.
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- Distributionally robust mixed integer linear programs: persistency models with applications
- Exploiting symmetry in copositive programs via semidefinite hierarchies
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
- Disruption Risk Mitigation in Supply Chains: The Risk Exposure Index Revisited
- An approach to the distributionally robust shortest path problem
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- The Discrete Moment Problem with Nonconvex Shape Constraints
- Building a completely positive factorization
- A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming
- Dynamic optimization with side information
- Completely positive reformulations for polynomial optimization
- Robust Quadratic Programming with Mixed-Integer Uncertainty
- Copositive programming
- Optimization under uncertainty and risk: quadratic and copositive approaches
- Process flexibility: a distribution-free bound on the performance of \(k\)-chain
- On reduced semidefinite programs for second order moment bounds with applications
- Frameworks and results in distributionally robust optimization
- Stochastic Knapsack Revisited: The Service Level Perspective
- A completely positive representation of \(0\)-\(1\) linear programs with joint probabilistic constraints
Uses Software
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)
