Decomposed enumeration of extreme points in the linear programming problem
From MaRDI portal
Publication:4077067
DOI10.1007/BF01932688zbMath0315.90043MaRDI QIDQ4077067
Publication date: 1975
Published in: BIT (Search for Journal in Brave)
Related Items (3)
Enumerative techniques for solving some nonconvex global optimization problems ⋮ A Stochastic Generalized Network Model and Large-Scale Mean-Variance Algorithm for Portfolio Selection ⋮ Ranking of vertices in the linear fractional programming problem
Cites Work
This page was built for publication: Decomposed enumeration of extreme points in the linear programming problem