Decomposed enumeration of extreme points in the linear programming problem

DOI10.1007/BF01932688MaRDI QIDQ4077067zbMATH OpenFDO

Authors Grete Dahl, Sverre Storøy

Publication date 1975

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01932688

Mathematics Subject Classification ID

Linear programming (90C05)

Cites work

• An algorithm for finding a vector in the intersection of open convex polyhedral cones

Cited in

(3)

• Ranking of vertices in the linear fractional programming problem
• Enumerative techniques for solving some nonconvex global optimization problems
• A Stochastic Generalized Network Model and Large-Scale Mean-Variance Algorithm for Portfolio Selection

This page was built for publication: Decomposed enumeration of extreme points in the linear programming problem

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