An Analysis of an Available Set of Linear Programming Test Problems.

Abstract

A set of linear programming test problems is analyzed with MINOS, Version 5.1. The problems have been run with different options for scaling and partial pricing to illustrate the effects of these options on the performance of the simplex method. The results indicate that the different options can significantly improve or degrade the performance of the simplex method, and that these options must be chosen wisely. For each problem, a picture of the nonzero structure of the matrix A is also presented so that the problems can be classified according to structure. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1987
Accession Number
ADA185355

Entities

People

  • Irvin J. Lustig

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Computer Programming
  • Computers
  • Convex Programming
  • Linear Programming
  • Mathematical Programming
  • Operations Research
  • Optimization
  • Simplex Method
  • Spreadsheet Software
  • Test Sets
  • United States

Readers

  • Operations Research
  • Strategic Security Studies