Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution
type: Item
instance of: scholarly article
title: Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution
zbMATH Open document ID: 1393.90071
author: M. Mehdiloozad
author: Kaoru Tone
author: Rahim Askarpour
author: Mohammad Bagher Ahmadi
published in: Computational and Applied Mathematics
publication date: 2018-08-09T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 6915441
zbMATH Keywords: non-negative convex set
zbMATH Keywords: characteristic cone
zbMATH Keywords: maximal element
zbMATH Keywords: linear programming
zbMATH Keywords: strictly complementary solution
zbMATH Keywords: representation theorem
MaRDI profile type: Publication
full work available at URL: s40314-016-0324-x
OpenAlex ID: W1557328708
cites work: A geometric view of parametric linear programming
cites work: Q5578696
cites work: Duality Theory of Linear Programs: A Constructive Approach with Applications
cites work: Q3452586
cites work: Q3294638
cites work: Measuring the efficiency of decision making units
cites work: Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
cites work: An occurrence of multiple projections in DEA-based measurement of technical efficiency: theoretical comparison among DEA models from desirable properties
cites work: Q5808752
cites work: Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming
cites work: Q5821624
cites work: Q3236242
cites work: On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method
cites work: An analysis of degeneracy
cites work: The use of the optimal partition in a linear programming solution for postoptimal analysis
cites work: Q3141900
cites work: The theory of linear programming:skew symmetric self-dual problems and the central path*
cites work: A new polynomial-time algorithm for linear programming
cites work: A note on imposing strong complementary slackness conditions in DEA
cites work: On the identification of the global reference set in data envelopment analysis
cites work: Finding an interior point in the optimal face of linear programs
cites work: Q5760872
cites work: Q4040221
cites work: Convex Analysis
cites work: Q4339096
cites work: Degeneracy degrees of constraint collections
cites work: Q5630781
cites work: Incremental Linear Constraint Solving and Detection of Implicit Equalities
cites work: The measurement of returns to scale under a simultaneous occurrence of multiple solutions in a reference set and a supporting hyperplane
cites work: Measurement of returns to scale using a non-radial DEA model: a range-adjusted measure approach
cites work: Q5284115
cites work: Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
cites work: Q3236239
cites work: Marginal Values in Linear Programming
cites work: Q4692735
cites work: Q4840115
DOI: 10.1007/S40314-016-0324-X
description: scientific article; zbMATH DE number 6915441