Pages that link to "Item:Q925836"
From MaRDI portal
The following pages link to A linear programming method for generating the most favorable weights from a pairwise comparison matrix (Q925836):
Displaying 13 items.
- Generalized analytic network process (Q319337) (← links)
- Bi-criteria evolution strategy in estimating weights from the AHP ratio-scale matrices (Q648315) (← links)
- A new proposed model of restricted data envelopment analysis by correlation coefficients (Q727358) (← links)
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation (Q835616) (← links)
- Ranking all DEA-efficient DMUs based on cross efficiency and analytic hierarchy process methods (Q1659089) (← links)
- Enumerating all spanning trees for pairwise comparisons (Q1761963) (← links)
- Linear programming models for estimating weights in the analytic hierarchy process (Q1772859) (← links)
- Linear programming based decomposition approach in evaluating priorities from pairwise comparisons and error analysis (Q1893465) (← links)
- Coherent weights for pairwise comparison matrices and a mixed-integer linear programming problem (Q2274877) (← links)
- On lexicographic goal programming method for generating weights from inconsistent interval comparison matrices (Q2489454) (← links)
- A Goal Programming Method for Generating Priority Vectors (Q4840366) (← links)
- Deriving consistent pairwise comparison matrices in decision making methodologies based on linear programming method (Q5172322) (← links)
- A new AHP‐prioritization method based on linear programming for crisp and interval preference relations (Q6060685) (← links)
