Andrew B. Philpott

Andrew B. Philpott

Auto-generated profile, based on publicly available information

Andrew B. Philpott

University of Auckland, Auckland 1010, New Zealand

Research Focus & Metrics

Academic Career Length

45Years (1982-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2008 in Operations Research Letters
Verified
Journal Article
Closed access
APA.B. Philpott
A.B. Philpott
ZGZ. Guan
Z. Guan

1 April 2012 in European Journal of Operational Research
Verified
Journal Article
Closed access
APA.B. Philpott
A.B. Philpott
VMV.L. de Matos
V.L. de Matos

30 April 2007 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
Miguel Carrión Ruiz PeinadoMiguel Carrión Ruiz Peinado
Miguel Carrión Ruiz Peinado
APAndy B. Philpott
Andy B. Philpott
ACAntonio J Conejo
Antonio J Conejo
JAJos M. Arroyo
Jos M. Arroyo
This paper provides a technique based on stochastic programming to optimally solve the electricity procurement problem faced by a large consumer. Supply sources include bilateral contracts, a limited amount of self-production and the pool. Risk aversion is explicitly modeled using the conditional value-at-risk methodology. Results from a realistic case study are provided and analyzed

1 August 2010 in Operations Research
Verified
Journal Article
Closed access
GPGeoffrey Pritchard
Geoffrey Pritchard
GZGolbon Zakeri
Golbon Zakeri
APAndrew Philpott
Andrew Philpott
We discuss a stochastic-programming-based method for scheduling electric power generation subject to uncertainty. Such uncertainty may arise from either imperfect forecasting or moment-to-moment fluctuations, and on either the supply or the demand side. The method gives a system of locational marginal prices that reflect the uncertainty, and these may be used in a market settlement scheme in which payment is for energy only. We show that this scheme is revenue adequate in expectation.

1 February 2015 in Mathematics of Operations Research
Verified
Journal Article
Closed access
PGP. Girardeau
P. Girardeau
VLV. Leclere
V. Leclere
APA. B. Philpott
A. B. Philpott
We prove the almost-sure convergence of a class of sampling-based nested decomposition algorithms for multistage stochastic convex programs in which the stage costs are general convex functions of the decisions and uncertainty is modelled by a scenario tree. As special cases, our results imply the almost-sure convergence of stochastic dual dynamic programming, cutting-plane and partial-sampling (CUPPS) algorithm, and dynamic outer-approximation sampling algorithms when applied to problems with general convex cost functions.

1 August 2013 in Operations Research
Verified
Journal Article
Closed access
APAndy Philpott
Andy Philpott
VMVitor de Matos
Vitor de Matos
EFErlon Finardi
Erlon Finardi
We consider a class of multistage stochastic linear programs in which at each stage a coherent risk measure of future costs is to be minimized. A general computational approach based on dynamic programming is derived that can be shown to converge to an optimal policy. By computing an inner approximation to future cost functions, we can evaluate an upper bound on the cost of an optimal policy, and an outer approximation delivers a lower bound. The approach we describe is particularly useful in sampling-based algorithms, and a numerical example is provided to show the efficacy of the methodology when used in conjunction with stochastic dual dynamic programming.