1984
DOI: 10.1007/bf01068340
|View full text |Cite
|
Sign up to set email alerts
|

Stability, parametric, and postoptimality analysis of discrete optimization problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

1992
1992
2017
2017

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 28 publications
(6 citation statements)
references
References 18 publications
0
6
0
Order By: Relevance
“…We refer the reader to [5,13] where the authors state the conditions under which primal feasibility, dual feasibility, and optimality still hold for * and * (optimal primal vector and subadditive dual function) after changes made to the input of (MILP).…”
Section: Definition 15mentioning
confidence: 99%
“…We refer the reader to [5,13] where the authors state the conditions under which primal feasibility, dual feasibility, and optimality still hold for * and * (optimal primal vector and subadditive dual function) after changes made to the input of (MILP).…”
Section: Definition 15mentioning
confidence: 99%
“…There are many definitions of sensitivity analysis and stability analysis in the literature and both are used to evaluate the effects of variations on the optimal solution or basis of the LP problem. 17,18 2.1. Sensitivity Analysis.…”
Section: Postoptimality Analysismentioning
confidence: 99%
“…However, the operator faces the difficulty of choosing and tuning these weighting parameters. It is therefore interesting to characterize the robustness of an optimal tour with respect to the weights, because in discrete optimization problems small changes in the problem data may lead to significant changes in the solution [4].…”
Section: Introductionmentioning
confidence: 99%