The strict complementarity in linear fractional optimization
From MaRDI portal
Recommendations
- Duality in linear fractional programming
- scientific article; zbMATH DE number 7716279
- Linear fractional programming and duality
- Strictly feasible solutions and strict complementarity in multiple objective linear optimization
- On duality theorems for linear fractional optimization problems involving integral functions
Cites work
- A Dual Fractional Program
- A limited memory \(q\)-BFGS algorithm for unconstrained optimization problems
- A modified slacks-based measure of efficiency in data envelopment analysis
- A slacks-based measure of efficiency in data envelopment analysis
- A slacks-based measure of super-efficiency in data envelopment analysis
- An enhanced DEA Russell graph efficiency measure
- Connected directional slack-based measure of efficiency in DEA
- Convex Analysis
- Duality Theory of Linear Programs: A Constructive Approach with Applications
- Erratum to ``Network DEA: a slacks-based measure approach [European Journal of Operational Research 197 (2009) 243-252]
- Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution
- Fractional programming: Applications and algorithms
- scientific article; zbMATH DE number 3121284 (Why is no real title available?)
- scientific article; zbMATH DE number 192888 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 1163807 (Why is no real title available?)
- Identifying the global reference set in DEA: an application to the determination of returns to scale
- Linear fractional programming and duality
- Linear-fractional programming. Theory, methods, applications and software.
- Measuring the efficiency of decision making units
- Network DEA: A slacks-based measure approach
- Nonlinear Programming
- On the identification of the global reference set in data envelopment analysis
- Programming with linear fractional functionals
- Robust optimization
- Solving LFP by converting it into a single LP
- The use of the optimal partition in a linear programming solution for postoptimal analysis
- Variations on the theme of slacks-based measure of efficiency in DEA
Cited in
(3)
This page was built for publication: The strict complementarity in linear fractional optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3390757)
