Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution

DOI10.1007/S40314-016-0324-XzbMATH Open1393.90071OpenAlexW1557328708MaRDI QIDQ1655360FDOQ1655360

Authors: M. Mehdiloozad, Kaoru Tone, 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

Recommendations

• Representation of max-plus convex sets in terms of extreme points and extreme generators
• Motzkin decomposition of closed convex sets
• A representation of generalized convex polyhedra and applications
• scientific article; zbMATH DE number 4135708
• On finite linear systems containing strict inequalities

zbMATH Keywords

linear programmingrepresentation theoremmaximal elementcharacteristic conenon-negative convex setstrictly complementary solution

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Title not available (Why is that?)
• A new polynomial-time algorithm for linear programming
• Measuring the efficiency of decision making units
• Convex Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An occurrence of multiple projections in DEA-based measurement of technical efficiency: theoretical comparison among DEA models from desirable properties
• Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
• The measurement of returns to scale under a simultaneous occurrence of multiple solutions in a reference set and a supporting hyperplane
• Title not available (Why is that?)
• The theory of linear programming:skew symmetric self-dual problems and the central path^*
• A note on imposing strong complementary slackness conditions in DEA
• On the identification of the global reference set in data envelopment analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Measurement of returns to scale using a non-radial DEA model: a range-adjusted measure approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• A geometric view of parametric linear programming
• An analysis of degeneracy
• Convex optimization algorithms
• Duality Theory of Linear Programs: A Constructive Approach with Applications
• Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming
• Degeneracy degrees of constraint collections
• Title not available (Why is that?)
• Incremental Linear Constraint Solving and Detection of Implicit Equalities
• Marginal Values in Linear Programming
• On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method
• Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• On proper separation of convex sets
• ``Facet separation with one linear program
• Minkowski summands of cubes
• Identifying the global reference set in DEA: an application to the determination of returns to scale
• The strict complementarity in linear fractional optimization

This page was built for publication: Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1655360)