Solving linear programming problem via a reduced dimension method

zbMATH Open1180.65082MaRDI QIDQ3397680FDOQ3397680

Authors: Zhensheng Yu, Jing Sun 

Publication date: 22 September 2009

Recommendations

• On a finite-dimensional variant of the method of the projection of the remote point
• Publication:4937580
• A simple alternating direction method for linear variational inequality problems
• scientific article; zbMATH DE number 6613080
• scientific article; zbMATH DE number 4185389

zbMATH Keywords

linear programmingglobal convergencealternating direction methodvariational inequalitiesprojection equationprimal-dual optimality conditionsreduced dimension method

Mathematics Subject Classification ID

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

Cited In (3)

• Eliminating columns in the simplex method for linear programming
• Title not available (Why is that?)
• On a finite-dimensional variant of the method of the projection of the remote point

This page was built for publication: Solving linear programming problem via a reduced dimension method

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