Pages that link to "Item:Q1129474"

The following pages link to A dual projective simplex method for linear programming (Q1129474):

Displaying 20 items.

• A Lagrangean dual-based solution method for a special linear programming problem (Q581236) (← links)
• Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis (Q668136) (← links)
• Restricted vertex generation applied as a crashing procedure for linear programming (Q1086152) (← links)
• A solution comparison for dual angular linear programs (Q1088904) (← links)
• A combined phase I-phase II projective algorithm for linear programming (Q1114588) (← links)
• A projective simplex method for linear programming (Q1124875) (← links)
• Direct-dual block method of linear programming (Q1287534) (← links)
• A phase-1 approach for the generalized simplex algorithm (Q1612514) (← links)
• A dual projective pivot algorithm for linear programming (Q1771222) (← links)
• A basis-defiency-allowing variation of the simplex method for linear programming (Q1806578) (← links)
• A projective simplex algorithm using LU decomposition (Q1975340) (← links)
• A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming (Q2014048) (← links)
• A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule (Q2475881) (← links)
• A primal deficient-basis simplex algorithm for linear programming (Q2479158) (← links)
• An affine-scaling pivot algorithm for linear programming (Q2841137) (← links)
• (Q2990640) (← links)
• The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods (Q3978507) (← links)
• Efficiency of the dual simplex method for solving systems of linear inequalities (Q4005338) (← links)
• A Dual Simplex Algorithm for Piecewise-Linear Programming (Q4717146) (← links)
• Dual–primal algorithm for linear optimization (Q4924118) (← links)