Solar cars and variational problems equivalent to shortest paths

被引：10

作者：

Gates, DJ

Westcott, M

机构：

[1] CSIRO, Divisions of Math. and Statistics, Canberra, ACT 2601

来源：

SIAM JOURNAL ON CONTROL AND OPTIMIZATION | 1996年 / 34卷 / 02期

关键词：

optimization; solar-powered car; storage; quadratic program; rearrangements of functions; convex envelopes; variational problem;

D O I：

10.1137/S0363012993260276

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A classical theorem of Hardy, Littlewood, and Polya on rearrangements of functions is used to prove the equivalence of a class of variational problems. As a consequence, solutions are shortest paths and can be computed numerically via quadratic programming. Applications include solar cars and reservoirs.

引用

页码：428 / 436

页数：9