Finite method for a nonlinear allocation problem

DOI10.1007/BF02193063zbMath0831.90107MaRDI QIDQ1896578

Alan R. Washburn

Publication date: 4 September 1995

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

optimizationnetworksnonlinear allocation problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonlinear programming (90C30)

Related Items

Detection of a Markovian target with optimization of the search efforts under generalized linear constraints

Uses Software

• GAMS

Cites Work

• On the continuity of the minimum set of a continuous function
• The Theory of Search: Optimum Distribution of Search Effort
• Search for a Moving Target: The FAB Algorithm
• Restricted simplicial decomposition: Computation and extensions
• Technical Note—Note on Constrained Maximization of a Sum
• Simplicial decomposition in nonlinear programming algorithms
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Optimal Allocations of Continuous Resources to Several Activities with a Concave Return Function—Some Theoretical Results
• Finding the extremum of a function on a polyhedron
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item