Finite Methods for a Nonlinear Allocation Problem

Abstract

The author considers the problem of allocating m resources to n tasks. The potential effectiveness, y j for the j sub th task is a linear function of the allocations to that task, and the objective function is a convex function f (y sub 1 ,..., y sub n) to be minimized. Two finite algorithms for obtaining an optimal solution are proposed and evaluated.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1989
Accession Number
ADA209719

Entities

People

  • Alan R. Washburn

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Air Platforms
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Business Administration
  • Civil Engineering
  • Computations
  • Convex Sets
  • Engineering
  • Equations
  • Iterations
  • Linear Programming
  • Naval Operations
  • Numbers
  • Operations Research
  • Probability
  • Random Variables
  • Search Theory
  • Security
  • Simplex Method

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Team-Based Human-Centered Cognitive Task Decision Making and Information Performance.