The following pages link to G. Tohidi (Q345773):
Displayed 33 items.
- A circular global profit Malmquist productivity index in data envelopment analysis (Q345775) (← links)
- A method for finding efficient DMUs in DEA using 0-1 linear programming (Q702575) (← links)
- The outputs estimation of a DMU according to improvement of its efficiency. (Q1412613) (← links)
- A method for detecting influential observation in radial DEA models. (Q1412614) (← links)
- Ranking using \(l_{1}\)-norm in data envelopment analysis (Q1826696) (← links)
- Input estimation and identification of extra inputs in inverse DEA models (Q1888560) (← links)
- A new stochastic model for classifying flexible measures in data envelopment analysis (Q2059167) (← links)
- Profit Malmquist index and its global form in the presence of the negative data in DEA (Q2336287) (← links)
- A method for generating all efficient solutions of 0-1 multi-objective linear programming problem (Q2571939) (← links)
- A one-model approach to classification and sensitivity analysis in DEA (Q2571940) (← links)
- Sensitivity and stability analysis in DEA (Q2571941) (← links)
- Sensitivity of efficiency classifications in the inverse DEA models (Q2571942) (← links)
- Undesirable inputs and outputs in DEA models (Q2571943) (← links)
- Solving a tri-criteria best path problem using the fuzzy decision making (Q2988626) (← links)
- Ranking of extreme and non-extreme efficient DMUs (Q3505838) (← links)
- (Q3518895) (← links)
- (Q3518897) (← links)
- (Q3518899) (← links)
- (Q3535085) (← links)
- (Q3551857) (← links)
- (Q3551859) (← links)
- (Q3629179) (← links)
- A METHOD FOR SOLVING 0-1 MULTIPLE OBJECTIVE LINEAR PROGRAMMING PROBLEM USING DEA (Q4446322) (← links)
- (Q4618370) (← links)
- A METHOD FOR GENERATING ALL THE EFFICIENT SOLUTIONS OF A 0-1 MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEM (Q4650622) (← links)
- Sensitivity and stability analysis in data envelopment analysis (Q4680756) (← links)
- Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming (Q4963127) (← links)
- (Q5013182) (← links)
- (Q5079001) (← links)
- Two methods for determining properly effcient solutions with a minimum upper bound for trade-offs (Q5080781) (← links)
- (Q5422853) (← links)
- The identification of nondominated and efficient paths on a network (Q5921672) (← links)
- The identification of nondominated and efficient paths on a network (Q5971518) (← links)