Search for feasible solutions by interior point algorithms

DOI10.1134/S1995423916030022MaRDI QIDQ2963854zbMATH OpenOpenAlexFDO

Authors Valeriǐ Ivanovich Zorkaltsev

Publication date 21 February 2017

Published in Numerical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1995423916030022

zbMATH Keywords

interior point algorithmlinear programmingtechniques of entering the feasible region

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)

Recommendations

• Entering into the domain of feasible solutions using interior point method
• scientific article; zbMATH DE number 1097715
• scientific article; zbMATH DE number 1064586
• On finding a vertex solution using interior point methods
• Interior point algorithms in linear optimization
• scientific article; zbMATH DE number 123966
• Interior-point methods for optimization
• Finding an interior point in the optimal face of linear programs
• An Interior-Point Algorithm for Linearly Constrained Optimization
• scientific article; zbMATH DE number 269555

Cited in

(2)

• Entering into the domain of feasible solutions using interior point method
• Feasible region contraction interior point algorithm

This page was built for publication: Search for feasible solutions by interior point algorithms

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