Dealing with User's Preferences in Mixed-Initiative Systems for Linear Optimization

Mixed-Initiative Systems (MIS) are hybrid decision systems where collaboration is possible between humans and machines. However, current systems sometimes override user preferences when provided with new ones. We studied linear optimization problems, where the decision maker is specifying preferences for variable values through an iterative process. We proposed a goal programming framework to deal with hierarchies of preferences. Two reoptimization algorithms were evaluated: sequential simplex and lexicographic simplex. Compared with the sequential simplex, the lexicographic simplex algorithm demonstrated greater speed and numerical stability.

• Publication year

  2017

• Venue

  IEEE International Conference on Tools with Artificial Intelligence

• Publication date

  2017-11-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/ICTAI.2017.00114
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Designing a generic human-machine framework for real-time supply chain planning

  2017cited by this paper
• A Review and Taxonomy of Interactive Optimization Methods in Operations Research

  2015influential reference
• A Mixed-Initiative Approach to the Conciliation of Clinical Guidelines for Comorbid Patients

  2015cited by this paper
• An Experimental Investigation of Reoptimization for Shift Scheduling

  2015cited by this paper
• Proceedings of the SIGCHI Conference on Human Factors in Computing Systems

  2014cited by this paper
• Linear Programming Computation

  2014cited by this paper
• Human-machine interaction for real-time linear optimization

  2012cited by this paper
• Practical Goal Programming

  2010cited by this paper
• Mixed-Initiative Planning in Space Mission Operations

  2007cited by this paper
• The dual simplex method, techniques for a fast and stable implementation

  2005cited by this paper
• Multiple criteria decision analysis: state of the art surveys

  2005cited by this paper
• MAPGEN: Mixed-Initiative Planning and Scheduling for the Mars Exploration Rover Mission

  2004cited by this paper
• Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time

  2001cited by this paper
• Mixed-initiative interaction

  1999cited by this paper
• Planning in Complex Worlds via Mixed-Initiative Interaction

  1997cited by this paper
• TRAINS-95: Towards a Mixed-Initiative Planning Assistant

  1996cited by this paper
• User Perceptions of Decision Support Effectiveness: Two Production Planning Experiments *

  1994cited by this paper
• Origins of the simplex method

  1990cited by this paper
• Linear Programming in Single- and Multiple-Objective Systems

  1984cited by this paper
• Linear programming in single- & multiple-objective systems, edited by James P. Ignizio, Prentice-Hall International Series in Industrial and Systems Engineering, Prentice-Hall, Inc., Englewood Cliffs, N.J. 07632, 1982. No. of pages: 506. Price: £22.45. ISBN 0-13-537027-2

  1982cited by this paper
• Linear lexicographic optimization

  1982cited by this paper
• Sequential linear goal programming: Implementation via MPSX

  1979influential reference
• A numerically stable form of the simplex algorithm

  1973cited by this paper
• A numerical investigation of the simplex method

  1968cited by this paper
• Linear programming and extensions

  1965cited by this paper

• Towards interactive coordination of heterogeneous robotic teams – Introduction of a reoptimization framework

  2021cites this paper