Quadratic Pareto Race

This paper presents a dynamic and visual “free-search” type of a decision support system - Quadratic Pareto Race, which enables a DM freely search any part of the nondominated frontier of a multiple objective quadratic-linear programming problem by controlling the speed and direction of motion. The values of the objective functions are presented in a numeric form and as bar graphs on a display. The implementation of Quadratic Pareto Race is based on the theoretical foundations developed by Korhonen and Yu 9. The system is implemented on a microcomputer and illustrated using a numerical example.