On the tightness of an LP relaxation for rational optimization and its applications

DOI10.1016/j.orl.2016.07.001zbMath1408.90285OpenAlexW2464896063MaRDI QIDQ1755822

Vashist Avadhanula, Jalaj Bhandari, Vineet Goyal, Assaf J. Zeevi

Publication date: 11 January 2019

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

Full work available at URL: https://doi.org/10.1016/j.orl.2016.07.001

zbMATH Keywords

linear programmingassortment optimizationPTAS

Mathematics Subject Classification ID

Integer programming (90C10) Fractional programming (90C32) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (3)

Fractional 0-1 programming: applications and algorithms ⋮ Constrained multi‐location assortment optimization under the multinomial logit model ⋮ MNL-Bandit: A Dynamic Learning Approach to Assortment Selection

Cites Work

• An FPTAS for optimizing a class of low-rank functions over a polytope
• Approximating a class of combinatorial problems with rational objective function
• Combinatorial Optimization with Rational Objective Functions
• Approximation algorithms for combinatorial fractional programming problems

This page was built for publication: On the tightness of an LP relaxation for rational optimization and its applications