Pages that link to "Item:Q2911575"

The following pages link to A LINEAR BILEVEL PROGRAMMING PROBLEM FOR OBTAINING THE CLOSEST TARGETS AND MINIMUM DISTANCE OF A UNIT FROM THE STRONG EFFICIENT FRONTIER (Q2911575):

Displayed 5 items.

• Finding closest target for bank branches in the presence of weight restrictions using data envelopment analysis (Q2240224) ‎ (← links)
• A modified distance friction minimization approach in data envelopment analysis (Q2240227) ‎ (← links)
• Target setting in data envelopment analysis: efficiency improvement models with predefined inputs/outputs (Q2656569) ‎ (← links)
• (Q4986869) ‎ (← links)
• Finding the closest efficient targets in DEA by a numeration method: the FDH non-convex technology (Q6154646) ‎ (← links)