Effective Heuristic Methods for Finding Non-Optimal Solutions of Interest in Constrained Optimization Models

Loading...
Thumbnail Image
Penn collection
Operations, Information and Decisions Papers
Degree type
Discipline
Subject
Computational Engineering
Other Computer Sciences
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Kimbrough, Steven. O
Kuo, Ann
Lau, Hoong. C
Contributor
Abstract

This paper introduces the SoI problem, that of finding non-optimal 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.

Advisor
Date of presentation
2010-01-01
Conference name
Operations, Information and Decisions Papers
Conference dates
2023-05-17T15:06:35.000
Conference location
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Recommended citation
Collection