On Constrained Optimization by Interval Arithmetic and Interval Order Relations
Material type:
ArticlePublication details: Description: 9 (1) Jan -Mar 2012, 22-38pSubject(s):
In:
BV- Opsearch (Jan - Dec 2012)Summary: The goal of this article is to develop an optimization technique based on the splitting criterion of search region into several equal and disjoint subregions for solving the constrained optimization problems by finite interval arithmetic and interval order relations in the context of a decision maker’s point of view. This method has been applied for solving some benchmark test problems taken from the literature and the results are compared with those obtained from several existing different heuristic or meta-heuristic methods.
| Item type | Current library | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
Articles
|
Main Library | Available | AR16002 |
The goal of this article is to develop an optimization technique based on the splitting criterion of search region into several equal and disjoint subregions for solving the constrained optimization problems by finite interval arithmetic and interval order relations in the context of a decision maker’s point of view. This method has been applied for solving some benchmark test problems taken from the literature and the results are compared with those obtained from several existing different heuristic or meta-heuristic methods.
There are no comments on this title.