Ellipsoidal Methods for Adaptive Choice-Based Conjoint Analysis

DOI10.1287/opre.2018.1790zbMath1456.62018OpenAlexW3124036846WikidataQ128060622 ScholiaQ128060622MaRDI QIDQ5126603

Denis Sauré, Juan Pablo Vielma

Publication date: 20 October 2020

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

Full work available at URL: https://doi.org/10.1287/opre.2018.1790

zbMATH Keywords

mixed integer programmingBayesian modelsgeometric methodsconjoint analysis

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Mixed integer programming (90C11)

Related Items (2)

Preference Robust Modified Optimized Certainty Equivalent ⋮ Active Preference Elicitation by Bayesian Updating on Optimality Polyhedra

Uses Software

• CPLEX
• Stan
• BayesDA
• Julia
• JuMP
• GitHub
• Mamba
• Stan.jl

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Julia: A Fresh Approach to Numerical Computing
• Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
• Computing in Operations Research Using Julia
• Learning Preferences Under Noise and Loss Aversion: An Optimization Approach
• Approximate Dynamic Programming
• JuMP: A Modeling Language for Mathematical Optimization

This page was built for publication: Ellipsoidal Methods for Adaptive Choice-Based Conjoint Analysis