Numerical inclusion of optimum point for linear programming

DOI10.14495/JSIAML.1.5MaRDI QIDQ2858133zbMATH OpenOpenAlexFDO

Authors Shin'ichi Oishi, Kunio Tanabe

Publication date 19 November 2013

Published in JSIAM Letters (Search for Journal in Brave)

Full work available at URL https://www.jstage.jst.go.jp/A_PRedirectJournalInit?sryCd=jsiaml&kijiCd=1_0_5&screenID=AF06S010&noVol=1&noIssue=0

zbMATH Keywords

linear programmingnumerical examplesKantorovich's theoremnumerical verificationcontinuous Newton method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Methods of quasi-Newton type (90C53) Algorithms with automatic result verification (65G20)

Recommendations

• An interior point method for linear programming
• The Kantorovich theorem and interior point methods
• scientific article; zbMATH DE number 4062817
• scientific article; zbMATH DE number 4170640
• Iterative linear programming solution of convex programs

Cited in

(1)

• Component-wise verified solutions for constrained convex programming

This page was built for publication: Numerical inclusion of optimum point for linear programming

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