New crash procedures for large systems of linear constraints (Q584077): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
Many algorithms for solving linearly constrained optimization problems maintain sets of basic variables. The calculation of the initial basis is of great importance as it determines to a large extent the amount of computation that will then be required to solve the problem. This paper presents a number of simple methods for obtaining an initial basis and tests to indicate how they perform on a variety of real-life problems.
Property / review text: Many algorithms for solving linearly constrained optimization problems maintain sets of basic variables. The calculation of the initial basis is of great importance as it determines to a large extent the amount of computation that will then be required to solve the problem. This paper presents a number of simple methods for obtaining an initial basis and tests to indicate how they perform on a variety of real-life problems. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Stefan Mititelu / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C06 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65K05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 4133850 / rank
 
Normal rank
Property / zbMATH Keywords
 
linearly constrained optimization
Property / zbMATH Keywords: linearly constrained optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
initial basis
Property / zbMATH Keywords: initial basis / rank
 
Normal rank

Revision as of 18:29, 1 July 2023

scientific article
Language Label Description Also known as
English
New crash procedures for large systems of linear constraints
scientific article

    Statements

    New crash procedures for large systems of linear constraints (English)
    0 references
    0 references
    0 references
    1989
    0 references
    Many algorithms for solving linearly constrained optimization problems maintain sets of basic variables. The calculation of the initial basis is of great importance as it determines to a large extent the amount of computation that will then be required to solve the problem. This paper presents a number of simple methods for obtaining an initial basis and tests to indicate how they perform on a variety of real-life problems.
    0 references
    linearly constrained optimization
    0 references
    initial basis
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references