Conference Proceeding Article
This paper introduces the SoI problem, that of finding nonoptimal solutions of interest for constrained optimization models. SoI problems subsume finding FoIs (feasible solutions of interest), and IoIs (infeasible solutions of interest). In all cases, the interest addressed is post-solution analysis in one form or another. Post-solution analysis of a constrained optimization model occurs after the model has been solved and a good or optimal solution for it has been found. At this point, sensitivity analysis and other questions of import for decision making (discussed in the paper) come into play and for this purpose the SoIs can be of considerable value. The paper presents examples that demonstrate this and reports on a systematic approach, using evolutionary computation, for obtaining both FoIs and IoIs.
sensitivity analysis, deliberation support, constrained optimization, post-solution analysis, candle-lighting analysis
Artificial Intelligence and Robotics | Numerical Analysis and Scientific Computing | Operations Research, Systems Engineering and Industrial Engineering
Intelligent Systems and Decision Analytics
GECCO '10: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation: Portland, Oregon, July 07-11, 2010
City or Country
KIMBROUGH, Steven O.; KUO, Ann; and LAU, Hoong Chuin.
Effective heuristic methods for finding non-optimal solutions of interest in constrained optimization models. (2010). GECCO '10: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation: Portland, Oregon, July 07-11, 2010. 295-296. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/355
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.