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):

Displaying 10 items.

• Closest reference point on the strong efficient frontier in data envelopment analysis (Q2132831) (← links)
• 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)
• Determining closest targets on the extended facet production possibility set in data envelopment analysis: modeling and computational aspects (Q2242348) (← links)
• A well-defined efficiency measure for dealing with closest targets in DEA (Q2453312) (← links)
• Target setting in data envelopment analysis: efficiency improvement models with predefined inputs/outputs (Q2656569) (← links)
• Finding target units in FDH model by least-distance measure model (Q2857725) (← links)
• Determining a sequence of targets in DEA (Q3372536) (← links)
• (Q4986869) (← links)
• Finding the closest efficient targets in DEA by a numeration method: the FDH non-convex technology (Q6154646) (← links)