An experimental investigation of a new multiplex method for linear programming

DOI10.4102/SATNT.V6I2.948zbMATH Open0617.90061OpenAlexW1966081521MaRDI QIDQ3754435FDOQ3754435

Authors:

Publication date: 1987

Published in: Suid-Afrikaanse Tydskrif vir Natuurwetenskap en Tegnologie (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4102/satnt.v6i2.948

Recommendations

• scientific article; zbMATH DE number 4068606
• scientific article; zbMATH DE number 4059112
• Karmarkar's projective method for linear programming: a computational survey
• An interior feasible direction method with constraint projections for linear programming
• A multiplicative barrier function method for linear programming

zbMATH Keywords

gradient pathmultiplex method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cited In (9)

• An experimental evaluation of the efficacy of four multi-objective linear programming algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• A simplex-like method with bisection for linear programming¹
• On the development of simplex methods for linear multiplier-alike method
• An experimental comparison of some recently developed linear programming approaches to the discriminant problem
• The complex interior-boundary method for linear and nonlinear programming with linear constraints
• Das Triplex-Verfahren
• Title not available (Why is that?)

This page was built for publication: An experimental investigation of a new multiplex method for linear programming

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