๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Directed Perturbation Analysis of an Integer Program

โœ Scribed by Hsiao-Fan Wang; Jyh-Shing Horng

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
140 KB
Volume
201
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

โœฆ Synopsis

In this paper, we examine the largest tolerance levels in integer programming ลฝ . IP problems when the perturbation occurs on the right hand sides of the constraints in positive or negative directions. Based on the properties of defined stepsizes, we have not only revealed the nested and the inverted nested structures of a parametric IP with a developed algorithm, but also analyzed the configuration of a non-parametric IP with a comparative study. The complexity analysis is incorporated with numerical examples.

๐Ÿ“œ SIMILAR VOLUMES

Asymptotic Analysis of Perturbed Mathema
Asymptotic Analysis of Perturbed Mathematical Programs
โœ Jean-Michel Coulomb; Jerzy A Filar; Witold Szczechla ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 163 KB

We consider a perturbed mathematical programming problem where both the objective and the constraint functions are analytical in both the underlying decision variables and in the perturbation variable/parameter that is denoted by . The following question arises: what is the description of the soluti

An analysis of six greedy selection rule
An analysis of six greedy selection rules on a class of zero-one integer programming models
โœ G. Edward Fox; Christopher J. Nachtsheim ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 509 KB

Six greedy primal selection rules are evaluated on a class of generalized set packing models. The evaluation is conducted in accordance with experimental design methodologies proposed by Lin and Rardin. Results indicate that the simplest of rules performs best, except when the model constraints exhi