Open Access. Powered by Scholars. Published by Universities.®

Computational Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

University of Pennsylvania

Articles 1 - 1 of 1

Full-Text Articles in Computational Engineering

Effective Heuristic Methods For Finding Non-Optimal Solutions Of Interest In Constrained Optimization Models, Steven. O. Kimbrough, Ann Kuo, Hoong. C. Lau Jan 2010

Effective Heuristic Methods For Finding Non-Optimal Solutions Of Interest In Constrained Optimization Models, Steven. O. Kimbrough, Ann Kuo, Hoong. C. Lau

Operations, Information and Decisions Papers

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 ...