File:Automatic factorization of generalized upper bounds in large scale optimization models (IA automaticfactori00brow).pdf

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search
Go to page
next page →
next page →
next page →

Original file(1,141 × 1,595 pixels, file size: 2.46 MB, MIME type: application/pdf, 56 pages)

Captions

Captions

Add a one-line explanation of what this file represents

Summary

[edit]
Automatic factorization of generalized upper bounds in large scale optimization models   (Wikidata search (Cirrus search) Wikidata query (SPARQL)  Create new Wikidata item based on this file)
Author
Brown, Gerald Gerard, 1946-;Thomen, David S.
image of artwork listed in title parameter on this page
Title
Automatic factorization of generalized upper bounds in large scale optimization models
Publisher
Monterey, California : Naval Postgraduate School
Description
Title from cover
"January 1980."
"NPS-55-80-003."
Includes bibliographic references (p. 47-48)
Technical report; 1980
To solve contemporary large scale linear, integer and mixed integer programming problems, it is often necessary to exploit intrinsic special structure in the model at hand. One commonly used technique is to identify and then to exploit in a basis factorization algorithm a generalized upper bound (GUB) structure. This report compares several existing methods for identifying GUB structure. Computer programs have been written to permit comparison of computational efficiency. The GUB programs have been incorporated in an existing optimization system of advanced design and have been tested on a variety of large scale real life optimization problems. The identification of GUB sets of maximum size is shown to be among the class of NP-complete problems; these problems are widely conjectured to be intractable in that no polynomial-time algorithm has been demonstrated for solving them. All the methods discussed in this report are polynomial-time heuristic algorithms that attempt to find, but do not guarantee, GUB sets of maximum size. Bounds for the maximum size of GUB sets are developed, in order to evaluate the effectiveness of the heuristic algorithms. (Author)

Subjects: EVAPORATION (METEOROLOGY)--MEASUREMENT.BOUNDARY LAYER (METEOROLOGY); ATMOSPHERIC TURBULENCE.ELECTROMAGNETIC WAVES.
Language en_US
Publication date January 1980
publication_date QS:P577,+1980-01-00T00:00:00Z/10
Current location
IA Collections: navalpostgraduateschoollibrary; fedlink; americana
Accession number
automaticfactori00brow
Notes No copyright page found. No table-of-contents pages found.
Authority file  OCLC: 1039957010
Source
Internet Archive identifier: automaticfactori00brow
https://archive.org/download/automaticfactori00brow/automaticfactori00brow.pdf

Licensing

[edit]
Public domain
This work is in the public domain in the United States because it is a work prepared by an officer or employee of the United States Government as part of that person’s official duties under the terms of Title 17, Chapter 1, Section 105 of the US Code. Note: This only applies to original works of the Federal Government and not to the work of any individual U.S. state, territory, commonwealth, county, municipality, or any other subdivision. This template also does not apply to postage stamp designs published by the United States Postal Service since 1978. (See § 313.6(C)(1) of Compendium of U.S. Copyright Office Practices). It also does not apply to certain US coins; see The US Mint Terms of Use.

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current05:42, 29 June 2020Thumbnail for version as of 05:42, 29 June 20201,141 × 1,595, 56 pages (2.46 MB) (talk | contribs)FEDLINK - United States Federal Collection automaticfactori00brow (User talk:Fæ/CCE volumes#Fork8) (batch 1980-1982 #2885)

Metadata