A dual method for solving the canonical linear programming problem

MaRDI QIDQ3161283zbMATH OpenFDO

Authors Rafail Gabasov, Faina Mihaǐlovna Kirillova

Publication date 14 October 2010

Mathematics Subject Classification ID

Linear programming (90C05) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Canonical bases in linear programming
• A method of solving the general problem of linear programming
• Direct-dual block method of linear programming
• On a dual block linear programming technique
• scientific article; zbMATH DE number 67669

Cited in

(14)

• Direct-dual block method of linear programming
• On a dual block linear programming technique
• A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming
• A simple canonical form for nonlinear programming problems and its use
• Canonical duality solution for alternating support vector machine
• Optimal stochastic control
• scientific article; zbMATH DE number 4093174 (Why is no real title available?)
• scientific article; zbMATH DE number 67669 (Why is no real title available?)
• scientific article; zbMATH DE number 1282260 (Why is no real title available?)
• Discussion on the method of solving the linear programming by dual theory
• Regularized dual method for nonlinear mathematical programming
• A Lagrangean dual-based solution method for a special linear programming problem
• Canonical dual approach to solving the maximum cut problem
• Canonical bases in linear programming

This page was built for publication: A dual method for solving the canonical linear programming problem

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