Pages that link to "Item:Q1113798"

The following pages link to An analysis of an available set of linear programming test problems (Q1113798):

Displaying 11 items.

• Feasibility issues in a primal-dual interior-point method for linear programming (Q803044) (← links)
• George B. Dantzig and systems optimization (Q951088) (← links)
• An analysis of an available set of linear programming test problems (Q1113798) (← links)
• A barrier method for dynamic Leontief-type linear programs (Q1199511) (← links)
• A computational study of redundancy in randomly generated polytopes (Q1207047) (← links)
• A practical anti-cycling procedure for linearly constrained optimization (Q1264089) (← links)
• On the use of dense matrix techniques within sparse simplex (Q1309853) (← links)
• A clustering heuristic to detect staircase structures in large scale linear programming models (Q1331570) (← links)
• Steepest-edge simplex algorithms for linear programming (Q1802952) (← links)
• Gigaflops in linear programming (Q1919182) (← links)
• Modified fictitious play for solving matrix games and linear-programming problems (Q1919970) (← links)