EXTENSIONS OF THE MULTIPLICATIVE PENALTY FUNCTION METHOD FOR LINEAR PROGRAMMING

DOI10.15807/JORSJ.30.160MaRDI QIDQ3757681zbMATH OpenOpenAlexFDO

Authors Hideki Imai

Publication date 1987

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.30.160

zbMATH Keywords

multiplicative penalty function method

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4059112
• Multiplicative method for exact penalty functions for linear and integer linear programming problems
• A proof of the polynomiality of the Iri-Imai method
• scientific article; zbMATH DE number 977754
• scientific article; zbMATH DE number 5991677

Cited in

(6)

• A proof of the polynomiality of the Iri-Imai method
• Multiplicative method for exact penalty functions for linear and integer linear programming problems
• Quadratic convergence of the Iri-Imai algorithm for degenerate linear programming problems
• scientific article; zbMATH DE number 5991677 (Why is no real title available?)
• Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
• Linearization method for a class of multiplicative programming with exponent

This page was built for publication: EXTENSIONS OF THE MULTIPLICATIVE PENALTY FUNCTION METHOD FOR LINEAR PROGRAMMING

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