File:A branch and bound method for nonseparable nonconvex optimization (IA branchboundmetho00hart).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,135 × 1,602 pixels, file size: 624 KB, MIME type: application/pdf, 18 pages)

Captions

Captions

Add a one-line explanation of what this file represents

Summary

[edit]
A branch and bound method for nonseparable nonconvex optimization   (Wikidata search (Cirrus search) Wikidata query (SPARQL)  Create new Wikidata item based on this file)
Author
Hartman, James K.
image of artwork listed in title parameter on this page
Title
A branch and bound method for nonseparable nonconvex optimization
Publisher
Monterey, California : Naval Postgraduate School
Description
Title from cover
"Prepared for: Office of Naval Research, Arlington, Virginia 22217"--Cover
"October 1975"--Cover
"NPS-55Hh75102"--Cover
Author(s) subject terms:Linear programming, nonconvex, optimization, branch and bound
Includes bibliographical references (p. 10)
Technical report; 1975
In this paper a nonconvex programming algorithms which was developed originally for separable programming problems is formally extended to apply to nonseparable problems also. It is shown that the basic steps of the method can be modified so that separability is no restriction. (Author)

Subjects: UNITED STATES. NAVY--PERSONNEL MANAGEMENT--MATHEMATICAL MODELS.FACTOR ANALYSIS.MULTIDIMENSIONAL SCALING.CLUSTER ANALYSIS.
Language en_US
Publication date October 1975
publication_date QS:P577,+1975-10-00T00:00:00Z/10
Current location
IA Collections: navalpostgraduateschoollibrary; fedlink; americana
Accession number
branchboundmetho00hart
Notes No copyright page found. No table-of-contents pages found.
Authority file  OCLC: 1041659893
Source
https://archive.org/details/branchboundmetho00hart
https://archive.org/download/branchboundmetho00hart/branchboundmetho00hart.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.
This file has been identified as being free of known restrictions under copyright law, including all related and neighboring rights.

File history

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

Date/TimeThumbnailDimensionsUserComment
current15:34, 25 June 2020Thumbnail for version as of 15:34, 25 June 20201,135 × 1,602, 18 pages (624 KB)Fæ (talk | contribs)FEDLINK - United States Federal Collection branchboundmetho00hart (User talk:Fæ/CCE volumes#Fork8) (batch 1974-1976 #2931)

You cannot overwrite this file.

Metadata

This file contains additional information such as Exif metadata which may have been added by the digital camera, scanner, or software program used to create or digitize it. If the file has been modified from its original state, some details such as the timestamp may not fully reflect those of the original file. The timestamp is only as accurate as the clock in the camera, and it may be completely wrong.

Retrieved from "https://commons.wikimedia.org/w/index.php?title=File:A_branch_and_bound_method_for_nonseparable_nonconvex_optimization_(IA_branchboundmetho00hart).pdf&oldid=776708207"