Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution
From MaRDI portal
Publication:1655360
DOI10.1007/s40314-016-0324-xzbMath1393.90071OpenAlexW1557328708MaRDI QIDQ1655360
Kaoru Tone, Mahmood Mehdiloozad, Rahim Askarpour, Mohammad Bagher Ahmadi
Publication date: 9 August 2018
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-016-0324-x
linear programmingrepresentation theoremmaximal elementcharacteristic conenon-negative convex setstrictly complementary solution
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05)
Related Items
The strict complementarity in linear fractional optimization, ``Facet separation with one linear program, Identifying the Global Reference Set in DEA: An Application to the Determination of Returns to Scale
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Measuring the efficiency of decision making units
- On the identification of the global reference set in data envelopment analysis
- A new polynomial-time algorithm for linear programming
- Measurement of returns to scale using a non-radial DEA model: a range-adjusted measure approach
- The measurement of returns to scale under a simultaneous occurrence of multiple solutions in a reference set and a supporting hyperplane
- An occurrence of multiple projections in DEA-based measurement of technical efficiency: theoretical comparison among DEA models from desirable properties
- A geometric view of parametric linear programming
- Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
- Finding an interior point in the optimal face of linear programs
- The use of the optimal partition in a linear programming solution for postoptimal analysis
- Degeneracy degrees of constraint collections
- On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method
- A note on imposing strong complementary slackness conditions in DEA
- Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
- An analysis of degeneracy
- Incremental Linear Constraint Solving and Detection of Implicit Equalities
- The theory of linear programming:skew symmetric self-dual problems and the central path*
- Convex Analysis
- Duality Theory of Linear Programs: A Constructive Approach with Applications
- Marginal Values in Linear Programming
- Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming
