Maximizing a Class of Utility Functions Over the Vertices of a Polytope

DOI10.1287/opre.2016.1570zbMath1366.90173OpenAlexW2585536612MaRDI QIDQ5278276

Andrés Gómez, Atamtürk, Alper

Publication date: 13 July 2017

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/f5a719f8f55f3c773c5b6f605d2ce7b24c51ea64

zbMATH Keywords

reliabilitycombinatorial optimizationsubmodularityPERTrobust optimizationvalue-at-riskmultinomial logitassortmentconic quadratic optimization

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Quadratic programming (90C20) Combinatorial optimization (90C27)

Related Items (7)

Fractional 0-1 programming and submodularity ⋮ Tractable Approximations for Assortment Planning with Product Costs ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ Strong formulations for conic quadratic optimization with indicator variables ⋮ Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction ⋮ Submodular function minimization and polarity ⋮ Sequence independent lifting for a set of submodular maximization problems

This page was built for publication: Maximizing a Class of Utility Functions Over the Vertices of a Polytope