On some Aspects of the Matrix Data Perturbation in Linear Program
Margita Kon-Popovska (2003)
The Yugoslav Journal of Operations Research
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The free parametrization for linear programming with bounded variables”
On some Aspects of the Matrix Data Perturbation in Linear Program
Programming with parametric elements of the matrix coefficients
Ramon M. Arana (1977)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A remark on sensitivity in linear programming and Gale-Samuelson nonsubstitution theorem
Maria De Giuli, Giorgio Giorgi (2010)
Control and Cybernetics
Similarity:
Direct calculation of sensitivity to the coefficients of the basic submatrix in parametric linear programming
Claude Dechamps, Paul Jadot (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
On the stability of solutions of linear differential systems with slowly varying coefficients
Charles S. Kahane (1992)
Czechoslovak Mathematical Journal
Similarity:
Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation
M. Minoux (1986)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Linear programming with positive semi-definite matrices.
Lasserre, J.B. (1996)
Mathematical Problems in Engineering
Similarity:
Consistency-driven approximation of a pairwise comparison matrix
Esther Dopazo, Jacinto González-Pachón (2003)
Kybernetika
Similarity:
The pairwise comparison method is an interesting technique for building a global ranking from binary comparisons. In fact, some web search engines use this method to quantify the importance of a set of web sites. The purpose of this paper is to search a set of priority weights from the preference information contained in a general pairwise comparison matrix; i.e., a matrix without consistency and reciprocity properties. For this purpose, we consider an approximation methodology within...