Re: MOST Optimization Issue with PV Generation Less Than Half of Load

2023-09-27 Thread Ray Daniel Zimmerman
This mailing list (or a GitHub issue) is still my preferred way to respond to these sorts of questions, but for some reason I saw and responded first here this time. Ray On Sep 25,

Re: MOST preventive security

2023-05-12 Thread Carlos E Murillo-Sanchez
Dear Igor, please see comments below. Igor Verbruggen wrote: Dear all,   I am attempting to use MOST to formulate a DC security constrained OPF, with preventive and corrective

Re: [MOST] Speed up repeated optimization of dispatch

2019-07-13 Thread Carlos E Murillo-Sanchez
Reinhold Bertram wrote: Dear all, is it possible to speed up the repeated solving of a deterministic multi-period dispatch problem with MOST when only the loadprofile changes? At the moment SetupTime is about 2 seconds for each iteration. Is it possible to skip/shorten this time? Best

Re: MOST example 5,6

2018-09-17 Thread Ray Zimmerman
But sometimes it is not possible to ramp down the conventional generators fast enough in the high wind period, or ramp them up fast enough afterward when the wind decreases. Or if the ramping costs are high, then it may be less expensive overall to curtail wind than to incur the higher ramping

Re: MOST example 5,6

2018-09-17 Thread Shady Mamdouh
Sent from Yahoo Mail on Android On Mon, Sep 17, 2018 at 19:21, Ray Zimmerman wrote: I’m not sure which example you are actually referring to, since examples 5 and 6 are deterministic. However, it is not unusual for wind to be curtailed in high-wind scenarios because of the costs or

Re: MOST example 5,6

2018-09-17 Thread Ray Zimmerman
I’m not sure which example you are actually referring to, since examples 5 and 6 are deterministic. However, it is not unusual for wind to be curtailed in high-wind scenarios because of the costs or constraints imposed on the ramping of conventional units that would be required to support

RE: MOST and ramp rates (was Re: Ramp AGC)

2018-03-13 Thread Bainan Xia
Thanks for the explanation! I’ve figured out which constraint is actually binding in my case. Best, Bainan From: bounce-122375618-80810...@list.cornell.edu [mailto:bounce-122375618-80810...@list.cornell.edu] On Behalf Of Ray Zimmerman Sent: Tuesday, March 13, 2018 7:11 AM To: MATPOWER

Re: MOST Results on Bus Voltage Angles

2017-08-31 Thread Quarm JNR, Edward A
ussion forum Subject: Re: MOST Results on Bus Voltage Angles You can find them in … mdo.flow(t, j, k).mpc.bus(:, VA) See Table 5-10 in the MOST User’s Manual for details. Ray On Aug 31, 2017, at 2:16 PM, Quarm JNR, Edward A <edwardarthur.quarm...@mavs.uta.edu<mailto:edwardarthur.qua

Re: MOST Results on Bus Voltage Angles

2017-08-31 Thread Ray Zimmerman
You can find them in … mdo.flow(t, j, k).mpc.bus(:, VA) See Table 5-10 in the MOST User’s Manual for details. Ray > On Aug 31, 2017, at 2:16 PM, Quarm JNR, Edward A > wrote: > > Hi MATPOWER/MOST community, > > I am running a unit commitment

Re: MOST-Generator Cost Data for Load

2017-07-27 Thread Ray Zimmerman
When you set the load “cost” to zero, that is essentially saying that there is no value to serving the load. That is, load can be curtailed without any penalty. I doubt that’s what you want. Ray > On Jul 26, 2017, at 1:06 PM, Muhammad Fadli Azis >

Re: MOST-Generator Cost Data for Load

2017-07-26 Thread morteza keshavarz
leave On Wed, Jul 26, 2017 at 1:06 PM, Muhammad Fadli Azis < muhammadfadli.a...@postgrad.manchester.ac.uk> wrote: > Dear MATPOWER Community > > Could you explain why the load data in MATPOWER Optimal Scheduling Tool > (MOST), > which is assumed as a negative generation, has a cost of $1000? As

Re: MOST MIPS numerically failed

2017-07-25 Thread Ray Zimmerman
First of all, MIPS is definitely not a very robust LP solver, so you should use another solver if one is available. It appears (from the results of rundcopf) that you do have the Optimization Toolbox, i.e. linprog available. I suggest trying the linprog dual-simplex solver. mpopt =

Re: MOST, unit commitment

2017-07-03 Thread Ray Zimmerman
There is not necessarily anything unusual about this. If the generators are relatively expensive and their PMIN value is zero, it may be economical to dispatch them at 0 MW output. Ray > On Jun 9, 2017, at 8:15 PM, Xinwen Ni wrote: > > Hi, all > > I built a test

Re: MOST

2017-05-31 Thread Ray Zimmerman
By default, when solving a unit commitment problem, MOST solves the mixed-integer problem first, then re-solves the continuous variable problem to get the prices, setting the integer variables to their solved values. For some reason, under MATLAB R2016a your problem is failing on the price

Re: MOST

2017-05-31 Thread Ammar Raza
hi, I am wondering in the MATLAB R2015a version my code is running fine but in MATLAB R2016a version I am getting error of the same code. The error is Error using miqps_ot (line 346) miqps_ot: EXITFLAG from price computation stage = 0 Error in miqps_matpower (line 220) miqps_ot(H,

Re: MOST

2017-05-22 Thread Ammar Raza
Hi Ray, Thank you for your email. Kind Regard, Mohammad Ammar Raza On 17 May 2017 at 14:51, Ray Zimmerman wrote: > Hi Mohammad, > > A unit commitment problem with quadratic generator costs or ramping costs > requires a solver that can handle Mixed Integer Quadratic

Re: MOST

2017-05-17 Thread Ray Zimmerman
Hi Mohammad, A unit commitment problem with quadratic generator costs or ramping costs requires a solver that can handle Mixed Integer Quadratic Programming (MIQP) problems. The only MATPOWER-compatible solvers that handle MIQP are Gurobi, CPLEX and MOSEK, as stated in the System Requirements

Re: MOST

2017-05-16 Thread Ammar Raza
Hi I am trying to do example 6 of the MOST user manual with Bus 118 and I got this error. Error using mpopt2qpopt (line 92) mpopt2qpopt: Sorry, no solver available for MIQP models Error in most (line 2065) mdo.QP.opt = mpopt2qpopt(mpopt, model, 'most'); Error in most_ammar6 (line 108) mdo =

Re: MOST

2017-05-15 Thread Ray Zimmerman
In a deterministic problem, transmat can simply be a scalar with the number of periods. See the description of transmat in the help for loadmd() . Ray > On May 15, 2017, at 7:37 AM, Ammar Raza

Re: MOST

2017-05-15 Thread Ammar Raza
Thank you Ray Therefore, Transmat should be like that? transmat = cell(1, nt); T = [ 1x 99]; [transmat{:}] = deal(T * ones(1,1)); transmat{1} = T; Kind Regard, Mohammad Ammar Raza On 11 May 2017 at 13:42, Ray Zimmerman wrote: > Just to clarify, if loadprofile.rows = 0,

Re: MOST

2017-05-11 Thread Ray Zimmerman
Just to clarify, if loadprofile.rows = 0, then loadprofile.values(:, 1, :) = [24 x 1] and all loads are scaled together. Otherwise, the number of columns in loadprofile.values(:, 1, :) must equal the length of loadprofile.rows and each of the specified loads is scaled separately. Ray >

Re: MOST

2017-05-09 Thread Ammar Raza
Its means loadprofile.rows= [1 x 99 ] Thanks Stephanie for your help. Kind Regard, Mohammad Ammar Raza On 9 May 2017 at 15:25, Stephanie wrote: > Yes, and the value of rows, 0 means the load is applied to the all buses, > so you should also change the value of the

Re: MOST

2017-05-09 Thread Stephanie
Yes, and the value of rows, 0 means the load is applied to the all buses, so you should also change the value of the rows by loadprofile.rows=load_index (e.g. loadprofile.rows=[2 3 5]), if there are three loads located in bus 2, 3 and 5, respectively) Best Regards, Stephanie 2017-05-09 22:09

Re: MOST

2017-05-09 Thread Ammar Raza
that means loadprofile = struct( ... 'type', 'mpcData', ... 'table', CT_TLOAD, ... 'rows', 0, ... 'col', CT_LOAD_ALL_PQ, ... 'chgtype', CT_REP, ... 'values', [] ); loadprofile.values(:, 1, :) = [ 24 x 99 ] Kind Regard, Mohammad Ammar Raza On 9 May 2017 at 14:55,

Re: MOST

2017-05-09 Thread Stephanie
Hi, I tried it a few days before, what I did is: loadprofile.rows=load_index; %which applies the load to the bus it locates loadprofile.value (:,1,:) = [24 x 99]; And it works in my situation Hope it will help you -- Best Regards Stephanie *From:* Ammar Raza

Re: MOST Question regarding Quadratic Gen Costs

2017-04-12 Thread Akash Tyagi
Hello everyone, I am working on the continuation power flow technique. I have used the given 30 bus data for the continuation power flow and i have increased all the loads by a factor of 5, which results in the decreased in the voltage magnitude and the lowest voltage is found to be at bus 8. Now

Re: MOST

2017-04-10 Thread Ray Zimmerman
Your gen and gencost matrices have 153 rows each, but mpc.reserves.zones has only 55 elements. It runs fine with the following modification in ex_case118.m. mpc.reserves.zones = [ones(1,54) zeros(1,99)]; — Ray > On Apr 6, 2017, at 9:05 AM, Ammar Raza wrote: > > Hi

Re: MOST Question regarding Quadratic Gen Costs

2017-04-10 Thread Ray Zimmerman
This is a solver issue. See footnote 5 on page 10 of the MOST User’s Manual . For MIQP problems, that is, unit commitment problems with quadratic generator costs and/or ramping wear and tear costs, you will need Gurobi, CPLEX or

Re: MOST

2017-04-10 Thread Ray Zimmerman
For zonal reserves, please see the documentation for toggle_reserves() and Section 7.5.1 in the MATPOWER User’s Manual . In your example, it

Re: MOST

2017-04-03 Thread Ammar Raza
hi everyone, Can you please specified me how to put Reserve data in 118 bus system in MOST. In 118 bus there is 54 gen therefore, I have to put 1's in 54 times in mpc.reserves.zones(). I did it but I am not sure it is right. %%- Reserve Data -%% %% reserve zones, element i, j is 1

Re: MOST

2017-03-28 Thread Ray Zimmerman
If you are asking for the equivalent of runmarket() for MOST, I’m afraid it hasn’t been implemented. MOST assumes that gencost has been constructed to reflect the problem you want to solve. This could

Re: MOST

2017-03-24 Thread Ammar Raza
Hello, Can you please specified how we apply offers(), and bids() in the MOST. In example 6 and 7.in the MOST manual. Thankyou Kind Regard, Mohammad Ammar Raza On 23 March 2017 at 11:30, Ammar Raza wrote: > Hello All, > > I am working on MOST and I have gone through

Re: MOST example

2016-06-03 Thread Carlos E Murillo-Sanchez
[mailto:bounce-120538094-71172...@list.cornell.edu] On Behalf Of Carlos E Murillo-Sanchez Sent: Friday, June 03, 2016 11:29 AM To: MATPOWER discussion forum <matpowe...@list.cornell.edu> Subject: Re: MOST e

Re: MOST example

2016-06-03 Thread Carlos E Murillo-Sanchez
forum <matpowe...@list.cornell.edu> Subject: Re: MOST example   For each time period, there can be several wind scenarios. The idea is to capture the variability of wind, given a forecast,

Re: MOST example

2016-06-03 Thread Carlos E Murillo-Sanchez
, June 03, 2016 9:29 AM To: MATPOWER discussion forum <matpowe...@list.cornell.edu> Subject: Re: MOST example   MOST requires a good MILP solver for UC problems. I believe that only the very latest ve

RE: MOST example

2016-06-03 Thread Bai, Wenlei
To: MATPOWER discussion forum <matpowe...@list.cornell.edu> Subject: Re: MOST example MOST requires a good MILP solver for UC problems. I believe that only the very latest versions of intlingprog (of the Optimization Toolbox) are up for the task. If you don’t have the latest version of

Re: MOST example

2016-06-03 Thread Ray Zimmerman
MOST requires a good MILP solver for UC problems. I believe that only the very latest versions of intlingprog (of the Optimization Toolbox) are up for the task. If you don’t have the latest version of Matlab (and even if you do), I would strongly recommend using Gurobi or CPLEX (free for