Finite methods for a nonlinear allocation problem

Thumbnail Image
Files
finitemethodsfor00wash.pdf (1.08 MB)
Authors
Washburn, Alan R.
Subjects
allocation
nonlinear
Allocation
Nonlinear
Advisors
Date of Issue
1989-04
Date
1989-04
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
We consider the problem of allocating m resources to n tasks. The potential effectiveness, y. for the j task is a linear function of the allocations to that task, and the objective function is a convex function f (y , . . . , y ) to be minimized. Two finite algorithms for obtaining an optimal solution are proposed and evaluated.
Type
Technical Report
Description
URI
https://hdl.handle.net/10945/29304
Series/Report No
Department
Organization
Identifiers
NPS Report Number
NPS-55-89-03
Sponsors
Chief of Naval Operations
Funder
O&MN, Direct Funding
Format
NA
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections
Reports