scientific article; zbMATH DE number 3939126

MaRDI QIDQ3712145zbMATH OpenFDO

Authors A. S. Lewis

Publication date 1985

zbMATH Keywords

general capacity problemgeneral linear programminggeneralized extreme pointprimal simplex-type algorithmpurification algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Semi-infinite programming (90C34) Programming in abstract spaces (90C48)

Recommendations

• Extreme points algorithm for solving bilevel linear programming
• An exterior point simplex algorithm for (general) linear programming problems
• New purification algorithms for linear programming
• scientific article; zbMATH DE number 710572
• An algorithm for linearizing convex extremal problems
• An exterior-point method for linear programming problems
• On the Stability of the Extreme Point Set in Linear Optimization
• On Extreme Point Programming Problem
• scientific article; zbMATH DE number 2196286
• Characterizing extreme points as basic feasible solutions in infinite linear programs

Cited in

(6)

• On the complexity of the extreme points decision problem
• A purification algorithm for semi-infinite programming
• New purification algorithms for linear programming
• scientific article; zbMATH DE number 609981 (Why is no real title available?)
• scientific article; zbMATH DE number 866106 (Why is no real title available?)
• scientific article; zbMATH DE number 2212089 (Why is no real title available?)

This page was built for publication:

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