An exterior point linear programming method based on inclusive normal cones

DOI10.3934/jimo.2010.6.825zbMath1206.90083OpenAlexW2093283091MaRDI QIDQ620021

Yanqun Liu

Publication date: 19 January 2011

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2010.6.825

zbMATH Keywords

convergencelinear programmingexterior point algorithmoptimalityinclusive normal cones

Mathematics Subject Classification ID

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

Related Items (5)

Generalized corner optimal solution for LSIP: existence and numerical computation ⋮ A ladder method for linear semi-infinite programming ⋮ A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization ⋮ Asymptotic optimality conditions for linear semi-infinite programming ⋮ A global optimal zero-forcing beamformer design with signed power-of-two coefficients

This page was built for publication: An exterior point linear programming method based on inclusive normal cones