Nuclear Case Study - Double Loop Workflow
In this notebook, we illustrate the simulation of a base-load nuclear power plant integrated with a low temperature electrolysis system for hydrogen production using the double loop workflow. In addition to DISPATCHES, we need IDAES grid integration tools and Prescient.
For a given integrated energy system, the double loop workflow has six key steps: - Forecasting: Generate plausible price forcasts for the bidding horizon (chosen to be 48 hours). - Bidding: Formulate and solve a multi-period bidding problem for the generated set of forcasted price signals. The solution of the bidding problem yields a time-varying bid curve. - Day Ahead (DA) Market: Using the bid curve generated in the previous step, solve the unit commitment problem for the day ahead market. - Real Time Market: Fix unit commitment decisions and solve the unit commitment problem for the real time market. The solution yields real time local marginal prices and the optimal dispatch profile for each generator. - Tracking: Formulate and solve a tracking problem to track the optimal dispatch profile obtained in the previous step, and minimize the cost of production of electricity by minimizing the penalty associated with under-/over-production. - Settlement: Compute all the cash flows
First, we import the required python packages, grid integration tools from IDAES, Prescient, and MultiPeriodNuclear class (defined in nuclear_flowsheet_multiperiod_class.py file).
The MultiPeriodNuclear class generates a multi-period model of the base-load nuclear power plant integrated with a PEM electrolyzer and a hydrogen storage tank. The details related to the flowsheet model can be found in nuclear_flowsheet_fixed_design.py.
[1]:
# Import general python packages
from types import ModuleType
from importlib import resources
import pathlib
import sys
import pandas as pd
import matplotlib.pyplot as plt
# Imports from the IDAES package
from idaes.apps.grid_integration import Tracker
from idaes.apps.grid_integration import Bidder
from idaes.apps.grid_integration import PlaceHolderForecaster
from idaes.apps.grid_integration import DoubleLoopCoordinator
# from idaes.apps.grid_integration.model_data import GeneratorModelData
from idaes.core.solvers import get_solver
from idaes.apps.grid_integration.model_data import (
GeneratorModelData as _UpstreamGeneratorModelData,
RealValueValidator,
AtLeastPminValidator
)
# Import Prescient and the RTS-GMLC dataset
from prescient.simulator import Prescient
from dispatches_sample_data import rts_gmlc
# Import nuclear flowsheet
from nuclear_flowsheet_multiperiod_class import MultiPeriodNuclear
Interactive Python mode detected; using default matplotlib backend for plotting.
Next, we define a dictionary containing the generator data, and construct the model_data object using it.
gen_name: The id of the generator in the RTS - GMLC that is being replaced by the integrated energy system. There is only one nuclear generator (121_NUCLEAR_1) in the RTS - GMLC dataset, sogen_name=121_NUCLEAR_1generator_type: Accepts eitherthermalorrenewable. We choosethermalfor both fossil and nuclear generatorsp_min: Minimum power output to the grid (in MW). The capacity of the nuclear power plant is 500 MW and that of the PEM electrolyzer is 100 MW. Nuclear power plant is always operated at it base-load, so the minimum power output to the grid = 500 \(-\) 100 = 400 MWp_max: Maximum power output to the grid (in MW). Power output is maximum when the PEM electrolyzer is turned off, and it is equal to base-load power output from the nuclear power plant i.e., 500 MWmin_down_time: Mininum downtime after the generator is shutdown (chosen to be 48 hours)min_up_time: Minimum uptime after the generator is turned on (chosen to be 24 hours)ramp_up_60min: Ramp up rate (in MW/hr). Since the PEM electrolyzer is amenable for fast ramp up/ramp down, and for fast startup/shutdown, the ramp rate for the power output to the grid is the same as the capacity of the PEM electrolyzer i.e., 100 MW/hrramp_down_60min: Ramp down rate (in MW/hr). Same as above.shutdown_capacity: Power output when shutdown is initiated (in MW). Since the nuclear power plant is always operated at base-load, the shutdown capacity is the same as the base-load value i.e., 500 MWstartup_capacity: Power output when the generator is turned on. Same as above.production_cost_bid_pairs: Cost of production of electricity in $/MW as function of power output i.e., (power output in MW, cost in $/MW)startup_cost_pairs: (# hours after shutdown, cost of startup)fixed_commitment: 0/1 indicates that plant shutdown is allowed/not allowed.
[2]:
class GeneratorModelData(_UpstreamGeneratorModelData):
p_min_agc = RealValueValidator(min_val=0)
p_max_agc = AtLeastPminValidator()
def __init__(self, **kwargs):
super().__init__(**kwargs)
self.p_min_agc = self.p_min
self.p_max_agc = self.p_max
[3]:
generator_data = {
"gen_name": "121_NUCLEAR_1",
"generator_type": "thermal",
"p_min": 400,
"p_max": 500,
"min_down_time": 48,
"min_up_time": 24,
"ramp_up_60min": 100,
"ramp_down_60min": 100,
"shutdown_capacity": 500,
"startup_capacity": 500,
"production_cost_bid_pairs": [
(400, 15),
(450, 17.5),
(500, 20),
],
"startup_cost_pairs": [(48, 7355.42)],
"fixed_commitment": 1
}
model_data = GeneratorModelData(**generator_data)
Next, we set the parameters needed for the double loop workflow
n_scenario: Number of scenarios to be considered for the bidding problem. The fileidaes.apps.grid_integration.examples.lmp_forecasts_concat.csvhas data for ten scenarios, so we can choose any number between 1 and 10.bidding_horizon: Length of the bidding horizon. We choose it to be 48 hours.tracking_horizon: Length of the tracking horizon. We choose it to be 12 hours.n_tracking_hour: Frequency at which the tracking problem needs to be solved (every hour)num_days: Simulation horizon (number of days)
[4]:
n_scenario = 3 # for bidding
bidding_horizon = 48 # hours
tracking_horizon = 12 # hours
n_tracking_hour = 1 # advance n_tracking_hour
num_days = 3
Import the forcast price data and create a solver objecct
[5]:
# Import the forcasted price data
with resources.open_text("idaes.apps.grid_integration.examples", "lmp_forecasts_concat.csv") as f:
forecasts_df = pd.read_csv(f)
forecaster = PlaceHolderForecaster(price_forecasts_df=forecasts_df)
# Create the solver object
solver = get_solver()
Create bidder, tracker and coordinator objects using the IDAES grid integration tools Bidder, Tracker and DoubleLoopCoordinator
[6]:
# Setup trackers, bidder, and coordinator
#################################################################################
# Tracker
mp_nuclear_tracker = MultiPeriodNuclear(
horizon=tracking_horizon,
model_data=model_data
)
nuclear_tracker = Tracker(
tracking_model_object=mp_nuclear_tracker,
n_tracking_hour=n_tracking_hour,
solver=solver,
)
# Projection Tracker
mp_nuclear_projection_tracker = MultiPeriodNuclear(
horizon=tracking_horizon,
model_data=model_data
)
nuclear_projection_tracker = Tracker(
tracking_model_object=mp_nuclear_projection_tracker,
n_tracking_hour=n_tracking_hour,
solver=solver,
)
# Bidder
mp_nuclear_bidder = MultiPeriodNuclear(
horizon=bidding_horizon,
model_data=model_data
)
nuclear_bidder = Bidder(
bidding_model_object=mp_nuclear_bidder,
n_scenario=n_scenario,
solver=solver,
forecaster=forecaster,
)
# Coordinator
coordinator = DoubleLoopCoordinator(
bidder=nuclear_bidder,
tracker=nuclear_tracker,
projection_tracker=nuclear_projection_tracker,
)
2022-06-29 10:50:13 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:14 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:14 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:15 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:16 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:16 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:17 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:18 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:18 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:19 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:20 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:20 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:21 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:22 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:23 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:24 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:24 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:25 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:26 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:26 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:27 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:28 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:28 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:29 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:29 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:30 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:31 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:31 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:32 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:33 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:33 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:34 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:35 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:35 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:36 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:36 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:37 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:38 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:38 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:39 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:40 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:40 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:41 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:41 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:42 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:42 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:43 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:44 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:44 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:45 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:46 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:46 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:47 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:47 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:48 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:49 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:49 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:50 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:51 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:51 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:52 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:53 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:53 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:54 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:55 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:55 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:56 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:57 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:57 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:58 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:58 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:50:59 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:00 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:00 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:01 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:02 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:02 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:03 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:04 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:04 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:05 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:06 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:06 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:07 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:08 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:08 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:09 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:09 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:10 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:11 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:11 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:12 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:13 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:13 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:14 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:14 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:15 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:16 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:16 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:17 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:18 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:18 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:19 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:20 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:20 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:21 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:21 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:22 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:23 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:24 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:24 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:25 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:26 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:26 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:27 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:28 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:28 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:29 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:30 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:30 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:31 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:32 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:33 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:33 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:34 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:35 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:35 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:36 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:37 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:37 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:38 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:39 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:40 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:41 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:41 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:42 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:43 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:44 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:44 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:45 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:46 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:46 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:47 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:48 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:48 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:49 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:50 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:50 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:51 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:52 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:52 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:53 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:54 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:55 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:55 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:56 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:57 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:57 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:58 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:51:59 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:52:00 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:52:00 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:52:01 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:52:02 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:52:02 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:52:03 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:52:04 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
2022-06-29 10:52:04 [INFO] idaes.init.fs.pem.outlet_state: Property package initialization: optimal - Optimal Solution Found.
Create a plugin for the double loop simulation
[7]:
# Create a class to create the plugin
class PrescientPluginModule(ModuleType):
def __init__(self, get_configuration, register_plugins):
self.get_configuration = get_configuration
self.register_plugins = register_plugins
plugin_module = PrescientPluginModule(
get_configuration=coordinator.get_configuration,
register_plugins=coordinator.register_plugins,
)
Set Prescient options and run double loop simulation
IMPORTANT Before proceeding with the rest of the notebook:
Install the
dispatches-sample-datapackage by runningpip install dispatches-sample-datain the terminal
OR
Download the RTS-GMLC dataset from this repository (or directly as a zipfile here) to your local machine
Update the value of the
rst_gmlc_data_dirvariable in the cell below to the appropriate location of theRTS_Data/SourceDatasubfolder on your local machine.
[8]:
# Folder containing the RTS - GMLC data
rts_gmlc_data_dir = str(rts_gmlc.source_data_path)
# Set Prescient options
options = {
"data_path": rts_gmlc_data_dir,
"input_format": "rts-gmlc",
"simulate_out_of_sample": True,
"run_sced_with_persistent_forecast_errors": True,
"output_directory": "bidding_multiperiod_nulcear",
"start_date": "2020-07-10",
"num_days": num_days,
"sced_horizon": tracking_horizon,
"ruc_horizon": bidding_horizon,
"compute_market_settlements": True,
"day_ahead_pricing": "LMP",
"ruc_mipgap": 0.01,
"symbolic_solver_labels": True,
"reserve_factor": 0.0,
"deterministic_ruc_solver": "gurobi",
"output_ruc_solutions": True,
"sced_solver": "gurobi",
"print_sced": True,
"enforce_sced_shutdown_ramprate": True,
"plugin": {
"doubleloop": {
"module": plugin_module,
"bidding_generator": "121_NUCLEAR_1",
}
},
}
# Run Prescient
Prescient().simulate(**options)
Initializing simulation...
Did not find reserves.csv; assuming no reserves
c:\Users\Radhakrishna\Anaconda3\lib\site-packages\pandas\io\parsers.py:3339: FutureWarning:
Use pd.to_datetime instead.
return generic_parser(date_parser, *date_cols)
Setting default t0 state in RTS-GMLC parser
Dates to simulate: 2020-07-10 to 2020-07-12
RUC activation hours: 0
Final RUC date: 2020-07-12
Using current day's forecasts for RUC solves
Using persistent forecast error model when projecting demand and renewables in SCED
Extracting scenario to simulate
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 6903
Number of nonzeros in inequality constraint Jacobian.: 536
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 4317
variables with only lower bounds: 864
variables with lower and upper bounds: 3309
variables with only upper bounds: 144
Total number of equality constraints.................: 4029
Total number of inequality constraints...............: 288
inequality constraints with only lower bounds: 288
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -1.3859730e+06 2.24e+05 3.41e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.6123076e+06 2.24e+03 5.20e+01 -1.0 2.24e+05 - 1.83e-02 9.90e-01f 1
2 -1.6135259e+06 1.92e+03 4.45e+01 -1.0 2.24e+03 - 1.08e-01 1.43e-01f 1
3 -1.6223937e+06 1.90e+01 6.61e+02 -1.0 1.92e+03 - 4.24e-01 9.90e-01f 1
4 -1.6348273e+06 5.82e-11 1.05e+05 -1.0 3.17e+03 - 9.61e-02 1.00e+00f 1
5 -1.6493558e+06 6.55e-11 3.27e+06 -1.0 3.47e+03 - 6.73e-01 1.00e+00f 1
6 -1.7019474e+06 1.16e-10 2.89e+06 -1.0 1.13e+04 - 1.15e-01 1.00e+00f 1
7 -1.7692682e+06 1.16e-10 1.75e+06 -1.0 1.43e+04 - 3.95e-01 1.00e+00f 1
8 -1.8466290e+06 1.75e-10 6.99e+05 -1.0 2.30e+04 - 6.00e-01 6.49e-01f 1
9 -1.8491837e+06 1.16e-10 3.16e+05 -1.0 3.90e+04 - 5.48e-01 1.11e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -1.8764891e+06 2.33e-10 1.85e+05 -1.0 6.38e+04 - 4.16e-01 9.28e-02f 1
11 -1.9114621e+06 2.33e-10 1.01e+05 -1.0 8.54e+04 - 4.51e-01 1.33e-01f 1
12 -1.9327902e+06 2.33e-10 7.40e+04 -1.0 1.05e+05 - 2.69e-01 1.08e-01f 1
13 -1.9474872e+06 2.33e-10 7.19e+04 -1.0 1.09e+05 - 2.85e-02 1.16e-01f 1
14 -1.9516492e+06 3.49e-10 7.11e+04 -1.0 1.01e+05 - 1.12e-02 6.08e-02f 1
15 -1.9530126e+06 2.33e-10 7.05e+04 -1.0 2.12e+05 - 8.29e-03 3.21e-02f 1
16 -1.9542968e+06 2.33e-10 6.67e+04 -1.0 1.50e+05 - 5.36e-02 4.24e-02f 1
17 -1.9551033e+06 3.49e-10 6.09e+04 -1.0 1.76e+05 - 8.74e-02 5.60e-02f 1
18 -1.9556961e+06 3.49e-10 5.69e+04 -1.0 1.98e+05 - 6.59e-02 7.76e-02f 1
19 -1.9561336e+06 2.33e-10 5.63e+04 -1.0 2.17e+05 - 9.86e-03 7.48e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 -1.9562155e+06 3.49e-10 5.21e+04 -1.0 2.20e+05 - 7.56e-02 2.22e-02f 1
21 -1.9563980e+06 3.49e-10 4.56e+04 -1.0 2.39e+05 - 1.25e-01 6.19e-02f 1
22 -1.9565528e+06 4.66e-10 4.40e+04 -1.0 2.69e+05 - 3.47e-02 6.78e-02f 1
23 -1.9572926e+06 2.33e-10 4.15e+04 -1.0 2.70e+05 - 5.59e-02 3.30e-01f 1
24 -1.9583173e+06 2.33e-10 3.76e+04 -1.0 2.04e+05 - 9.38e-02 4.72e-01f 1
25 -1.9588767e+06 2.33e-10 3.53e+04 -1.0 1.62e+05 - 6.18e-02 3.20e-01f 1
26 -1.9595936e+06 2.33e-10 2.99e+04 -1.0 1.57e+05 - 1.53e-01 4.18e-01f 1
27 -1.9603247e+06 2.33e-10 2.22e+04 -1.0 1.86e+05 - 2.58e-01 4.76e-01f 1
28 -1.9609164e+06 2.33e-10 2.12e+04 -1.0 2.37e+05 - 4.66e-02 4.54e-01f 1
29 -1.9611095e+06 2.33e-10 1.89e+04 -1.0 2.10e+05 - 1.08e-01 2.09e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -1.9619544e+06 2.33e-10 1.83e+04 -1.0 5.05e+05 - 3.13e-02 3.60e-01f 1
31 -1.9623736e+06 2.33e-10 1.44e+04 -1.0 4.00e+05 - 2.12e-01 2.19e-01f 1
32 -1.9626521e+06 2.33e-10 1.29e+04 -1.0 2.38e+05 - 1.07e-01 2.73e-01f 1
33 -1.9627399e+06 2.33e-10 1.26e+04 -1.0 4.07e+05 - 2.38e-02 3.78e-02f 1
34 -1.9631712e+06 2.33e-10 1.22e+04 -1.0 4.91e+05 - 3.18e-02 1.39e-01f 1
35 -1.9633127e+06 2.33e-10 1.18e+04 -1.0 9.72e+05 - 3.48e-02 2.25e-02f 1
36 -1.9635669e+06 2.33e-10 1.05e+04 -1.0 5.30e+05 - 1.03e-01 7.83e-02f 1
37 -1.9648518e+06 3.49e-10 1.02e+04 -1.0 4.91e+05 - 3.08e-02 2.95e-01f 1
38 -1.9655376e+06 2.33e-10 9.75e+03 -1.0 4.59e+05 - 4.64e-02 2.04e-01f 1
39 -1.9664644e+06 2.33e-10 8.87e+03 -1.0 3.40e+05 - 8.98e-02 2.55e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -1.9677810e+06 2.33e-10 8.58e+03 -1.0 5.23e+05 - 3.35e-02 2.77e-01f 1
41 -1.9684681e+06 2.33e-10 8.07e+03 -1.0 1.13e+06 - 5.94e-02 9.33e-02f 1
42 -1.9684933e+06 3.49e-10 7.52e+03 -1.0 6.92e+05 - 6.79e-02 3.66e-03f 1
43 -1.9687015e+06 3.49e-10 7.45e+03 -1.0 7.40e+05 - 8.95e-03 3.09e-02f 1
44 -1.9699982e+06 3.49e-10 6.60e+03 -1.0 7.24e+05 - 1.14e-01 2.27e-01f 1
45 -1.9704242e+06 2.33e-10 6.26e+03 -1.0 7.17e+05 - 5.09e-02 1.13e-01f 1
46 -1.9706546e+06 2.33e-10 6.05e+03 -1.0 7.74e+05 - 3.37e-02 5.04e-02f 1
47 -1.9706934e+06 3.49e-10 5.68e+03 -1.0 6.18e+05 - 6.13e-02 1.12e-02f 1
48 -1.9709649e+06 3.49e-10 5.66e+03 -1.0 7.13e+05 - 3.42e-03 4.14e-02f 1
49 -1.9716946e+06 2.33e-10 5.48e+03 -1.0 6.59e+05 - 3.17e-02 1.15e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
50 -1.9719232e+06 3.49e-10 5.12e+03 -1.0 8.36e+05 - 6.72e-02 3.37e-02f 1
51 -1.9727345e+06 3.49e-10 5.06e+03 -1.0 8.38e+05 - 1.01e-02 1.22e-01f 1
52 -1.9730047e+06 3.49e-10 4.53e+03 -1.0 4.35e+05 - 1.05e-01 6.75e-02f 1
53 -1.9740668e+06 3.49e-10 4.25e+03 -1.0 6.61e+05 - 6.25e-02 2.33e-01f 1
54 -1.9751838e+06 2.33e-10 3.97e+03 -1.0 7.88e+05 - 6.53e-02 2.03e-01f 1
55 -1.9766411e+06 2.33e-10 3.66e+03 -1.0 8.27e+05 - 7.73e-02 2.15e-01f 1
56 -1.9767909e+06 2.33e-10 3.45e+03 -1.0 1.11e+06 - 5.73e-02 2.15e-02f 1
57 -1.9771673e+06 3.49e-10 3.25e+03 -1.0 1.12e+06 - 5.80e-02 5.03e-02f 1
58 -1.9776393e+06 4.66e-10 3.16e+03 -1.0 8.65e+05 - 2.75e-02 5.98e-02f 1
59 -1.9781238e+06 4.66e-10 3.03e+03 -1.0 9.90e+05 - 4.24e-02 5.91e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
60 -1.9786687e+06 4.66e-10 2.92e+03 -1.0 1.03e+06 - 3.52e-02 6.48e-02f 1
61 -1.9792931e+06 4.66e-10 2.82e+03 -1.0 1.37e+06 - 3.53e-02 6.88e-02f 1
62 -1.9793667e+06 3.49e-10 2.53e+03 -1.0 1.29e+06 - 1.01e-01 9.42e-03f 1
63 -1.9796065e+06 3.49e-10 9.73e+03 -1.7 9.89e+05 - 3.48e-02 3.63e-02f 1
64 -1.9798527e+06 4.66e-10 2.04e+05 -1.7 9.65e+05 - 7.27e-02 4.51e-02f 1
65 -1.9801783e+06 4.66e-10 7.08e+04 -1.7 9.43e+05 - 4.66e-02 6.34e-02f 1
66 -1.9817414e+06 3.49e-10 1.74e+06 -1.7 1.23e+06 - 4.17e-03 2.67e-01f 1
67 -1.9817941e+06 3.49e-10 1.40e+06 -1.7 1.35e+06 - 5.86e-02 1.13e-02f 1
68 -1.9820394e+06 3.49e-10 1.43e+06 -1.7 1.58e+06 - 3.28e-02 4.69e-02f 1
69 -1.9825005e+06 3.49e-10 1.66e+06 -1.7 1.60e+06 - 3.17e-02 8.93e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
70 -1.9825646e+06 4.66e-10 1.32e+06 -1.7 1.41e+06 - 6.58e-02 1.31e-02f 1
71 -1.9826569e+06 3.49e-10 1.10e+06 -1.7 1.22e+06 - 5.53e-02 2.13e-02f 1
72 -1.9829488e+06 3.49e-10 1.26e+06 -1.7 1.20e+06 - 2.98e-02 7.59e-02f 1
73 -1.9834577e+06 4.66e-10 1.37e+06 -1.7 1.35e+06 - 8.36e-02 1.39e-01f 1
74 -1.9839376e+06 3.49e-10 1.65e+06 -1.7 1.45e+06 - 3.40e-02 1.31e-01f 1
75 -1.9846501e+06 3.49e-10 2.02e+06 -1.7 1.45e+06 - 2.50e-02 1.68e-01f 1
76 -1.9847461e+06 4.66e-10 1.82e+06 -1.7 1.21e+06 - 6.01e-02 2.95e-02f 1
77 -1.9848199e+06 4.66e-10 1.81e+06 -1.7 1.45e+06 - 1.28e-02 1.79e-02f 1
78 -1.9850346e+06 3.49e-10 1.82e+06 -1.7 1.41e+06 - 2.51e-02 4.87e-02f 1
79 -1.9850548e+06 4.66e-10 1.55e+06 -1.7 1.31e+06 - 7.08e-02 6.34e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
80 -1.9853242e+06 4.66e-10 1.65e+06 -1.7 1.40e+06 - 1.43e-02 6.81e-02f 1
81 -1.9853499e+06 4.66e-10 1.56e+06 -1.7 1.41e+06 - 2.72e-02 6.70e-03f 1
82 -1.9856389e+06 4.66e-10 1.64e+06 -1.7 1.50e+06 - 1.11e-02 6.20e-02f 1
83 -1.9856972e+06 4.66e-10 1.53e+06 -1.7 1.13e+06 - 4.03e-02 1.45e-02f 1
84 -1.9858929e+06 4.66e-10 1.47e+06 -1.7 1.37e+06 - 4.20e-02 4.62e-02f 1
85 -1.9864579e+06 4.66e-10 1.61e+06 -1.7 1.29e+06 - 3.39e-02 1.39e-01f 1
86 -1.9865432e+06 4.66e-10 1.56e+06 -1.7 1.08e+06 - 2.72e-02 2.08e-02f 1
87 -1.9873139e+06 3.49e-10 1.62e+06 -1.7 1.03e+06 - 7.36e-02 1.93e-01f 1
88 -1.9873374e+06 4.66e-10 1.56e+06 -1.7 9.69e+05 - 2.51e-02 8.01e-03f 1
89 -1.9876398e+06 5.82e-10 1.66e+06 -1.7 1.21e+06 - 6.66e-03 9.71e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
90 -1.9876912e+06 6.98e-10 1.38e+06 -1.7 1.27e+06 - 1.06e-01 1.69e-02f 1
91 -1.9881461e+06 5.82e-10 1.49e+06 -1.7 1.28e+06 - 5.78e-03 1.14e-01f 1
92 -1.9881746e+06 6.98e-10 1.30e+06 -1.7 1.21e+06 - 8.21e-02 7.58e-03f 1
93 -1.9887864e+06 6.98e-10 1.40e+06 -1.7 1.23e+06 - 1.19e-02 1.41e-01f 1
94 -1.9888117e+06 6.98e-10 1.25e+06 -1.7 1.48e+06 - 7.22e-02 6.80e-03f 1
95 -1.9896308e+06 5.82e-10 1.39e+06 -1.7 1.46e+06 - 2.59e-03 1.76e-01f 1
96 -1.9897046e+06 5.82e-10 1.19e+06 -1.7 1.17e+06 - 9.98e-02 1.68e-02f 1
97 -1.9901921e+06 5.82e-10 1.25e+06 -1.7 1.24e+06 - 1.18e-02 1.17e-01f 1
98 -1.9902937e+06 5.82e-10 1.18e+06 -1.7 1.43e+06 - 4.24e-02 2.62e-02f 1
99 -1.9903472e+06 6.98e-10 1.18e+06 -1.7 1.09e+06 - 6.04e-03 1.53e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
100 -1.9905525e+06 5.82e-10 1.16e+06 -1.7 9.92e+05 - 2.96e-02 5.95e-02f 1
101 -1.9907384e+06 6.98e-10 1.04e+06 -1.7 9.80e+05 - 8.85e-02 5.51e-02f 1
102 -1.9909276e+06 8.15e-10 9.95e+05 -1.7 1.10e+06 - 5.04e-02 5.78e-02f 1
103 -1.9912818e+06 9.31e-10 1.03e+06 -1.7 1.14e+06 - 4.69e-03 9.79e-02f 1
104 -1.9913043e+06 6.98e-10 9.55e+05 -1.7 1.10e+06 - 5.57e-02 7.85e-03f 1
105 -1.9915866e+06 8.15e-10 8.45e+05 -1.7 1.25e+06 - 1.10e-01 9.95e-02f 1
106 -1.9919127e+06 9.31e-10 8.79e+05 -1.7 1.15e+06 - 4.06e-03 1.05e-01f 1
107 -1.9923711e+06 9.31e-10 8.53e+05 -1.7 1.05e+06 - 6.33e-02 1.52e-01f 1
108 -1.9923864e+06 9.31e-10 8.02e+05 -1.7 1.09e+06 - 4.62e-02 6.40e-03f 1
109 -1.9927289e+06 9.31e-10 8.19e+05 -1.7 1.20e+06 - 2.10e-02 1.43e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
110 -1.9928702e+06 9.31e-10 7.77e+05 -1.7 1.32e+06 - 5.74e-02 7.93e-02f 1
111 -1.9930664e+06 9.31e-10 7.60e+05 -1.7 1.43e+06 - 4.56e-02 1.28e-01f 1
112 -1.9932672e+06 9.31e-10 5.68e+05 -1.7 1.33e+06 - 2.29e-01 1.35e-01f 1
113 -1.9934609e+06 8.15e-10 5.90e+05 -1.7 1.25e+06 - 4.72e-03 1.54e-01f 1
114 -1.9935735e+06 8.15e-10 5.53e+05 -1.7 9.90e+05 - 6.90e-02 9.30e-02f 1
115 -1.9937192e+06 8.15e-10 5.41e+05 -1.7 8.61e+05 - 4.28e-02 1.34e-01f 1
116 -1.9939084e+06 8.15e-10 3.72e+05 -1.7 7.55e+05 - 2.95e-01 2.16e-01f 1
117 -1.9939510e+06 9.31e-10 3.49e+05 -1.7 4.75e+05 - 6.78e-02 8.97e-02f 1
118 -1.9940186e+06 1.16e-09 3.45e+05 -1.7 4.22e+05 - 3.82e-02 1.58e-01f 1
119 -1.9941290e+06 5.82e-10 2.71e+05 -1.7 3.69e+05 - 2.33e-01 3.38e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
120 -1.9941315e+06 6.98e-10 1.89e+05 -1.7 1.75e+05 - 2.64e-01 1.93e-02f 1
121 -1.9941985e+06 4.66e-10 2.08e+05 -1.7 1.88e+05 - 6.71e-03 4.86e-01f 1
122 -1.9942431e+06 4.66e-10 1.80e+05 -1.7 2.08e+05 - 1.74e-01 5.52e-01f 1
123 -1.9942685e+06 4.66e-10 1.37e+05 -1.7 3.82e+05 - 2.56e-01 5.09e-01f 1
124 -1.9942932e+06 4.66e-10 1.04e+05 -1.7 9.62e+05 - 2.47e-01 4.57e-01f 1
125 -1.9942992e+06 5.82e-10 3.61e+04 -1.7 3.03e+05 - 6.45e-01 3.38e-01f 1
126 -1.9943002e+06 3.49e-10 2.91e+02 -1.7 1.06e+04 - 1.00e+00 8.33e-01f 1
127 -1.9943001e+06 3.49e-10 3.17e+00 -1.7 1.80e+03 - 9.81e-02 1.00e+00f 1
128 -1.9943114e+06 4.66e-10 1.01e+05 -3.8 6.48e+03 - 8.42e-01 8.93e-01f 1
129 -1.9943128e+06 3.49e-10 1.51e-09 -3.8 7.59e+02 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
130 -1.9943129e+06 4.66e-10 1.35e+02 -5.7 4.87e+01 - 1.00e+00 9.91e-01f 1
131 -1.9943129e+06 3.49e-10 1.84e-11 -5.7 4.17e-01 - 1.00e+00 1.00e+00f 1
132 -1.9943129e+06 4.66e-10 1.31e+01 -7.0 5.59e-01 - 1.00e+00 9.25e-01f 1
133 -1.9943129e+06 3.49e-10 9.09e-13 -7.0 2.83e-02 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 133
(scaled) (unscaled)
Objective...............: -1.9943128662363144e+06 -1.9943128662363144e+06
Dual infeasibility......: 9.0949470177292824e-13 9.0949470177292824e-13
Constraint violation....: 5.8207660913467407e-11 3.4924596548080444e-10
Complementarity.........: 5.0927662373384102e-07 5.0927662373384102e-07
Overall NLP error.......: 5.0927662373384102e-07 5.0927662373384102e-07
Number of objective function evaluations = 134
Number of objective gradient evaluations = 134
Number of equality constraint evaluations = 134
Number of inequality constraint evaluations = 134
Number of equality constraint Jacobian evaluations = 134
Number of inequality constraint Jacobian evaluations = 134
Number of Lagrangian Hessian evaluations = 133
Total CPU secs in IPOPT (w/o function evaluations) = 1.883
Total CPU secs in NLP function evaluations = 0.079
EXIT: Optimal Solution Found.
Calculating PTDF Matrix Factorization
Pyomo model construction time: 9.88
Pyomo model solve time: 27.289525508880615
Deterministic RUC Cost: 4145186.78
Generator Commitments:
101_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
101_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
101_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
101_STEAM_4 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
102_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
102_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
102_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
102_STEAM_4 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
107_CC_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
113_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
113_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
113_CT_3 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
113_CT_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
115_STEAM_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
115_STEAM_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
115_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
116_STEAM_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
118_CC_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
123_STEAM_2 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
123_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
123_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
123_CT_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
123_CT_5 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
201_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
201_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
201_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
202_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
202_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
202_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
202_STEAM_4 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
207_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
207_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
213_CC_3 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
213_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
213_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
215_CT_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
215_CT_5 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
216_STEAM_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
218_CC_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
221_CC_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
223_STEAM_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
223_STEAM_2 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
223_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
223_CT_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
223_CT_5 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
223_CT_6 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
301_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
301_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
301_CT_3 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
301_CT_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
302_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
302_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
302_CT_3 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
302_CT_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
307_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
307_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
313_CC_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
315_STEAM_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_STEAM_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_STEAM_3 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_STEAM_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_STEAM_5 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_CT_6 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_CT_7 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_CT_8 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
316_STEAM_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
318_CC_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
321_CC_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
322_CT_5 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
322_CT_6 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
323_CC_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
323_CC_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
114_SYNC_COND_1: 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
121_NUCLEAR_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
214_SYNC_COND_1: 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
314_SYNC_COND_1: 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
Generator Dispatch Levels:
101_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
101_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 8.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
101_STEAM_3 : 76.00 76.00 66.00 76.00 76.00 73.33 66.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 | 76.00 76.00 76.00 76.00 76.00 76.00 60.70 60.70 45.30 76.00 76.00 76.00
101_STEAM_4 : 76.00 76.00 73.67 76.00 76.00 67.33 67.67 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 | 76.00 76.00 76.00 76.00 76.00 76.00 60.70 49.30 47.70 76.00 76.00 76.00
102_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
102_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
102_STEAM_3 : 45.30 45.30 40.00 45.30 45.30 40.00 40.00 45.30 45.30 60.70 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 | 76.00 60.70 60.70 60.70 45.30 45.30 40.00 40.00 40.00 45.30 45.30 60.70
102_STEAM_4 : 45.30 45.30 40.00 45.30 45.30 40.00 40.00 45.30 45.30 60.70 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 | 76.00 60.70 60.70 60.70 45.30 45.30 40.00 39.97 34.97 45.30 45.30 60.70
107_CC_1 : 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 231.70 231.70 312.55 293.30 293.30 293.30 328.29 355.00 355.00 355.00 293.30 231.70 231.70 | 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00
113_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
115_STEAM_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
115_STEAM_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
115_STEAM_3 : 93.00 62.00 62.00 62.00 62.00 62.00 62.00 62.00 70.03 93.00 124.00 124.00 124.00 125.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 124.00 124.00 | 124.00 123.66 93.00 93.00 93.00 62.00 62.00 62.00 62.00 62.00 62.00 93.00
116_STEAM_1 : 93.00 62.00 62.00 93.00 62.00 62.00 62.00 76.43 93.00 124.00 124.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 124.00 | 124.00 124.00 103.09 93.00 93.00 62.00 62.00 62.00 62.00 62.00 93.00 93.00
118_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 170.00 231.70 231.70 293.30 293.30 299.07 293.30 293.30 231.70 231.70 | 231.70 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00
123_STEAM_2 : 93.00 62.00 62.00 93.00 67.34 62.00 62.00 93.00 93.00 93.00 124.00 124.00 124.00 124.00 124.00 124.00 124.00 124.00 124.00 124.00 124.00 124.00 124.00 124.00 | 124.00 93.00 93.00 93.00 93.00 62.00 62.00 62.00 62.00 62.00 93.00 93.00
123_STEAM_3 : 210.00 140.00 140.00 140.00 140.00 140.00 140.00 140.00 210.00 262.51 280.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 335.15 | 280.00 280.00 210.00 210.00 210.00 140.00 140.00 140.00 140.00 140.00 140.00 210.00
123_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
123_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
123_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
201_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
201_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
201_STEAM_3 : 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 45.30 60.70 71.70 60.70 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 45.30 | 45.30 45.30 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00
202_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 8.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
202_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 8.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
202_STEAM_3 : 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 60.70 60.70 60.70 60.70 60.70 60.70 60.70 61.31 66.78 69.28 76.00 72.78 76.00 60.70 60.70 | 60.70 60.70 60.70 45.30 30.00 30.00 30.00 30.00 30.00 30.00 30.00 43.09
202_STEAM_4 : 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 60.70 60.70 60.70 60.70 60.70 60.70 60.70 60.70 60.70 60.70 76.00 60.70 61.28 60.70 60.70 | 60.70 60.70 60.70 45.30 30.00 30.00 30.00 30.00 30.00 30.00 30.00 45.30
207_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
207_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
213_CC_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
213_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
213_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
215_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
215_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
216_STEAM_1 : 93.00 93.00 77.00 93.00 93.00 77.00 77.00 93.00 93.00 93.00 124.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 124.00 | 124.00 124.00 93.00 93.00 93.00 93.00 68.97 62.00 62.00 69.61 93.00 93.00
218_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
221_CC_1 : 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 185.94 231.70 231.70 293.30 293.30 293.30 293.30 293.30 293.30 293.30 293.30 293.30 293.30 231.70 | 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00
223_STEAM_1 : 155.00 62.00 62.00 124.00 93.00 62.00 62.00 93.00 124.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 | 155.00 155.00 155.00 155.00 133.64 83.73 62.00 62.00 62.00 62.00 104.94 155.00
223_STEAM_2 : 148.36 62.00 62.00 109.89 93.00 62.00 62.00 93.00 124.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 | 155.00 155.00 155.00 155.00 155.00 75.70 62.00 62.00 62.00 62.00 93.00 155.00
223_STEAM_3 : 210.00 179.66 145.67 210.00 210.00 152.67 152.67 210.00 210.00 210.00 280.00 294.27 350.00 347.56 350.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 280.00 | 237.66 210.00 210.00 210.00 210.00 210.00 140.00 140.00 140.00 140.00 210.00 210.00
223_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
223_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
223_CT_6 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
307_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
307_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
313_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 170.00 293.30 293.30 293.30 293.30 293.30 293.30 293.30 231.70 231.70 | 231.70 231.70 231.70 231.70 231.70 231.70 231.70 231.70 231.70 231.70 231.70 231.70
315_STEAM_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_CT_6 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_CT_7 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_CT_8 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
316_STEAM_1 : 62.00 62.00 62.00 62.00 62.00 62.00 62.00 62.00 62.00 124.00 124.00 124.00 124.00 125.00 150.04 129.00 155.00 155.00 155.00 155.00 155.00 155.00 124.00 124.00 | 124.00 124.00 124.00 108.29 62.00 62.00 62.00 62.00 62.00 62.00 62.00 62.00
318_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
321_CC_1 : 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 231.70 231.70 231.70 293.30 293.30 293.30 293.30 293.30 293.30 293.30 293.30 293.30 293.30 231.70 | 231.70 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00
322_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
322_CT_6 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
323_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 170.00 231.70 293.30 355.00 355.00 355.00 231.70 170.00 170.00 | 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00
323_CC_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 170.00 231.70 293.30 297.05 355.00 334.75 244.13 226.62 170.00 | 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00
114_SYNC_COND_1: 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
121_NUCLEAR_1 : 400.00 400.00 441.67 450.00 450.00 441.67 441.67 450.00 500.00 500.00 450.00 403.12 450.00 500.00 400.00 400.00 450.00 500.00 500.00 450.00 450.00 450.00 450.00 450.00 | 450.00 500.00 450.00 500.00 500.00 450.00 413.41 408.33 408.33 450.00 450.00 400.00
214_SYNC_COND_1: 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
314_SYNC_COND_1: 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
Generator Reserve Headroom:
101_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
101_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
101_STEAM_3 : 0.00 0.00 10.00 0.00 0.00 2.67 10.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 15.30 15.30 30.70 0.00 0.00 0.00
101_STEAM_4 : 0.00 0.00 2.33 0.00 0.00 8.67 8.33 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 15.30 26.70 28.30 0.00 0.00 0.00
102_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
102_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
102_STEAM_3 : 30.70 30.70 36.00 30.70 30.70 36.00 36.00 30.70 30.70 15.30 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 15.30 15.30 15.30 30.70 30.70 36.00 36.00 36.00 30.70 30.70 15.30
102_STEAM_4 : 30.70 30.70 36.00 30.70 30.70 36.00 36.00 30.70 30.70 15.30 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 15.30 15.30 15.30 30.70 30.70 36.00 36.03 41.03 30.70 30.70 15.30
107_CC_1 : 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 123.30 123.30 42.45 61.70 61.70 61.70 26.71 0.00 0.00 0.00 61.70 123.30 123.30 | 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00
113_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
115_STEAM_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
115_STEAM_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
115_STEAM_3 : 62.00 93.00 93.00 93.00 93.00 93.00 93.00 93.00 84.97 62.00 31.00 31.00 31.00 30.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 31.00 31.00 | 31.00 31.34 62.00 62.00 62.00 93.00 93.00 93.00 93.00 93.00 93.00 62.00
116_STEAM_1 : 62.00 93.00 93.00 62.00 93.00 93.00 93.00 78.57 62.00 31.00 31.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 31.00 | 31.00 31.00 51.91 62.00 62.00 93.00 93.00 93.00 93.00 93.00 62.00 62.00
118_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 123.30 123.30 61.70 61.70 55.93 61.70 61.70 123.30 123.30 | 123.30 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00
123_STEAM_2 : 62.00 93.00 93.00 62.00 87.66 93.00 93.00 62.00 62.00 62.00 31.00 31.00 31.00 31.00 31.00 31.00 31.00 31.00 31.00 31.00 31.00 31.00 31.00 31.00 | 31.00 62.00 62.00 62.00 62.00 93.00 93.00 93.00 93.00 93.00 62.00 62.00
123_STEAM_3 : 140.00 210.00 210.00 210.00 210.00 210.00 210.00 210.00 140.00 87.49 70.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 14.85 | 70.00 70.00 140.00 140.00 140.00 210.00 210.00 210.00 210.00 210.00 210.00 140.00
123_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
123_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
123_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
201_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
201_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
201_STEAM_3 : 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 30.70 15.30 4.30 15.30 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 30.70 | 30.70 30.70 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00
202_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
202_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
202_STEAM_3 : 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 15.30 15.30 15.30 15.30 15.30 15.30 15.30 14.69 9.22 6.72 0.00 3.22 0.00 15.30 15.30 | 15.30 15.30 15.30 30.70 46.00 46.00 46.00 46.00 46.00 46.00 46.00 32.91
202_STEAM_4 : 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 15.30 15.30 15.30 15.30 15.30 15.30 15.30 15.30 15.30 15.30 0.00 15.30 14.72 15.30 15.30 | 15.30 15.30 15.30 30.70 46.00 46.00 46.00 46.00 46.00 46.00 46.00 30.70
207_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
207_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
213_CC_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
213_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
213_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
215_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
215_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
216_STEAM_1 : 62.00 62.00 78.00 62.00 62.00 78.00 78.00 62.00 62.00 62.00 31.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 31.00 | 31.00 31.00 62.00 62.00 62.00 62.00 86.03 93.00 93.00 85.39 62.00 62.00
218_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
221_CC_1 : 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 169.06 123.30 123.30 61.70 61.70 61.70 61.70 61.70 61.70 61.70 61.70 61.70 61.70 123.30 | 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00
223_STEAM_1 : 0.00 93.00 93.00 31.00 62.00 93.00 93.00 62.00 31.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 21.36 71.27 93.00 93.00 93.00 93.00 50.06 0.00
223_STEAM_2 : 6.64 93.00 93.00 45.11 62.00 93.00 93.00 62.00 31.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 79.30 93.00 93.00 93.00 93.00 62.00 0.00
223_STEAM_3 : 140.00 170.34 204.33 140.00 140.00 197.33 197.33 140.00 140.00 140.00 70.00 55.73 0.00 2.44 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 70.00 | 112.34 140.00 140.00 140.00 140.00 140.00 210.00 210.00 210.00 210.00 140.00 140.00
223_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
223_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
223_CT_6 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
307_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
307_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
313_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 61.70 61.70 61.70 61.70 61.70 61.70 61.70 123.30 123.30 | 123.30 123.30 123.30 123.30 123.30 123.30 123.30 123.30 123.30 123.30 123.30 123.30
315_STEAM_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_CT_6 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_CT_7 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_CT_8 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
316_STEAM_1 : 93.00 93.00 93.00 93.00 93.00 93.00 93.00 93.00 93.00 31.00 31.00 31.00 31.00 30.00 4.96 26.00 0.00 0.00 0.00 0.00 0.00 0.00 31.00 31.00 | 31.00 31.00 31.00 46.71 93.00 93.00 93.00 93.00 93.00 93.00 93.00 93.00
318_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
321_CC_1 : 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 123.30 123.30 123.30 61.70 61.70 61.70 61.70 61.70 61.70 61.70 61.70 61.70 61.70 123.30 | 123.30 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00
322_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
322_CT_6 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
323_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 123.30 61.70 0.00 0.00 0.00 123.30 185.00 185.00 | 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00
323_CC_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 123.30 61.70 57.95 0.00 20.25 110.87 128.38 185.00 | 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00
114_SYNC_COND_1: 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
121_NUCLEAR_1 : 96.00 100.00 58.33 50.00 50.00 58.33 58.33 50.00 0.00 0.00 50.00 96.88 50.00 0.00 100.00 100.00 50.00 0.00 0.00 50.00 50.00 50.00 50.00 50.00 | 50.00 0.00 50.00 0.00 0.00 50.00 86.59 91.67 91.67 50.00 50.00 100.00
214_SYNC_COND_1: 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
314_SYNC_COND_1: 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
Total : 1478.04 1854.74 1886.00 1602.51 1707.06 1878.00 1885.00 1666.97 1460.37 1137.69 883.66 661.41 547.80 305.18 351.66 557.70 727.69 452.43 357.76 322.03 366.56 638.39 980.28 1337.65 | 1558.54 1721.54 1939.41 1946.01 2075.06 2417.27 2624.52 2648.00 2670.00 2546.09 2316.76 2094.51
Fixed costs: 2844852.60
Variable costs: 1300334.19
Renewables curtailment summary (time-period, aggregate_quantity):
2020-07-10 02:00 141.61
2020-07-10 05:00 66.57
2020-07-10 06:00 9.02
2020-07-11 07:00 69.47
2020-07-11 08:00 20.07
Solving day-ahead market
Computing day-ahead prices using method LMP.
Simulating time_step 2020-07-10 00:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 1.6295791e+04 2.24e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.6194337e+04 2.24e+05 9.90e+01 -1.0 2.24e+05 - 4.50e-04 4.14e-04h 1
2 2.1095734e+04 2.23e+05 1.00e+02 -1.0 2.24e+05 - 2.82e-04 1.54e-03h 1
3 3.4715219e+04 2.23e+05 1.00e+02 -1.0 2.23e+05 - 1.44e-03 3.12e-03h 1
4 3.7406410e+05 2.07e+05 1.09e+02 -1.0 2.23e+05 - 3.59e-03 7.25e-02h 1
5 4.5104605e+05 2.03e+05 9.46e+01 -1.0 2.07e+05 - 8.18e-02 1.86e-02h 1
6 2.9494995e+06 7.68e+04 1.30e+02 -1.0 2.03e+05 - 1.03e-01 6.21e-01h 1
7 3.2498610e+06 5.96e+04 7.62e+01 -1.0 7.68e+04 - 3.74e-01 2.24e-01h 1
8 4.0482102e+06 5.96e+02 1.01e+02 -1.0 5.96e+04 - 6.05e-03 9.90e-01h 1
9 3.5941024e+06 5.74e+00 1.37e+03 -1.0 4.13e+03 - 6.26e-01 9.90e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.1741253e+06 1.16e-10 1.05e+05 -1.0 1.30e+04 - 7.19e-01 1.00e+00f 1
11 1.9173545e+06 1.16e-10 3.16e+06 -1.0 5.28e+04 - 3.82e-01 4.69e-02f 1
12 1.9114059e+06 1.75e-10 6.08e+06 -1.0 5.21e+04 - 4.87e-01 1.50e-03f 1
13 1.3820124e+06 1.16e-10 6.76e+06 -1.0 5.21e+04 - 7.00e-01 1.60e-01f 1
14 1.3721252e+06 1.16e-10 7.55e+06 -1.0 4.27e+04 - 8.99e-01 5.23e-03f 1
15 9.8069865e+05 1.16e-10 5.21e+06 -1.0 4.15e+04 - 1.17e-01 3.08e-01f 1
16 8.9878546e+05 1.16e-10 4.60e+06 -1.0 2.54e+05 - 9.00e-03 1.15e-01f 1
17 7.3898245e+05 1.16e-10 3.47e+06 -1.0 2.64e+05 - 8.32e-02 2.42e-01f 1
18 7.2211062e+05 1.16e-10 3.31e+06 -1.0 6.09e+04 - 3.47e-02 4.77e-02f 1
19 4.5490423e+05 2.33e-10 2.23e+06 -1.0 5.19e+05 - 8.16e-03 3.18e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 4.5222600e+05 2.33e-10 2.25e+06 -1.0 3.52e+05 - 3.61e-01 4.71e-03f 1
21 4.4238781e+05 2.33e-10 2.14e+06 -1.0 3.40e+04 - 2.98e-02 4.56e-02f 1
22 1.7252882e+05 1.16e-10 1.05e+06 -1.0 3.34e+05 - 7.21e-03 5.00e-01f 1
23 1.6978806e+05 2.33e-10 1.07e+06 -1.0 1.60e+05 - 6.97e-01 1.05e-02f 1
24 1.5591587e+05 2.33e-10 9.84e+05 -1.0 8.02e+04 - 1.25e-02 7.93e-02f 1
25 6.2552015e+04 1.16e-10 5.79e+05 -1.0 1.38e+05 - 1.14e-01 4.08e-01f 1
26 6.1549451e+04 1.16e-10 5.79e+05 -1.0 7.76e+04 - 4.38e-01 7.93e-03f 1
27 -3.0165854e+04 2.33e-10 2.55e+04 -1.0 7.65e+04 - 6.85e-02 9.46e-01f 1
28 -3.0544237e+04 2.33e-10 2.57e+04 -1.0 9.26e+03 - 7.42e-01 1.36e-01f 1
29 -3.2092346e+04 1.16e-10 9.51e+02 -1.0 3.49e+04 - 3.97e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -3.2421815e+04 1.16e-10 8.85e+05 -1.7 1.01e+04 - 8.88e-01 9.99e-01f 1
31 -3.2418455e+04 1.16e-10 2.88e+05 -1.7 7.13e+04 - 6.78e-01 1.00e+00f 1
32 -3.2408761e+04 1.16e-10 7.90e+04 -1.7 1.25e+05 - 7.26e-01 1.00e+00f 1
33 -3.2397125e+04 1.75e-10 2.00e-07 -1.7 1.23e+05 - 1.00e+00 1.00e+00f 1
34 -3.2487710e+04 2.33e-10 1.34e+05 -5.7 2.65e+05 - 7.37e-01 8.05e-01f 1
35 -3.2506785e+04 1.16e-10 4.11e+04 -5.7 1.51e+05 - 8.76e-01 7.28e-01f 1
36 -3.2513409e+04 1.16e-10 1.13e+04 -5.7 6.00e+04 - 7.91e-01 9.77e-01f 1
37 -3.2513513e+04 1.16e-10 1.52e+03 -5.7 1.37e+03 - 8.68e-01 8.79e-01f 1
38 -3.2513522e+04 1.16e-10 1.85e-11 -5.7 5.40e+01 - 1.00e+00 1.00e+00f 1
39 -3.2513532e+04 1.16e-10 9.38e-13 -7.0 5.26e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 39
(scaled) (unscaled)
Objective...............: -3.2513532217574715e+02 -3.2513532217574713e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.3244234505395520e-07 1.3244234505395521e-05
Overall NLP error.......: 1.3244234505395520e-07 1.3244234505395521e-05
Number of objective function evaluations = 40
Number of objective gradient evaluations = 40
Number of equality constraint evaluations = 40
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 40
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 39
Total CPU secs in IPOPT (w/o function evaluations) = 0.029
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 42614.68
Variable costs: 9629.81
Number on/offs: 56
Sum on/off ramps: 0.00
Sum nominal ramps: 515.29
Simulating time_step 2020-07-10 01:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.9763904e+04 2.91e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.9847037e+04 2.91e+05 9.90e+01 -1.0 2.70e+04 - 4.12e-04 3.82e-04h 1
2 -2.7672998e+04 2.91e+05 9.99e+01 -1.0 2.36e+04 - 3.93e-04 1.38e-03h 1
3 -1.9285647e+04 2.89e+05 1.01e+02 -1.0 7.88e+03 - 1.05e-03 3.91e-03h 1
4 -4.9468361e+03 2.88e+05 1.00e+02 -1.0 5.11e+03 - 5.88e-03 6.09e-03h 1
5 2.1497734e+04 2.85e+05 9.90e+01 -1.0 4.76e+03 - 1.12e-02 1.08e-02h 1
6 2.3335711e+04 2.84e+05 2.61e+02 -1.0 1.43e+05 - 6.58e-02 7.28e-04h 1
7 2.2022619e+05 2.63e+05 9.53e+01 -1.0 8.80e+04 - 1.70e-03 7.51e-02h 1
8 2.4305867e+05 2.61e+05 1.65e+02 -1.0 3.40e+04 - 9.44e-02 9.27e-03h 1
9 6.1292681e+05 2.22e+05 1.51e+02 -1.0 2.79e+04 - 9.25e-02 1.50e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 8.2875295e+05 1.99e+05 1.04e+02 -1.0 2.37e+04 - 2.62e-01 1.04e-01h 1
11 1.9138652e+06 7.92e+04 9.28e+01 -1.0 2.11e+04 - 3.02e-01 6.01e-01h 1
12 1.9729866e+06 7.04e+04 6.13e+01 -1.0 8.07e+03 - 2.39e-01 1.11e-01h 1
13 2.0325470e+06 5.87e+04 3.35e+01 -1.0 8.00e+03 - 3.15e-01 1.66e-01h 1
14 2.0419695e+06 5.20e+04 3.66e+01 -1.0 1.16e+04 - 2.20e-01 1.14e-01h 1
15 2.0421055e+06 5.18e+04 4.38e+01 -1.0 1.40e+04 - 3.33e-01 3.72e-03h 1
16 2.0207688e+06 4.21e+04 3.40e+01 -1.0 2.48e+04 - 4.82e-02 1.87e-01f 1
17 1.8832549e+06 2.38e+04 3.65e+01 -1.0 2.78e+04 - 4.36e-02 4.35e-01f 1
18 1.8726596e+06 2.35e+04 3.67e+01 -1.0 4.29e+04 - 5.38e-03 1.46e-02f 1
19 1.5420201e+06 1.27e+04 7.90e+01 -1.0 4.36e+04 - 5.00e-02 4.60e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.4082698e+06 1.17e+04 2.59e+02 -1.0 7.60e+04 - 1.53e-02 7.33e-02f 1
21 1.1305355e+06 1.01e+04 2.28e+02 -1.0 8.71e+04 - 7.83e-02 1.43e-01f 1
22 1.1276583e+06 1.00e+04 2.29e+02 -1.0 7.81e+04 - 3.41e-01 1.57e-03f 1
23 9.0123423e+05 8.67e+03 1.97e+02 -1.0 8.19e+04 - 3.08e-01 1.37e-01f 1
24 8.9847742e+05 8.65e+03 3.38e+02 -1.0 7.26e+04 - 8.03e-01 2.00e-03f 1
25 5.2065682e+05 6.51e+03 2.67e+02 -1.0 4.74e+05 - 2.86e-01 2.47e-01f 1
26 5.1275059e+05 6.48e+03 2.66e+02 -1.0 1.07e+06 - 4.02e-03 4.05e-03f 1
27 5.0514454e+05 6.46e+03 2.64e+02 -1.0 1.08e+06 - 1.11e-04 3.08e-03f 1
28 2.1767526e+05 5.84e+03 2.57e+02 -1.0 1.35e+06 - 1.37e-01 9.58e-02f 1
29 2.1513657e+05 5.84e+03 3.27e+02 -1.0 9.32e+05 - 1.42e-01 1.11e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 1.9560982e+05 5.72e+03 4.77e+02 -1.0 5.94e+05 - 3.34e-01 1.98e-02f 1
31 1.2298980e+05 4.83e+03 6.77e+02 -1.0 3.25e+05 - 6.97e-01 1.56e-01f 1
32 1.7921602e+04 2.48e+03 1.79e+02 -1.0 1.17e+05 - 2.05e-01 4.86e-01f 1
33 1.6557553e+04 2.44e+03 9.18e+02 -1.0 3.73e+04 - 6.49e-01 1.59e-02f 1
34 -3.0341249e+04 5.27e+01 6.13e+02 -1.0 6.16e+04 - 4.47e-01 9.78e-01f 1
35 -3.1172242e+04 2.71e+01 6.74e+03 -1.0 7.08e+04 - 3.69e-01 4.86e-01f 1
36 -3.2081135e+04 4.99e+00 3.32e+04 -1.0 7.39e+04 - 5.15e-01 8.16e-01f 1
37 -3.2067961e+04 3.74e+00 1.25e+05 -1.0 1.69e+04 - 5.23e-01 2.50e-01f 3
38 -3.2111428e+04 1.97e+00 1.37e+05 -1.0 1.69e+04 - 5.77e-01 4.74e-01f 2
39 -3.2126563e+04 9.83e-01 9.01e+04 -1.0 4.00e+04 - 3.67e-01 5.00e-01f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -3.2131400e+04 4.92e-01 2.52e+05 -1.0 6.06e+04 - 6.48e-01 5.00e-01f 2
41 -3.2126057e+04 1.16e-10 1.66e+06 -1.0 1.52e+05 - 4.06e-01 1.00e+00f 1
42 -3.2111535e+04 1.16e-10 3.54e+05 -1.0 1.86e+05 - 9.44e-01 1.00e+00f 1
43 -3.2070186e+04 1.16e-10 1.07e+05 -1.0 4.17e+05 - 6.98e-01 1.00e+00f 1
44 -3.2060031e+04 1.16e-10 1.00e-06 -1.0 1.02e+05 - 1.00e+00 1.00e+00f 1
45 -3.2504624e+04 1.16e-10 2.97e+06 -5.7 2.61e+05 - 6.62e-01 9.59e-01f 1
46 -3.2556167e+04 1.16e-10 9.71e+05 -5.7 4.71e+05 - 6.87e-01 7.89e-01f 1
47 -3.2576004e+04 1.16e-10 4.21e+05 -5.7 2.93e+05 - 5.80e-01 7.35e-01f 1
48 -3.2580289e+04 1.16e-10 5.76e+04 -5.7 1.17e+05 - 8.51e-01 6.37e-01f 1
49 -3.2582069e+04 1.16e-10 8.34e+03 -5.7 5.55e+04 - 8.46e-01 7.84e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
50 -3.2582491e+04 2.33e-10 9.07e+02 -5.7 1.14e+04 - 8.96e-01 9.20e-01f 1
51 -3.2582522e+04 2.33e-10 1.85e-11 -5.7 8.54e+02 - 1.00e+00 1.00e+00f 1
52 -3.2582532e+04 2.33e-10 9.38e-13 -7.0 5.14e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 52
(scaled) (unscaled)
Objective...............: -3.2582531842349084e+02 -3.2582531842349083e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 1.2589866307288661e-07 1.2589866307288661e-05
Overall NLP error.......: 1.2589866307288661e-07 1.2589866307288661e-05
Number of objective function evaluations = 58
Number of objective gradient evaluations = 53
Number of equality constraint evaluations = 58
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 53
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 52
Total CPU secs in IPOPT (w/o function evaluations) = 0.058
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 44722.68
Variable costs: 1726.33
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 409.29
Simulating time_step 2020-07-10 02:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.9831603e+04 2.91e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.9914035e+04 2.91e+05 9.90e+01 -1.0 2.70e+04 - 4.12e-04 3.82e-04h 1
2 -2.7293183e+04 2.91e+05 9.99e+01 -1.0 2.36e+04 - 3.89e-04 1.38e-03h 1
3 -1.6814045e+04 2.89e+05 1.01e+02 -1.0 7.95e+03 - 1.06e-03 3.91e-03h 1
4 2.3768544e+04 2.85e+05 1.01e+02 -1.0 5.12e+03 - 5.88e-03 1.39e-02h 1
5 3.4386026e+04 2.84e+05 9.76e+01 -1.0 2.46e+04 - 1.87e-02 3.58e-03h 1
6 4.2554030e+04 2.84e+05 1.66e+02 -1.0 1.96e+05 - 5.41e-02 2.85e-03h 1
7 1.9643424e+05 2.68e+05 9.12e+01 -1.0 1.56e+05 - 2.44e-02 5.51e-02h 1
8 2.7153508e+05 2.60e+05 1.50e+02 -1.0 8.89e+04 - 8.46e-02 2.98e-02h 1
9 6.1894038e+05 2.23e+05 1.51e+02 -1.0 2.76e+04 - 4.69e-02 1.44e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 8.0795899e+05 2.02e+05 1.07e+02 -1.0 2.37e+04 - 2.10e-01 9.15e-02h 1
11 2.2044891e+06 4.80e+04 1.66e+02 -1.0 2.15e+04 - 1.43e-01 7.63e-01h 1
12 2.2166520e+06 4.57e+04 1.68e+02 -1.0 5.43e+03 - 5.19e-03 4.79e-02h 1
13 2.2607361e+06 3.66e+04 1.02e+02 -1.0 5.29e+03 - 3.32e-01 2.00e-01h 1
14 2.2674556e+06 2.12e+04 1.07e+02 -1.0 6.65e+03 - 1.47e-01 4.22e-01h 1
15 2.2667259e+06 2.11e+04 4.19e+01 -1.0 7.85e+03 - 4.69e-01 3.98e-03f 1
16 2.2170914e+06 1.85e+04 7.17e+01 -1.0 1.46e+04 - 3.74e-01 1.22e-01f 1
17 2.2138402e+06 1.84e+04 7.74e+01 -1.0 2.24e+04 - 4.35e-02 4.88e-03f 1
18 1.8895881e+06 9.83e+03 4.13e+01 -1.0 2.43e+04 - 3.89e-02 4.66e-01f 1
19 1.8753152e+06 9.68e+03 4.08e+01 -1.0 4.77e+04 - 1.45e-02 1.61e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.7544994e+06 8.69e+03 1.05e+03 -1.0 4.93e+04 - 6.41e-03 1.02e-01f 1
21 1.5639079e+06 7.69e+03 9.76e+02 -1.0 8.69e+04 - 4.93e-02 1.14e-01f 1
22 9.1815060e+05 4.67e+03 5.92e+02 -1.0 8.17e+04 - 2.17e-01 3.93e-01f 1
23 9.1219784e+05 4.65e+03 5.89e+02 -1.0 5.50e+04 - 2.96e-03 4.34e-03f 1
24 9.1177821e+05 4.65e+03 5.89e+02 -1.0 6.60e+04 - 1.19e-03 2.72e-04f 1
25 8.4207154e+05 4.43e+03 5.61e+02 -1.0 6.88e+04 - 4.38e-01 4.68e-02f 1
26 8.4083823e+05 4.42e+03 5.61e+02 -1.0 5.74e+04 - 5.45e-02 1.08e-03f 1
27 6.3587758e+05 3.53e+03 4.47e+02 -1.0 6.78e+04 - 5.57e-02 2.02e-01f 1
28 6.3368839e+05 3.52e+03 7.25e+02 -1.0 4.93e+04 - 8.28e-01 2.78e-03f 1
29 4.8889456e+05 2.52e+03 3.59e+02 -1.0 1.02e+05 - 9.25e-02 2.85e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 4.7738706e+05 2.46e+03 3.27e+02 -1.0 9.86e+04 - 1.08e-03 2.19e-02f 1
31 4.7616983e+05 2.46e+03 4.85e+02 -1.0 1.34e+06 - 1.34e-01 6.85e-04f 1
32 1.4629334e+05 1.86e+03 2.36e+02 -1.0 1.02e+06 - 2.60e-03 2.44e-01f 1
33 1.4172825e+05 1.84e+03 1.28e+03 -1.0 2.37e+05 - 7.80e-01 1.06e-02f 1
34 1.3942507e+05 1.82e+03 1.62e+03 -1.0 8.82e+03 - 2.39e-01 1.35e-02f 1
35 -2.5109853e+04 2.14e+01 9.70e+02 -1.0 8.70e+03 - 3.71e-01 9.88e-01f 1
36 -2.6173720e+04 7.92e+00 4.23e+03 -1.0 1.08e+04 - 6.00e-01 6.29e-01f 1
37 -2.6903133e+04 1.16e-10 1.99e+05 -1.0 2.04e+04 - 4.32e-01 1.00e+00f 1
38 -2.7081136e+04 2.33e-10 3.15e+06 -1.0 2.09e+04 - 6.77e-01 1.00e+00f 1
39 -2.7237475e+04 1.16e-10 1.75e+06 -1.0 1.97e+04 - 4.45e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -2.7292187e+04 1.16e-10 4.78e+05 -1.0 1.54e+04 - 7.26e-01 1.00e+00f 1
41 -2.7299793e+04 1.16e-10 2.63e+05 -1.0 5.40e+04 - 4.50e-01 1.00e+00f 1
42 -2.7293717e+04 2.33e-10 6.10e+04 -1.0 9.12e+04 - 7.68e-01 1.00e+00f 1
43 -2.7270922e+04 1.16e-10 2.71e+04 -1.0 2.48e+05 - 5.55e-01 1.00e+00f 1
44 -2.7242791e+04 1.16e-10 1.00e-06 -1.0 2.60e+05 - 1.00e+00 1.00e+00f 1
45 -2.7730631e+04 2.33e-10 2.91e+06 -5.7 2.26e+05 - 7.03e-01 9.93e-01f 1
46 -2.7769032e+04 1.16e-10 6.13e+05 -5.7 3.18e+05 - 7.90e-01 8.43e-01f 1
47 -2.7780752e+04 2.33e-10 1.23e+05 -5.7 1.94e+05 - 7.97e-01 6.51e-01f 1
48 -2.7783514e+04 1.16e-10 2.92e+04 -5.7 1.11e+05 - 7.55e-01 5.05e-01f 1
49 -2.7785230e+04 1.16e-10 2.24e+03 -5.7 5.83e+04 - 9.15e-01 7.84e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
50 -2.7785643e+04 1.16e-10 3.67e+01 -5.7 1.23e+04 - 9.85e-01 9.91e-01f 1
51 -2.7785645e+04 1.16e-10 1.85e-11 -5.7 8.16e+01 - 1.00e+00 1.00e+00f 1
52 -2.7785656e+04 1.16e-10 9.38e-13 -7.0 5.13e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 52
(scaled) (unscaled)
Objective...............: -2.7785655649237475e+02 -2.7785655649237473e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.4245598329718347e-07 1.4245598329718346e-05
Overall NLP error.......: 1.4245598329718347e-07 1.4245598329718346e-05
Number of objective function evaluations = 53
Number of objective gradient evaluations = 53
Number of equality constraint evaluations = 53
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 53
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 52
Total CPU secs in IPOPT (w/o function evaluations) = 0.072
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 42058.68
Variable costs: 3974.22
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 125.38
Simulating time_step 2020-07-10 03:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.5134230e+04 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.5175195e+04 1.64e+05 9.90e+01 -1.0 2.70e+04 - 2.02e-04 1.94e-04h 1
2 -2.3567274e+04 1.64e+05 9.99e+01 -1.0 2.66e+04 - 2.15e-04 8.26e-04h 1
3 -1.7975736e+04 1.63e+05 1.00e+02 -1.0 1.84e+04 - 7.87e-04 1.79e-03h 1
4 -1.1546914e+03 1.63e+05 1.00e+02 -1.0 5.26e+03 - 1.73e-03 4.39e-03h 1
5 5.9839114e+04 1.60e+05 1.01e+02 -1.0 4.52e+03 - 6.14e-03 1.57e-02h 1
6 2.8165170e+05 1.51e+05 9.92e+01 -1.0 2.38e+03 - 3.65e-02 5.71e-02h 1
7 5.8009084e+05 1.39e+05 8.64e+01 -1.0 2.47e+03 - 1.07e-01 8.20e-02h 1
8 9.1648679e+05 1.25e+05 7.53e+01 -1.0 2.77e+03 - 3.30e-01 1.01e-01h 1
9 1.8858160e+06 8.31e+04 5.02e+01 -1.0 4.13e+03 - 3.63e-01 3.33e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.6676955e+06 4.61e+04 3.19e+01 -1.0 6.43e+03 - 2.36e-01 4.46e-01h 1
11 2.7948609e+06 3.80e+04 2.36e+01 -1.0 8.48e+03 - 2.48e-01 1.75e-01h 1
12 2.7960767e+06 3.79e+04 4.09e+01 -1.0 1.06e+04 - 2.69e-01 2.76e-03h 1
13 3.0685721e+06 5.22e+03 5.32e+01 -1.0 1.41e+04 - 1.61e-01 8.62e-01h 1
14 3.0599960e+06 5.13e+03 4.74e+01 -1.0 1.35e+04 - 2.59e-01 1.77e-02f 1
15 2.6896698e+06 2.38e+03 1.40e+02 -1.0 3.11e+04 - 2.93e-02 5.36e-01f 1
16 2.1545685e+06 1.15e+03 2.52e+03 -1.0 4.64e+04 - 1.68e-02 5.18e-01f 1
17 2.1405793e+06 1.14e+03 2.47e+03 -1.0 8.33e+04 - 6.81e-02 6.07e-03f 1
18 2.1381722e+06 1.14e+03 2.47e+03 -1.0 8.72e+04 - 8.22e-02 1.17e-03f 1
19 1.1497382e+06 5.99e+02 1.30e+03 -1.0 8.92e+04 - 1.54e-01 4.74e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.1392619e+06 5.94e+02 1.86e+03 -1.0 5.26e+04 - 8.93e-01 8.14e-03f 1
21 1.1307578e+06 5.90e+02 2.49e+03 -1.0 1.63e+05 - 2.45e-01 7.76e-03f 1
22 1.0671754e+06 5.65e+02 2.29e+03 -1.0 5.89e+05 - 3.25e-03 4.14e-02f 1
23 1.0602445e+06 5.64e+02 2.27e+03 -1.0 1.25e+06 - 3.94e-04 2.99e-03f 1
24 6.5291250e+05 4.66e+02 1.76e+03 -1.0 1.36e+06 - 1.33e-01 1.74e-01f 1
25 6.1489473e+05 4.44e+02 2.64e+03 -1.0 3.26e+05 - 3.23e-01 4.73e-02f 1
26 6.1360442e+05 4.43e+02 2.64e+03 -1.0 7.93e+04 - 4.45e-03 2.72e-03f 1
27 6.0263511e+05 4.36e+02 2.55e+03 -1.0 3.65e+05 - 1.66e-04 1.50e-02f 1
28 5.9995303e+05 4.34e+02 5.30e+03 -1.0 4.90e+05 - 7.40e-01 3.37e-03f 1
29 1.4091367e+05 1.26e+02 1.43e+03 -1.0 3.55e+05 - 2.00e-02 7.09e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -1.3250609e+04 1.69e+01 1.25e+02 -1.0 9.83e+04 - 8.82e-01 8.67e-01f 1
31 -2.3066102e+04 1.78e-01 5.30e+04 -1.0 1.00e+04 - 4.37e-01 9.89e-01f 1
32 -2.3274174e+04 1.16e-10 2.21e+06 -1.0 1.30e+04 - 5.37e-01 1.00e+00f 1
33 -2.3395224e+04 1.16e-10 4.49e+06 -1.0 1.58e+04 - 3.92e-01 1.00e+00f 1
34 -2.3482100e+04 1.16e-10 9.45e+05 -1.0 2.01e+04 - 7.89e-01 1.00e+00f 1
35 -2.3531669e+04 1.16e-10 4.86e+05 -1.0 7.59e+04 - 4.86e-01 1.00e+00f 1
36 -2.3528801e+04 1.16e-10 8.86e+04 -1.0 1.37e+05 - 8.18e-01 1.00e+00f 1
37 -2.3499109e+04 5.82e-11 3.48e+04 -1.0 3.13e+05 - 6.07e-01 1.00e+00f 1
38 -2.3476599e+04 1.16e-10 1.00e-06 -1.0 2.33e+05 - 1.00e+00 1.00e+00f 1
39 -2.4052367e+04 5.82e-11 2.74e+06 -5.7 2.09e+05 - 7.11e-01 9.85e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -2.4108950e+04 1.16e-10 9.41e+05 -5.7 3.91e+05 - 6.72e-01 9.55e-01f 1
41 -2.4120640e+04 1.16e-10 1.74e+05 -5.7 1.85e+05 - 8.14e-01 7.16e-01f 1
42 -2.4122869e+04 1.16e-10 3.97e+04 -5.7 1.05e+05 - 7.68e-01 4.38e-01f 1
43 -2.4124947e+04 2.33e-10 2.31e+03 -5.7 6.00e+04 - 9.40e-01 8.74e-01f 1
44 -2.4125206e+04 1.16e-10 7.14e-01 -5.7 6.73e+03 - 1.00e+00 9.98e-01f 1
45 -2.4125206e+04 1.16e-10 1.85e-11 -5.7 3.27e+01 - 1.00e+00 1.00e+00f 1
46 -2.4125218e+04 1.16e-10 9.24e-13 -7.0 5.75e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 46
(scaled) (unscaled)
Objective...............: -2.4125217852184076e+02 -2.4125217852184076e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.3463273041926242e-07 1.3463273041926242e-05
Overall NLP error.......: 1.3463273041926242e-07 1.3463273041926242e-05
Number of objective function evaluations = 47
Number of objective gradient evaluations = 47
Number of equality constraint evaluations = 47
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 47
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 46
Total CPU secs in IPOPT (w/o function evaluations) = 0.031
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 36982.68
Variable costs: 19063.23
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 739.98
Simulating time_step 2020-07-10 04:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.1575886e+04 4.00e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.1616815e+04 4.00e+05 9.90e+01 -1.0 2.70e+04 - 2.02e-04 1.94e-04h 1
2 -1.9772518e+04 3.99e+05 9.99e+01 -1.0 2.66e+04 - 2.15e-04 8.26e-04h 1
3 -1.3882303e+04 3.99e+05 1.00e+02 -1.0 1.84e+04 - 8.03e-04 1.79e-03h 1
4 3.3020110e+03 3.97e+05 1.00e+02 -1.0 5.35e+03 - 1.74e-03 4.47e-03h 1
5 3.1480189e+04 3.94e+05 9.99e+01 -1.0 4.67e+03 - 6.37e-03 7.21e-03h 1
6 1.4780767e+05 3.82e+05 9.94e+01 -1.0 2.39e+03 - 1.69e-02 2.96e-02h 1
7 4.5003659e+05 3.52e+05 8.72e+01 -1.0 2.42e+03 - 1.05e-01 7.92e-02h 1
8 1.3231927e+06 2.64e+05 7.17e+01 -1.0 2.71e+03 - 2.10e-01 2.50e-01h 1
9 3.1082718e+06 7.87e+04 7.05e+01 -1.0 3.43e+03 - 3.41e-01 7.02e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.5665679e+06 1.25e+04 6.22e+01 -1.0 5.15e+03 - 2.73e-01 8.41e-01h 1
11 3.5552131e+06 1.19e+04 8.13e+01 -1.0 7.08e+03 - 3.45e-01 4.93e-02f 1
12 3.5535419e+06 1.18e+04 1.54e+02 -1.0 1.01e+04 - 2.66e-01 5.60e-03f 1
13 3.5288934e+06 1.09e+04 1.83e+02 -1.0 1.33e+04 - 1.92e-01 7.29e-02f 1
14 3.2577292e+06 4.30e+03 1.10e+02 -1.0 1.57e+04 - 1.09e-01 6.06e-01f 1
15 3.2491085e+06 4.23e+03 6.05e+01 -1.0 1.98e+04 - 1.36e-01 1.71e-02f 1
16 2.6787243e+06 7.88e+01 2.90e+03 -1.0 2.93e+04 - 2.60e-02 9.81e-01f 1
17 2.4677531e+06 5.77e+01 1.13e+04 -1.0 4.10e+04 - 5.64e-02 2.67e-01f 1
18 2.4594465e+06 5.75e+01 1.03e+04 -1.0 8.40e+04 - 1.79e-02 2.95e-03f 1
19 2.4462876e+06 5.73e+01 9.00e+03 -1.0 8.87e+04 - 2.24e-02 4.82e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 9.8217585e+05 2.78e+01 3.68e+04 -1.0 9.18e+04 - 4.69e-02 5.15e-01f 1
21 9.6652110e+05 2.75e+01 3.67e+04 -1.0 5.23e+04 - 5.26e-01 9.33e-03f 1
22 9.6271982e+05 2.74e+01 1.58e+05 -1.0 5.27e+04 - 8.57e-01 3.11e-03f 1
23 9.2192151e+05 2.62e+01 1.53e+05 -1.0 4.81e+04 - 6.01e-02 4.32e-02f 1
24 8.8636632e+05 2.48e+01 1.38e+05 -1.0 5.40e+04 - 6.66e-04 5.29e-02f 1
25 5.4583523e+05 2.07e+01 1.10e+05 -1.0 1.35e+06 - 1.32e-01 1.65e-01f 1
26 4.9729253e+05 1.92e+01 1.59e+05 -1.0 4.03e+05 - 3.82e-01 7.27e-02f 1
27 4.9599530e+05 1.91e+01 1.90e+05 -1.0 7.70e+04 - 1.68e-01 4.64e-03f 1
28 3.4176727e+05 6.02e+00 7.52e+04 -1.0 7.64e+04 - 2.06e-03 6.85e-01f 1
29 3.2925890e+05 5.85e+00 1.85e+05 -1.0 3.50e+05 - 4.57e-01 2.83e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -8.5376081e+03 2.07e+00 2.94e+05 -1.0 4.38e+05 - 4.83e-02 6.46e-01f 1
31 -1.9856112e+04 8.10e-01 3.94e+05 -1.0 4.61e+03 - 9.44e-01 6.08e-01f 1
32 -2.5187133e+04 2.33e-10 1.86e+06 -1.0 5.40e+03 - 2.89e-01 1.00e+00f 1
33 -2.5196761e+04 1.16e-10 3.03e+06 -1.0 6.09e+03 - 5.77e-01 1.00e+00f 1
34 -2.5232841e+04 1.16e-10 9.49e+05 -1.0 1.43e+04 - 6.87e-01 1.00e+00f 1
35 -2.5266040e+04 1.16e-10 4.98e+05 -1.0 4.40e+04 - 4.76e-01 1.00e+00f 1
36 -2.5273678e+04 1.75e-10 1.29e+05 -1.0 7.53e+04 - 7.40e-01 1.00e+00f 1
37 -2.5258818e+04 2.33e-10 5.87e+04 -1.0 1.97e+05 - 5.46e-01 1.00e+00f 1
38 -2.5234947e+04 2.33e-10 1.00e-06 -1.0 2.26e+05 - 1.00e+00 1.00e+00f 1
39 -2.5756002e+04 1.16e-10 2.82e+06 -5.7 1.47e+05 - 7.04e-01 9.86e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -2.5773653e+04 1.16e-10 6.20e+05 -5.7 2.40e+05 - 7.67e-01 4.99e-01f 1
41 -2.5795074e+04 1.16e-10 1.39e+05 -5.7 2.59e+05 - 7.74e-01 7.65e-01f 1
42 -2.5798290e+04 1.16e-10 2.98e+04 -5.7 1.11e+05 - 7.57e-01 5.09e-01f 1
43 -2.5800294e+04 1.16e-10 2.36e+03 -5.7 5.73e+04 - 8.89e-01 7.69e-01f 1
44 -2.5800834e+04 2.33e-10 1.91e+02 -5.7 1.28e+04 - 9.54e-01 9.99e-01f 1
45 -2.5800834e+04 2.33e-10 1.73e+02 -5.7 3.49e+02 - 9.35e-02 2.54e-02f 2
46 -2.5800830e+04 2.33e-10 1.85e-11 -5.7 2.71e+01 - 1.00e+00 1.00e+00f 1
47 -2.5800842e+04 1.16e-10 9.38e-13 -7.0 4.77e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 47
(scaled) (unscaled)
Objective...............: -2.5800841623088422e+02 -2.5800841623088421e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.9738443098866608e-07 1.9738443098866609e-05
Overall NLP error.......: 1.9738443098866608e-07 1.9738443098866609e-05
Number of objective function evaluations = 51
Number of objective gradient evaluations = 48
Number of equality constraint evaluations = 51
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 48
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 47
Total CPU secs in IPOPT (w/o function evaluations) = 0.085
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 42758.68
Variable costs: 3953.92
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 741.06
Simulating time_step 2020-07-10 05:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.3202408e+04 6.25e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.3244181e+04 6.25e+03 9.90e+01 -1.0 2.70e+04 - 2.02e-04 1.94e-04h 1
2 -2.1377685e+04 6.24e+03 1.00e+02 -1.0 2.66e+04 - 2.15e-04 8.26e-04h 1
3 -1.5264977e+04 6.23e+03 1.00e+02 -1.0 1.84e+04 - 8.03e-04 1.75e-03h 1
4 3.4633925e+03 6.20e+03 1.00e+02 -1.0 5.26e+03 - 1.65e-03 4.46e-03h 1
5 3.3772962e+04 6.16e+03 9.99e+01 -1.0 4.54e+03 - 6.39e-03 7.14e-03h 1
6 1.5854260e+05 5.98e+03 9.94e+01 -1.0 2.38e+03 - 1.68e-02 2.94e-02h 1
7 4.8415181e+05 5.51e+03 8.72e+01 -1.0 2.42e+03 - 1.05e-01 7.90e-02h 1
8 1.4200401e+06 4.14e+03 7.18e+01 -1.0 2.71e+03 - 2.09e-01 2.48e-01h 1
9 3.3549946e+06 1.24e+03 7.06e+01 -1.0 3.42e+03 - 3.41e-01 7.00e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.8713446e+06 1.97e+02 6.22e+01 -1.0 5.14e+03 - 2.75e-01 8.41e-01h 1
11 3.8561927e+06 1.84e+02 7.73e+01 -1.0 7.08e+03 - 3.44e-01 6.77e-02f 1
12 3.8548640e+06 1.83e+02 1.51e+02 -1.0 1.01e+04 - 2.72e-01 4.10e-03f 1
13 3.4867961e+06 4.07e+01 1.61e+02 -1.0 1.33e+04 - 2.07e-01 7.78e-01f 1
14 3.4769441e+06 4.00e+01 1.14e+02 -1.0 1.39e+04 - 1.95e-01 1.76e-02f 1
15 2.9611400e+06 9.73e+00 1.05e+03 -1.0 2.51e+04 - 6.80e-02 7.57e-01f 1
16 2.3550777e+06 4.88e+00 6.40e+03 -1.0 4.79e+04 - 3.18e-02 4.99e-01f 1
17 2.3399266e+06 4.85e+00 6.36e+03 -1.0 8.41e+04 - 2.42e-02 5.77e-03f 1
18 2.3385511e+06 4.85e+00 6.35e+03 -1.0 8.82e+04 - 3.09e-02 5.56e-04f 1
19 1.7513486e+06 3.71e+00 4.86e+03 -1.0 9.14e+04 - 1.18e-01 2.36e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.7456633e+06 3.70e+00 4.84e+03 -1.0 7.51e+04 - 3.38e-01 2.71e-03f 1
21 1.6463392e+06 3.49e+00 1.57e+04 -1.0 7.79e+04 - 8.81e-01 5.71e-02f 1
22 1.1629531e+06 2.53e+00 8.54e+03 -1.0 7.65e+04 - 1.14e-01 2.74e-01f 1
23 1.1575339e+06 2.52e+00 8.44e+03 -1.0 5.27e+04 - 1.33e-03 4.18e-03f 1
24 1.1555599e+06 2.52e+00 8.43e+03 -1.0 1.36e+06 - 5.10e-04 7.15e-04f 1
25 9.0744551e+05 2.35e+00 6.83e+03 -1.0 1.39e+06 - 2.50e-02 6.67e-02f 1
26 9.0422518e+05 2.35e+00 9.63e+03 -1.0 1.11e+06 - 1.07e-01 1.16e-03f 1
27 6.9766681e+05 2.05e+00 1.20e+04 -1.0 9.16e+05 - 2.62e-01 1.27e-01f 1
28 6.5677944e+05 1.91e+00 1.66e+04 -1.0 2.68e+05 - 2.45e-01 6.72e-02f 1
29 5.7266671e+05 1.50e+00 6.10e+03 -1.0 1.34e+05 - 3.27e-03 2.16e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 5.6453388e+05 1.49e+00 6.01e+03 -1.0 1.31e+06 - 3.29e-03 4.81e-03f 1
31 4.3461671e+05 1.37e+00 5.74e+03 -1.0 1.29e+06 - 8.64e-02 8.13e-02f 1
32 4.3312186e+05 1.37e+00 1.36e+04 -1.0 5.30e+05 - 1.77e-01 1.98e-03f 1
33 4.0988275e+05 1.20e+00 6.69e+03 -1.0 6.18e+04 - 2.31e-03 1.20e-01f 1
34 4.0354183e+05 1.19e+00 2.91e+04 -1.0 3.04e+05 - 4.53e-01 1.44e-02f 1
35 8.7798682e+04 4.80e-01 1.81e+04 -1.0 3.94e+05 - 2.10e-02 5.95e-01f 1
36 -1.6206437e+04 1.74e-01 1.54e+04 -1.0 1.18e+05 - 8.10e-01 6.38e-01f 1
37 -2.4519027e+04 6.34e-02 3.22e+04 -1.0 1.34e+05 - 7.14e-01 6.36e-01f 1
38 -2.8781166e+04 4.44e-04 6.13e+05 -1.0 1.13e+04 - 2.80e-01 9.93e-01f 1
39 -2.8902117e+04 2.76e-04 9.83e+05 -1.0 4.57e+04 - 3.09e-01 3.78e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -2.8907376e+04 1.16e-10 1.93e+06 -1.0 1.04e+04 - 6.96e-01 1.00e+00f 1
41 -2.8989158e+04 2.33e-10 6.99e+05 -1.0 3.58e+04 - 6.84e-01 1.00e+00f 1
42 -2.9019730e+04 1.16e-10 3.56e+05 -1.0 9.98e+04 - 4.91e-01 1.00e+00f 1
43 -2.9016540e+04 1.16e-10 4.86e+04 -1.0 1.51e+05 - 8.63e-01 1.00e+00f 1
44 -2.8974987e+04 1.16e-10 2.07e+04 -1.0 4.11e+05 - 5.74e-01 1.00e+00f 1
45 -2.8968295e+04 1.16e-10 1.00e-06 -1.0 1.51e+05 - 1.00e+00 1.00e+00f 1
46 -2.9492436e+04 1.16e-10 2.40e+06 -5.7 1.76e+05 - 7.34e-01 9.75e-01f 1
47 -2.9550678e+04 1.16e-10 1.16e+06 -5.7 4.13e+05 - 5.62e-01 9.90e-01f 1
48 -2.9553714e+04 1.16e-10 3.51e+05 -5.7 1.62e+05 - 6.97e-01 3.62e-01f 1
49 -2.9557959e+04 2.33e-10 6.53e+04 -5.7 1.80e+05 - 8.13e-01 6.04e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
50 -2.9559614e+04 3.49e-10 1.45e+03 -5.7 7.41e+04 - 9.76e-01 7.55e-01f 1
51 -2.9560044e+04 1.16e-10 2.22e+01 -5.7 1.60e+04 - 1.00e+00 9.50e-01f 1
52 -2.9560052e+04 2.33e-10 1.85e-11 -5.7 1.83e+02 - 1.00e+00 1.00e+00f 1
53 -2.9560062e+04 2.33e-10 9.24e-13 -7.0 5.25e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 53
(scaled) (unscaled)
Objective...............: -2.9560062277089969e+02 -2.9560062277089968e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 1.2652855801677797e-07 1.2652855801677796e-05
Overall NLP error.......: 1.2652855801677797e-07 1.2652855801677796e-05
Number of objective function evaluations = 54
Number of objective gradient evaluations = 54
Number of equality constraint evaluations = 54
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 54
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 53
Total CPU secs in IPOPT (w/o function evaluations) = 0.097
Total CPU secs in NLP function evaluations = 0.003
EXIT: Optimal Solution Found.
Fixed costs: 45058.68
Variable costs: 1278.72
Renewables curtailment reported at t=1 - total= 0.90
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 152.30
Simulating time_step 2020-07-10 06:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.6810436e+04 2.15e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.6851886e+04 2.15e+05 9.90e+01 -1.0 2.69e+04 - 2.02e-04 1.94e-04h 1
2 -2.4950089e+04 2.15e+05 1.00e+02 -1.0 2.65e+04 - 2.15e-04 8.26e-04h 1
3 -1.8506102e+04 2.15e+05 1.00e+02 -1.0 1.83e+04 - 8.03e-04 1.79e-03h 1
4 4.3854133e+02 2.14e+05 1.00e+02 -1.0 5.10e+03 - 1.74e-03 4.41e-03h 1
5 3.1673903e+04 2.12e+05 9.99e+01 -1.0 4.26e+03 - 6.19e-03 7.21e-03h 1
6 9.9120575e+04 2.09e+05 9.81e+01 -1.0 2.46e+03 - 1.68e-02 1.55e-02h 1
7 1.1102833e+05 2.08e+05 9.82e+01 -1.0 2.94e+04 - 7.12e-04 2.68e-03h 1
8 7.8713634e+05 1.77e+05 9.58e+01 -1.0 2.85e+04 - 8.70e-02 1.52e-01h 1
9 1.4057386e+06 1.48e+05 8.17e+01 -1.0 1.76e+04 - 1.55e-01 1.65e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 4.1736758e+06 1.54e+04 9.52e+01 -1.0 1.51e+04 - 3.13e-01 8.96e-01h 1
11 4.2434607e+06 4.83e+03 7.56e+01 -1.0 4.53e+03 - 2.38e-01 6.86e-01h 1
12 4.1909568e+06 3.58e+03 5.87e+01 -1.0 5.98e+03 - 5.00e-01 2.59e-01f 1
13 4.1898156e+06 3.57e+03 1.86e+02 -1.0 1.10e+04 - 2.14e-01 2.41e-03f 1
14 3.7805604e+06 8.75e+02 2.65e+02 -1.0 1.35e+04 - 2.40e-01 7.55e-01f 1
15 3.7682504e+06 8.60e+02 1.75e+02 -1.0 1.64e+04 - 1.56e-01 1.71e-02f 1
16 3.3209947e+06 4.33e+02 1.16e+03 -1.0 2.67e+04 - 5.82e-02 4.97e-01f 1
17 2.4593443e+06 1.62e+02 9.98e+03 -1.0 4.59e+04 - 2.89e-02 6.27e-01f 1
18 2.4395365e+06 1.60e+02 9.90e+03 -1.0 8.48e+04 - 2.99e-02 7.13e-03f 1
19 2.4382541e+06 1.60e+02 9.90e+03 -1.0 8.88e+04 - 3.67e-02 4.90e-04f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.9255423e+06 1.29e+02 7.95e+03 -1.0 9.12e+04 - 1.24e-01 1.96e-01f 1
21 1.9204225e+06 1.29e+02 7.94e+03 -1.0 7.79e+04 - 3.02e-01 2.24e-03f 1
22 1.2324770e+06 8.31e+01 1.01e+04 -1.0 8.05e+04 - 8.84e-01 3.54e-01f 1
23 1.2211464e+06 8.26e+01 1.30e+04 -1.0 6.62e+05 - 1.18e-01 5.41e-03f 1
24 1.2102489e+06 8.21e+01 1.28e+04 -1.0 8.00e+05 - 1.35e-03 6.33e-03f 1
25 1.1503273e+06 8.06e+01 1.22e+04 -1.0 1.35e+06 - 6.08e-03 1.89e-02f 1
26 1.1424320e+06 8.03e+01 1.61e+04 -1.0 1.30e+06 - 1.50e-01 3.31e-03f 1
27 7.7496883e+05 6.64e+01 9.53e+03 -1.0 1.10e+06 - 3.12e-02 1.72e-01f 1
28 7.4769806e+05 6.46e+01 2.26e+04 -1.0 3.88e+05 - 4.44e-01 2.83e-02f 1
29 5.9641712e+05 5.92e+01 2.13e+04 -1.0 1.24e+06 - 1.00e-01 8.27e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 5.9454489e+05 5.91e+01 2.13e+04 -1.0 6.09e+05 - 1.25e-03 1.69e-03f 1
31 5.9053725e+05 5.88e+01 3.67e+04 -1.0 3.97e+05 - 4.36e-01 5.16e-03f 1
32 4.8445781e+05 4.38e+01 2.07e+04 -1.0 1.00e+05 - 7.23e-02 2.56e-01f 1
33 4.7960735e+05 4.34e+01 2.13e+04 -1.0 4.28e+05 - 2.24e-02 7.26e-03f 1
34 2.1803175e+04 1.29e+01 8.48e+03 -1.0 4.39e+05 - 4.00e-01 7.02e-01f 1
35 9.4097318e+01 7.44e+00 8.39e+04 -1.0 3.56e+04 - 9.71e-01 4.24e-01f 1
36 -2.9241156e+04 3.88e-02 2.48e+05 -1.0 3.18e+05 - 8.93e-02 9.95e-01f 1
37 -2.9664715e+04 1.16e-10 2.93e+06 -1.0 3.75e+04 - 6.45e-01 1.00e+00f 1
38 -2.9693344e+04 1.16e-10 1.41e+06 -1.0 3.29e+04 - 6.80e-01 1.00e+00f 1
39 -2.9687840e+04 1.16e-10 5.43e+05 -1.0 7.45e+04 - 6.16e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -2.9673539e+04 2.33e-10 8.67e+04 -1.0 1.52e+05 - 8.40e-01 1.00e+00f 1
41 -2.9639695e+04 2.33e-10 1.98e+04 -1.0 3.53e+05 - 7.72e-01 1.00e+00f 1
42 -2.9636362e+04 1.16e-10 1.00e-06 -1.0 9.58e+04 - 1.00e+00 1.00e+00f 1
43 -3.0179965e+04 2.33e-10 2.26e+06 -5.7 1.43e+05 - 7.34e-01 9.60e-01f 1
44 -3.0233410e+04 1.16e-10 1.30e+06 -5.7 3.85e+05 - 4.83e-01 8.17e-01f 1
45 -3.0252815e+04 1.16e-10 4.03e+05 -5.7 2.07e+05 - 6.94e-01 7.51e-01f 1
46 -3.0255502e+04 1.16e-10 9.80e+04 -5.7 6.88e+04 - 7.47e-01 5.27e-01f 1
47 -3.0257100e+04 1.16e-10 5.06e+03 -5.7 5.22e+04 - 9.32e-01 7.42e-01f 1
48 -3.0257497e+04 1.16e-10 6.33e+02 -5.7 1.33e+04 - 1.00e+00 7.76e-01f 1
49 -3.0257607e+04 1.16e-10 1.85e-11 -5.7 2.96e+03 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
50 -3.0257618e+04 1.16e-10 9.38e-13 -7.0 4.06e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 50
(scaled) (unscaled)
Objective...............: -3.0257617582493100e+02 -3.0257617582493098e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2884933365163805e-07 1.2884933365163804e-05
Overall NLP error.......: 1.2884933365163805e-07 1.2884933365163804e-05
Number of objective function evaluations = 51
Number of objective gradient evaluations = 51
Number of equality constraint evaluations = 51
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 51
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 50
Total CPU secs in IPOPT (w/o function evaluations) = 0.037
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 36982.68
Variable costs: 1335.31
Renewables curtailment reported at t=1 - total= 2.92
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 3.00
Simulating time_step 2020-07-10 07:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.7507713e+04 2.15e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.7549212e+04 2.15e+05 9.90e+01 -1.0 2.60e+04 - 2.02e-04 1.94e-04h 1
2 -2.5642066e+04 2.15e+05 1.00e+02 -1.0 2.56e+04 - 2.15e-04 8.26e-04h 1
3 -1.9177004e+04 2.15e+05 1.00e+02 -1.0 1.83e+04 - 8.03e-04 1.79e-03h 1
4 1.9511465e+02 2.14e+05 1.00e+02 -1.0 3.00e+03 - 1.74e-03 4.51e-03h 1
5 3.1372445e+04 2.12e+05 9.96e+01 -1.0 2.36e+03 - 7.74e-03 7.22e-03h 1
6 1.0973930e+05 2.08e+05 9.80e+01 -1.0 3.88e+03 - 1.73e-02 1.82e-02h 1
7 1.2312601e+05 2.08e+05 2.68e+02 -1.0 4.13e+04 - 3.25e-01 3.29e-03h 1
8 1.3594857e+05 2.07e+05 2.68e+02 -1.0 2.40e+04 - 4.32e-02 3.22e-03h 1
9 1.6131296e+05 2.06e+05 2.71e+02 -1.0 1.62e+05 - 8.66e-03 6.21e-03h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 5.8580393e+05 1.85e+05 3.76e+02 -1.0 1.04e+05 - 1.42e-04 1.03e-01h 1
11 4.3575163e+06 1.84e+03 1.59e+02 -1.0 1.91e+04 - 8.46e-02 9.90e-01h 1
12 4.2499130e+06 3.90e+02 8.40e+02 -1.0 4.10e+03 - 7.08e-02 7.89e-01f 1
13 4.0721345e+06 3.69e+00 2.95e+03 -1.0 4.33e+03 - 4.58e-01 9.91e-01f 1
14 3.7659604e+06 3.10e-01 2.26e+05 -1.0 7.56e+03 - 5.06e-01 9.16e-01f 1
15 3.7565916e+06 3.05e-01 6.96e+05 -1.0 1.48e+04 - 2.48e-01 1.69e-02f 1
16 3.0032118e+06 1.16e-10 3.21e+06 -1.0 1.99e+04 - 1.13e-01 1.00e+00f 1
17 2.4441900e+06 1.16e-10 5.18e+06 -1.0 4.48e+04 - 3.95e-02 4.51e-01f 1
18 2.1870884e+06 1.16e-10 5.36e+06 -1.0 7.25e+04 - 1.40e-02 1.03e-01f 1
19 2.1838784e+06 1.16e-10 4.74e+06 -1.0 8.47e+04 - 7.89e-02 1.14e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.5723857e+06 1.16e-10 4.09e+06 -1.0 8.82e+04 - 1.74e-01 2.43e-01f 1
21 1.5664573e+06 1.16e-10 9.96e+05 -1.0 7.16e+04 - 5.17e-01 2.79e-03f 1
22 1.4264538e+06 1.75e-10 1.26e+06 -1.0 7.47e+04 - 8.30e-01 7.69e-02f 1
23 1.1842560e+06 1.16e-10 1.13e+06 -1.0 8.66e+05 - 4.90e-02 9.32e-02f 1
24 1.1815602e+06 1.16e-10 1.12e+06 -1.0 7.14e+05 - 5.60e-04 1.13e-03f 1
25 7.3874495e+05 2.33e-10 9.52e+05 -1.0 1.45e+06 - 1.22e-01 1.44e-01f 1
26 7.3478630e+05 2.33e-10 1.07e+06 -1.0 5.08e+05 - 2.90e-01 2.42e-03f 1
27 5.5287969e+05 1.16e-10 1.02e+06 -1.0 2.29e+05 - 7.77e-01 1.98e-01f 1
28 5.4702856e+05 2.33e-10 1.01e+06 -1.0 1.71e+05 - 1.06e-02 1.40e-02f 1
29 5.2908640e+05 2.33e-10 9.76e+05 -1.0 3.13e+05 - 6.32e-03 3.16e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 5.2211757e+05 2.33e-10 9.90e+05 -1.0 3.01e+05 - 4.21e-01 1.25e-02f 1
31 -6.9655425e+03 2.33e-10 7.08e+04 -1.0 3.64e+05 - 3.84e-02 8.96e-01f 1
32 -2.1606971e+04 1.16e-10 3.20e+04 -1.0 4.32e+03 - 9.85e-01 6.94e-01f 1
33 -2.7335590e+04 1.16e-10 2.20e+01 -1.0 3.59e+04 - 9.59e-01 1.00e+00f 1
34 -2.7955960e+04 1.16e-10 1.26e+06 -3.8 4.19e+04 - 8.74e-01 1.00e+00f 1
35 -2.7970287e+04 2.33e-10 3.11e+05 -3.8 1.75e+05 - 7.53e-01 1.00e+00f 1
36 -2.7975611e+04 1.16e-10 1.07e+05 -3.8 1.44e+05 - 6.57e-01 7.55e-01f 1
37 -2.7977833e+04 2.33e-10 1.50e-09 -3.8 6.90e+04 - 1.00e+00 1.00e+00f 1
38 -2.7978875e+04 1.16e-10 1.87e+03 -5.7 2.76e+03 - 1.00e+00 8.74e-01f 1
39 -2.7978986e+04 1.16e-10 2.94e+02 -5.7 3.42e+02 - 8.93e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -2.7978982e+04 1.16e-10 1.85e-11 -5.7 2.94e-01 - 1.00e+00 1.00e+00f 1
41 -2.7978995e+04 1.16e-10 9.24e-13 -7.0 4.12e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 41
(scaled) (unscaled)
Objective...............: -2.7978994558427422e+02 -2.7978994558427421e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2391379639051489e-07 1.2391379639051489e-05
Overall NLP error.......: 1.2391379639051489e-07 1.2391379639051489e-05
Number of objective function evaluations = 42
Number of objective gradient evaluations = 42
Number of equality constraint evaluations = 42
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 42
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 41
Total CPU secs in IPOPT (w/o function evaluations) = 0.040
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 36982.68
Variable costs: 2096.46
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 46.43
Simulating time_step 2020-07-10 08:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.5279764e+04 1.70e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.5321384e+04 1.69e+05 9.90e+01 -1.0 2.60e+04 - 2.02e-04 1.94e-04h 1
2 -2.3087686e+04 1.69e+05 1.00e+02 -1.0 2.56e+04 - 2.15e-04 8.26e-04h 1
3 -1.5801262e+04 1.69e+05 1.00e+02 -1.0 1.83e+04 - 8.03e-04 1.79e-03h 1
4 1.6343893e+04 1.68e+05 1.01e+02 -1.0 3.00e+03 - 1.74e-03 6.91e-03h 1
5 9.9064625e+04 1.65e+05 1.00e+02 -1.0 2.36e+03 - 1.07e-02 1.78e-02h 1
6 1.8244531e+05 1.62e+05 9.45e+01 -1.0 4.70e+03 - 1.51e-01 1.83e-02h 1
7 3.3222594e+05 1.56e+05 9.13e+01 -1.0 2.75e+04 - 5.71e-02 3.44e-02h 1
8 4.4811201e+06 1.56e+03 1.97e+02 -1.0 2.46e+04 - 2.88e-01 9.90e-01h 1
9 4.3967381e+06 1.81e+02 7.87e+02 -1.0 4.17e+03 - 1.60e-01 8.84e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 4.2399291e+06 1.64e+00 4.22e+03 -1.0 4.85e+03 - 5.41e-01 9.91e-01f 1
11 3.9929870e+06 4.65e-01 3.74e+05 -1.0 1.05e+04 - 3.18e-01 7.16e-01f 1
12 3.9861033e+06 4.57e-01 1.77e+05 -1.0 1.51e+04 - 9.02e-02 1.65e-02f 1
13 3.5031940e+06 1.16e-10 2.56e+06 -1.0 1.27e+04 - 1.44e-03 1.00e+00f 1
14 3.4432472e+06 2.33e-10 1.85e+05 -1.0 2.22e+04 - 3.14e-01 8.67e-02f 1
15 3.0282271e+06 1.16e-10 1.97e+06 -1.0 3.92e+04 - 1.45e-02 2.99e-01f 1
16 3.0167037e+06 2.33e-10 1.90e+06 -1.0 8.43e+04 - 1.32e-02 3.29e-03f 1
17 1.4251007e+06 1.16e-10 3.70e+06 -1.0 8.84e+04 - 1.52e-02 4.28e-01f 1
18 1.4111315e+06 1.16e-10 9.18e+05 -1.0 6.12e+04 - 4.49e-01 4.97e-03f 1
19 1.3724041e+06 1.16e-10 4.41e+05 -1.0 6.41e+04 - 4.07e-01 1.45e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.0326213e+06 1.16e-10 1.40e+06 -1.0 6.38e+04 - 6.27e-01 1.27e-01f 1
21 1.0235144e+06 1.75e-10 1.77e+06 -1.0 5.36e+04 - 4.98e-01 4.71e-03f 1
22 9.2676421e+05 2.33e-10 1.63e+06 -1.0 4.42e+04 - 9.94e-03 6.46e-02f 1
23 9.0212996e+05 1.16e-10 1.60e+06 -1.0 7.84e+05 - 2.33e-04 1.67e-02f 1
24 5.3601956e+05 1.75e-10 1.30e+06 -1.0 1.35e+06 - 1.36e-01 1.78e-01f 1
25 5.3044434e+05 1.75e-10 1.45e+06 -1.0 2.45e+05 - 5.20e-01 9.83e-03f 1
26 5.2808861e+05 2.33e-10 1.44e+06 -1.0 8.38e+04 - 8.90e-03 8.86e-03f 1
27 5.2035224e+05 2.33e-10 1.42e+06 -1.0 3.00e+05 - 6.57e-04 1.45e-02f 1
28 3.9468796e+05 1.16e-10 1.09e+06 -1.0 2.77e+05 - 3.94e-01 2.46e-01f 1
29 7.0858474e+03 2.33e-10 2.89e+05 -1.0 3.89e+05 - 1.59e-01 6.89e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -1.6141487e+04 5.82e-11 1.46e+05 -1.0 4.96e+03 - 9.76e-01 5.97e-01f 1
31 -2.9694034e+04 1.16e-10 4.45e+01 -1.0 1.04e+04 - 9.77e-01 1.00e+00f 1
32 -3.0241175e+04 1.16e-10 8.92e+05 -3.8 2.61e+04 - 9.11e-01 1.00e+00f 1
33 -3.0254638e+04 1.16e-10 5.98e+05 -3.8 1.68e+05 - 3.30e-01 1.00e+00f 1
34 -3.0256880e+04 1.16e-10 1.76e+05 -3.8 1.04e+05 - 7.06e-01 4.51e-01f 1
35 -3.0259806e+04 1.16e-10 9.14e+03 -3.8 1.45e+05 - 9.48e-01 6.95e-01f 1
36 -3.0261164e+04 1.16e-10 1.50e-09 -3.8 5.42e+04 - 1.00e+00 1.00e+00f 1
37 -3.0262104e+04 2.33e-10 1.87e+03 -5.7 2.79e+03 - 1.00e+00 8.74e-01f 1
38 -3.0262207e+04 1.16e-10 2.94e+02 -5.7 3.53e+02 - 8.93e-01 1.00e+00f 1
39 -3.0262205e+04 2.33e-10 1.85e-11 -5.7 3.14e+00 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -3.0262216e+04 1.16e-10 9.38e-13 -7.0 4.04e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 40
(scaled) (unscaled)
Objective...............: -3.0262215740905731e+02 -3.0262215740905729e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2391502661594992e-07 1.2391502661594991e-05
Overall NLP error.......: 1.2391502661594992e-07 1.2391502661594991e-05
Number of objective function evaluations = 41
Number of objective gradient evaluations = 41
Number of equality constraint evaluations = 41
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 41
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 40
Total CPU secs in IPOPT (w/o function evaluations) = 0.018
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 42562.68
Variable costs: 3993.85
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 104.99
Simulating time_step 2020-07-10 09:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.7562709e+04 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.7604004e+04 1.64e+05 9.90e+01 -1.0 2.60e+04 - 2.02e-04 1.94e-04h 1
2 -2.5455623e+04 1.64e+05 1.00e+02 -1.0 2.56e+04 - 2.15e-04 8.26e-04h 1
3 -1.8674063e+04 1.63e+05 1.00e+02 -1.0 1.83e+04 - 8.03e-04 1.79e-03h 1
4 1.1034787e+04 1.62e+05 1.01e+02 -1.0 3.00e+03 - 1.74e-03 6.91e-03h 1
5 7.6849135e+04 1.60e+05 1.00e+02 -1.0 2.36e+03 - 1.09e-02 1.53e-02h 1
6 2.6217309e+05 1.53e+05 9.26e+01 -1.0 2.39e+03 - 5.97e-02 4.36e-02h 1
7 1.3984355e+06 1.10e+05 9.63e+01 -1.0 2.55e+03 - 1.18e-01 2.80e-01h 1
8 2.0085492e+06 8.68e+04 5.85e+01 -1.0 2.89e+03 - 3.70e-01 2.11e-01h 1
9 4.1928264e+06 8.68e+02 5.84e+01 -1.0 4.56e+03 - 4.22e-01 9.90e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.9673630e+06 8.52e+00 1.35e+03 -1.0 7.66e+03 - 2.75e-01 9.90e-01f 1
11 3.7913538e+06 4.00e+00 3.66e+04 -1.0 9.49e+03 - 3.40e-01 5.30e-01f 1
12 3.7848400e+06 3.94e+00 7.28e+04 -1.0 1.22e+04 - 2.94e-01 1.60e-02f 1
13 3.1090655e+06 1.16e-10 3.67e+05 -1.0 2.35e+04 - 6.55e-02 1.00e+00f 1
14 2.5904511e+06 1.16e-10 4.01e+06 -1.0 4.87e+04 - 3.46e-02 4.23e-01f 1
15 2.5737351e+06 1.16e-10 3.84e+06 -1.0 8.41e+04 - 2.11e-02 4.89e-03f 1
16 2.5715435e+06 2.33e-10 3.59e+06 -1.0 8.97e+04 - 2.72e-02 6.56e-04f 1
17 1.7770299e+06 1.16e-10 3.82e+06 -1.0 9.17e+04 - 1.15e-01 2.35e-01f 1
18 1.7608594e+06 1.75e-10 1.35e+06 -1.0 7.54e+04 - 3.14e-01 6.62e-03f 1
19 1.6934561e+06 2.62e-10 1.21e+06 -1.0 7.77e+04 - 4.91e-01 3.01e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.6733854e+06 2.62e-10 2.56e+06 -1.0 7.75e+04 - 5.00e-01 1.11e-02f 1
21 1.1351114e+06 2.04e-10 2.23e+06 -1.0 1.12e+05 - 5.97e-01 2.93e-01f 1
22 1.1285569e+06 1.75e-10 2.22e+06 -1.0 1.93e+05 - 1.48e-02 5.06e-03f 1
23 1.1228984e+06 1.75e-10 2.21e+06 -1.0 2.07e+05 - 1.77e-04 5.24e-03f 1
24 6.9028524e+05 1.16e-10 1.78e+06 -1.0 1.39e+06 - 1.28e-01 1.82e-01f 1
25 6.8183275e+05 1.16e-10 1.99e+06 -1.0 2.45e+05 - 4.89e-01 1.03e-02f 1
26 6.7784263e+05 2.33e-10 1.97e+06 -1.0 2.48e+05 - 8.57e-03 7.66e-03f 1
27 4.4442217e+05 2.33e-10 1.48e+06 -1.0 5.03e+05 - 1.17e-04 2.22e-01f 1
28 4.4243347e+05 2.33e-10 1.52e+06 -1.0 1.56e+06 - 1.62e-01 9.62e-04f 1
29 4.3513336e+05 3.49e-10 1.46e+06 -1.0 7.07e+04 - 2.09e-03 3.49e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 4.2770862e+05 1.75e-10 1.52e+06 -1.0 3.24e+05 - 4.40e-01 1.55e-02f 1
31 1.7541548e+05 2.33e-10 6.39e+05 -1.0 3.06e+05 - 2.00e-02 5.42e-01f 1
32 -1.7861655e+04 1.16e-10 2.08e+05 -1.0 2.19e+05 - 6.69e-01 6.74e-01f 1
33 -2.9848373e+04 1.16e-10 4.19e+04 -1.0 2.10e+03 - 9.88e-01 8.27e-01f 1
34 -3.1991054e+04 1.16e-10 4.16e+01 -1.0 5.17e+04 - 9.07e-01 1.00e+00f 1
35 -3.2473494e+04 1.16e-10 9.82e+05 -3.8 3.67e+04 - 9.02e-01 1.00e+00f 1
36 -3.2486921e+04 2.33e-10 2.08e+05 -3.8 1.92e+05 - 7.89e-01 9.00e-01f 1
37 -3.2491448e+04 1.16e-10 7.27e+04 -3.8 1.55e+05 - 6.50e-01 8.81e-01f 1
38 -3.2492559e+04 1.16e-10 1.50e-09 -3.8 4.71e+04 - 1.00e+00 1.00e+00f 1
39 -3.2493404e+04 1.16e-10 1.87e+03 -5.7 3.32e+03 - 1.00e+00 8.74e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -3.2493500e+04 1.16e-10 2.94e+02 -5.7 4.19e+02 - 8.93e-01 1.00e+00f 1
41 -3.2493498e+04 1.16e-10 1.85e-11 -5.7 1.21e+00 - 1.00e+00 1.00e+00f 1
42 -3.2493508e+04 1.16e-10 9.24e-13 -7.0 4.09e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 42
(scaled) (unscaled)
Objective...............: -3.2493507938465837e+02 -3.2493507938465835e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2391526194049904e-07 1.2391526194049903e-05
Overall NLP error.......: 1.2391526194049904e-07 1.2391526194049903e-05
Number of objective function evaluations = 43
Number of objective gradient evaluations = 43
Number of equality constraint evaluations = 43
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 43
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 42
Total CPU secs in IPOPT (w/o function evaluations) = 0.029
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 44022.68
Variable costs: 6778.56
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 145.80
Simulating time_step 2020-07-10 10:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.9743600e+04 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.9784891e+04 1.64e+05 9.90e+01 -1.0 2.60e+04 - 2.02e-04 1.94e-04h 1
2 -2.7963958e+04 1.64e+05 1.00e+02 -1.0 2.56e+04 - 2.15e-04 8.26e-04h 1
3 -2.1915403e+04 1.63e+05 1.00e+02 -1.0 1.69e+04 - 8.03e-04 1.84e-03h 1
4 4.2315471e+03 1.62e+05 1.01e+02 -1.0 2.47e+03 - 1.89e-03 6.90e-03h 1
5 6.3415915e+04 1.60e+05 1.00e+02 -1.0 2.23e+03 - 1.11e-02 1.55e-02h 1
6 2.2837639e+05 1.53e+05 9.25e+01 -1.0 2.26e+03 - 6.00e-02 4.38e-02h 1
7 8.3266639e+05 1.27e+05 8.59e+01 -1.0 2.42e+03 - 1.19e-01 1.68e-01h 1
8 1.0162832e+06 1.19e+05 7.21e+01 -1.0 2.79e+03 - 3.41e-01 6.13e-02h 1
9 3.2577135e+06 2.29e+04 4.09e+01 -1.0 4.34e+03 - 4.87e-01 8.08e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.6104478e+06 2.29e+02 5.67e+01 -1.0 8.29e+03 - 2.02e-01 9.90e-01h 1
11 3.3766225e+06 2.12e+00 4.14e+03 -1.0 9.49e+03 - 4.13e-01 9.91e-01f 1
12 2.9321214e+06 2.33e-10 5.59e+05 -1.0 1.33e+04 - 2.19e-01 1.00e+00f 1
13 2.2916350e+06 1.16e-10 6.49e+06 -1.0 3.75e+04 - 9.71e-02 7.42e-01f 1
14 2.2774779e+06 1.16e-10 6.44e+06 -1.0 5.08e+04 - 7.69e-03 7.40e-03f 1
15 2.2769316e+06 2.33e-10 6.32e+06 -1.0 8.89e+04 - 1.34e-02 2.37e-04f 1
16 1.3223769e+06 1.16e-10 5.79e+06 -1.0 9.27e+04 - 1.66e-01 3.84e-01f 1
17 1.3142689e+06 1.16e-10 2.96e+06 -1.0 6.43e+04 - 3.92e-01 4.37e-03f 1
18 1.2989013e+06 1.16e-10 9.16e+05 -1.0 6.57e+04 - 8.81e-01 1.05e-02f 1
19 8.8137897e+05 1.16e-10 7.06e+05 -1.0 6.16e+05 - 1.17e-01 1.89e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 8.7415790e+05 1.16e-10 7.67e+05 -1.0 1.24e+06 - 1.40e-01 3.08e-03f 1
21 6.3384724e+05 1.75e-10 7.15e+05 -1.0 1.05e+06 - 2.98e-01 1.46e-01f 1
22 4.7989275e+05 1.16e-10 5.73e+05 -1.0 3.52e+05 - 3.12e-01 2.31e-01f 1
23 4.7583248e+05 1.16e-10 5.63e+05 -1.0 1.21e+05 - 4.27e-03 1.41e-02f 1
24 4.6774896e+05 1.16e-10 6.35e+05 -1.0 3.50e+05 - 4.42e-01 1.55e-02f 1
25 1.5046109e+05 1.16e-10 3.94e+04 -1.0 1.89e+05 - 2.90e-02 8.07e-01f 1
26 -2.4237339e+04 2.33e-10 9.77e+03 -1.0 2.25e+05 - 6.21e-01 6.57e-01f 1
27 -2.9732072e+04 1.16e-10 8.93e+03 -1.0 2.07e+03 - 9.89e-01 8.09e-01f 1
28 -3.0622949e+04 3.49e-10 4.46e+01 -1.0 3.89e+04 - 9.50e-01 1.00e+00f 1
29 -3.1106383e+04 1.16e-10 1.16e+06 -3.8 4.50e+04 - 8.84e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -3.1120732e+04 1.16e-10 3.20e+05 -3.8 1.90e+05 - 7.25e-01 9.01e-01f 1
31 -3.1123471e+04 1.16e-10 1.13e+05 -3.8 1.38e+05 - 6.45e-01 5.64e-01f 1
32 -3.1125842e+04 1.16e-10 6.94e+02 -3.8 9.94e+04 - 9.94e-01 9.32e-01f 1
33 -3.1125997e+04 2.33e-10 1.50e-09 -3.8 6.66e+03 - 1.00e+00 1.00e+00f 1
34 -3.1126846e+04 1.16e-10 1.87e+03 -5.7 3.34e+03 - 1.00e+00 8.74e-01f 1
35 -3.1126942e+04 1.16e-10 2.94e+02 -5.7 4.28e+02 - 8.93e-01 1.00e+00f 1
36 -3.1126941e+04 1.16e-10 1.85e-11 -5.7 2.41e-01 - 1.00e+00 1.00e+00f 1
37 -3.1126951e+04 1.16e-10 9.24e-13 -7.0 4.11e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 37
(scaled) (unscaled)
Objective...............: -3.1126951025445186e+02 -3.1126951025445185e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2391522653443052e-07 1.2391522653443052e-05
Overall NLP error.......: 1.2391522653443052e-07 1.2391522653443052e-05
Number of objective function evaluations = 38
Number of objective gradient evaluations = 38
Number of equality constraint evaluations = 38
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 38
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 37
Total CPU secs in IPOPT (w/o function evaluations) = 0.030
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 44802.68
Variable costs: 13658.74
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 338.84
Simulating time_step 2020-07-10 11:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.8427442e+04 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.8468747e+04 1.64e+05 9.90e+01 -1.0 2.67e+04 - 2.02e-04 1.94e-04h 1
2 -2.6642248e+04 1.64e+05 1.00e+02 -1.0 2.63e+04 - 2.15e-04 8.26e-04h 1
3 -2.0449351e+04 1.63e+05 1.00e+02 -1.0 1.83e+04 - 8.03e-04 1.87e-03h 1
4 5.7642808e+03 1.62e+05 1.01e+02 -1.0 3.84e+03 - 2.04e-03 6.88e-03h 1
5 7.5096003e+04 1.59e+05 1.00e+02 -1.0 3.46e+03 - 1.13e-02 1.81e-02h 1
6 2.6060383e+05 1.51e+05 9.19e+01 -1.0 3.06e+03 - 6.64e-02 4.91e-02h 1
7 9.0172788e+05 1.24e+05 8.40e+01 -1.0 2.61e+03 - 1.32e-01 1.79e-01h 1
8 2.1128153e+06 7.29e+04 6.08e+01 -1.0 2.99e+03 - 3.41e-01 4.14e-01h 1
9 3.5758317e+06 7.14e+03 5.59e+01 -1.0 4.50e+03 - 4.22e-01 9.02e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.5033616e+06 7.13e+01 1.94e+02 -1.0 7.54e+03 - 2.80e-01 9.90e-01f 1
11 3.3266935e+06 3.28e+01 4.05e+03 -1.0 9.47e+03 - 3.66e-01 5.40e-01f 1
12 3.3244989e+06 3.27e+01 8.21e+03 -1.0 1.26e+04 - 2.51e-01 4.33e-03f 1
13 2.7044458e+06 1.64e-01 4.49e+04 -1.0 2.07e+04 - 9.33e-02 9.95e-01f 1
14 2.5738486e+06 1.46e-01 4.24e+05 -1.0 4.63e+04 - 3.57e-02 1.13e-01f 1
15 1.7515544e+06 9.18e-02 2.15e+06 -1.0 6.41e+04 - 6.62e-03 3.71e-01f 1
16 1.7404517e+06 9.14e-02 1.12e+06 -1.0 7.85e+04 - 1.68e-01 4.37e-03f 1
17 1.7284009e+06 9.10e-02 8.78e+05 -1.0 8.19e+04 - 3.61e-01 5.31e-03f 1
18 1.2711745e+06 7.39e-02 1.41e+06 -1.0 8.55e+04 - 3.49e-01 1.87e-01f 1
19 1.2659584e+06 7.37e-02 3.32e+06 -1.0 7.12e+04 - 5.37e-01 2.65e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 9.4629707e+05 5.83e-02 3.63e+06 -1.0 7.07e+04 - 6.57e-01 2.10e-01f 1
21 8.5372179e+05 5.54e-02 3.50e+06 -1.0 9.48e+05 - 8.33e-02 4.93e-02f 1
22 8.4941961e+05 5.52e-02 3.64e+06 -1.0 9.93e+05 - 1.29e-01 2.92e-03f 1
23 5.3131654e+05 4.04e-02 2.72e+06 -1.0 8.10e+05 - 3.15e-01 2.68e-01f 1
24 4.4799300e+05 2.65e-02 1.55e+06 -1.0 1.10e+05 - 9.80e-02 3.44e-01f 1
25 4.3595498e+05 2.53e-02 1.45e+06 -1.0 1.12e+05 - 1.52e-03 4.43e-02f 1
26 2.0496623e+05 1.16e-02 5.21e+05 -1.0 2.75e+05 - 3.94e-01 5.44e-01f 1
27 -1.4183920e+04 4.68e-03 5.31e+04 -1.0 2.93e+05 - 3.54e-01 5.95e-01f 1
28 -2.4588351e+04 1.72e-03 1.81e+05 -1.0 3.05e+03 - 9.86e-01 6.32e-01f 1
29 -2.9473721e+04 2.33e-10 5.40e+02 -1.0 1.82e+04 - 9.72e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -2.9860350e+04 1.16e-10 2.00e-07 -1.7 3.42e+04 - 1.00e+00 1.00e+00f 1
31 -2.9960875e+04 5.82e-11 5.77e+05 -5.7 2.30e+05 - 5.78e-01 8.66e-01f 1
32 -2.9976406e+04 1.16e-10 2.23e+05 -5.7 1.52e+05 - 6.73e-01 8.03e-01f 1
33 -2.9980502e+04 1.16e-10 1.22e+04 -5.7 6.79e+04 - 9.45e-01 9.42e-01f 1
34 -2.9980596e+04 1.16e-10 1.27e+03 -5.7 1.24e+03 - 8.40e-01 5.33e-01f 1
35 -2.9980674e+04 1.16e-10 8.56e+01 -5.7 5.69e+02 - 9.65e-01 1.00e+00f 1
36 -2.9980674e+04 1.16e-10 1.85e-11 -5.7 1.21e+00 - 1.00e+00 1.00e+00h 1
37 -2.9980684e+04 5.82e-11 9.38e-13 -7.0 4.12e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 37
(scaled) (unscaled)
Objective...............: -2.9980684393758918e+02 -2.9980684393758918e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 5.8207660913467407e-11
Complementarity.........: 1.2644591487210187e-07 1.2644591487210186e-05
Overall NLP error.......: 1.2644591487210187e-07 1.2644591487210186e-05
Number of objective function evaluations = 38
Number of objective gradient evaluations = 38
Number of equality constraint evaluations = 38
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 38
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 37
Total CPU secs in IPOPT (w/o function evaluations) = 0.029
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 42982.68
Variable costs: 19558.20
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 359.33
Simulating time_step 2020-07-10 12:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.7332874e+04 2.91e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.7374545e+04 2.91e+05 9.90e+01 -1.0 2.60e+04 - 2.02e-04 1.94e-04h 1
2 -2.5536215e+04 2.91e+05 1.00e+02 -1.0 2.56e+04 - 2.15e-04 8.46e-04h 1
3 -1.9663940e+04 2.90e+05 1.00e+02 -1.0 1.68e+04 - 8.09e-04 1.94e-03h 1
4 3.3314386e+03 2.88e+05 1.01e+02 -1.0 2.39e+03 - 2.99e-03 6.85e-03h 1
5 4.7017564e+04 2.85e+05 9.95e+01 -1.0 4.06e+03 - 1.18e-02 1.29e-02h 1
6 4.9228735e+04 2.84e+05 2.84e+02 -1.0 1.44e+05 - 8.53e-02 6.78e-04h 1
7 5.0283995e+05 2.43e+05 1.02e+02 -1.0 7.41e+04 - 3.29e-02 1.45e-01h 1
8 3.0969551e+06 2.43e+03 1.47e+02 -1.0 2.56e+04 - 1.44e-01 9.90e-01h 1
9 3.0827999e+06 1.34e+03 5.11e+02 -1.0 3.09e+03 - 2.58e-02 4.47e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.0295703e+06 1.31e+01 1.34e+03 -1.0 3.20e+03 - 3.75e-01 9.90e-01f 1
11 2.9466905e+06 3.06e+00 4.58e+04 -1.0 5.02e+03 - 5.57e-01 7.67e-01f 1
12 2.7159562e+06 1.16e-10 5.88e+05 -1.0 1.05e+04 - 3.15e-01 1.00e+00f 1
13 2.4184178e+06 5.82e-11 6.78e+06 -1.0 1.21e+04 - 2.94e-01 1.00e+00f 1
14 1.8511060e+06 1.16e-10 6.38e+06 -1.0 3.43e+04 - 5.98e-02 1.00e+00f 1
15 1.5830782e+06 5.82e-11 6.29e+06 -1.0 5.49e+04 - 1.44e-02 1.68e-01f 1
16 1.5788738e+06 5.82e-11 5.70e+06 -1.0 8.31e+04 - 9.27e-02 1.91e-03f 1
17 7.1935487e+05 5.82e-11 5.69e+06 -1.0 8.70e+04 - 2.67e-03 3.88e-01f 1
18 7.1377591e+05 1.16e-10 2.78e+06 -1.0 5.75e+04 - 5.11e-01 3.21e-03f 1
19 6.7504773e+05 2.33e-10 1.03e+06 -1.0 5.98e+04 - 6.30e-01 3.24e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 5.9017586e+05 1.16e-10 2.06e+05 -1.0 5.72e+04 - 8.00e-01 9.29e-02f 1
21 5.8678460e+05 1.16e-10 1.99e+05 -1.0 1.45e+05 - 2.96e-02 1.05e-02f 1
22 5.6912508e+05 1.16e-10 1.99e+05 -1.0 1.31e+05 - 4.39e-04 4.87e-02f 1
23 4.3906586e+05 1.16e-10 1.14e+05 -1.0 2.78e+05 - 4.30e-01 2.52e-01f 1
24 6.6469425e+02 1.16e-10 9.99e+04 -1.0 5.53e+05 - 1.20e-01 5.97e-01f 1
25 -1.4700727e+04 1.16e-10 2.10e+03 -1.0 7.74e+03 - 9.79e-01 4.58e-01f 1
26 -2.8458884e+04 2.33e-10 4.03e+04 -1.7 2.31e+03 - 9.87e-01 9.92e-01f 1
27 -2.8559750e+04 2.33e-10 2.90e+02 -1.7 4.05e+04 - 9.97e-01 1.00e+00f 1
28 -2.8548615e+04 5.82e-11 2.00e-07 -1.7 1.33e+05 - 1.00e+00 1.00e+00f 1
29 -2.8662431e+04 1.16e-10 7.06e+05 -5.7 2.48e+05 - 5.56e-01 9.09e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -2.8675729e+04 1.16e-10 7.83e+04 -5.7 1.05e+05 - 8.50e-01 6.98e-01f 1
31 -2.8681273e+04 1.16e-10 1.22e+04 -5.7 5.02e+04 - 8.91e-01 9.57e-01f 1
32 -2.8681421e+04 1.16e-10 1.70e+03 -5.7 1.72e+03 - 8.70e-01 9.20e-01f 1
33 -2.8681430e+04 1.16e-10 1.85e-11 -5.7 1.26e+02 - 1.00e+00 1.00e+00f 1
34 -2.8681441e+04 2.33e-10 9.38e-13 -7.0 4.10e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 34
(scaled) (unscaled)
Objective...............: -2.8681441153736966e+02 -2.8681441153736967e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 3.2452344603764988e-07 3.2452344603764985e-05
Overall NLP error.......: 3.2452344603764988e-07 3.2452344603764985e-05
Number of objective function evaluations = 35
Number of objective gradient evaluations = 35
Number of equality constraint evaluations = 35
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 35
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 34
Total CPU secs in IPOPT (w/o function evaluations) = 0.027
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 44438.68
Variable costs: 21667.73
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 104.01
Simulating time_step 2020-07-10 13:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.6082729e+04 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.6123735e+04 1.64e+05 9.90e+01 -1.0 2.60e+04 - 2.02e-04 1.94e-04h 1
2 -2.4585559e+04 1.64e+05 1.00e+02 -1.0 2.56e+04 - 2.15e-04 8.46e-04h 1
3 -1.9648580e+04 1.63e+05 1.01e+02 -1.0 1.68e+04 - 7.93e-04 1.94e-03h 1
4 3.0348345e+00 1.62e+05 1.01e+02 -1.0 2.39e+03 - 2.15e-03 6.84e-03h 1
5 5.3126499e+04 1.59e+05 1.00e+02 -1.0 2.23e+03 - 1.13e-02 1.82e-02h 1
6 1.9431124e+05 1.51e+05 9.29e+01 -1.0 2.26e+03 - 6.17e-02 4.90e-02h 1
7 6.5677798e+05 1.26e+05 8.25e+01 -1.0 2.49e+03 - 1.41e-01 1.70e-01h 1
8 1.6034447e+06 7.27e+04 6.10e+01 -1.0 2.91e+03 - 3.37e-01 4.22e-01h 1
9 2.7247731e+06 6.96e+03 5.60e+01 -1.0 4.42e+03 - 4.23e-01 9.04e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.6975758e+06 6.95e+01 1.92e+02 -1.0 7.46e+03 - 2.80e-01 9.90e-01f 1
11 2.5000202e+06 5.32e-01 1.48e+04 -1.0 9.40e+03 - 3.66e-01 9.92e-01f 1
12 2.2259061e+06 1.16e-10 1.69e+06 -1.0 1.14e+04 - 2.81e-01 1.00e+00f 1
13 1.7476363e+06 5.82e-11 8.52e+06 -1.0 2.89e+04 - 8.71e-02 1.00e+00f 1
14 1.3303773e+06 5.82e-11 8.44e+06 -1.0 5.39e+04 - 9.19e-03 2.72e-01f 1
15 1.3236266e+06 1.16e-10 7.34e+06 -1.0 8.08e+04 - 1.30e-01 3.23e-03f 1
16 1.3096828e+06 1.16e-10 5.10e+06 -1.0 8.47e+04 - 3.06e-01 7.98e-03f 1
17 6.2083819e+05 1.16e-10 3.73e+06 -1.0 8.79e+04 - 2.68e-01 3.78e-01f 1
18 6.0998364e+05 1.16e-10 2.66e+05 -1.0 5.70e+04 - 9.29e-01 1.17e-02f 1
19 5.6213880e+05 1.16e-10 2.45e+05 -1.0 1.55e+05 - 7.94e-02 5.95e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 5.6084181e+05 2.33e-10 2.45e+05 -1.0 1.45e+05 - 9.97e-04 3.34e-03f 1
21 5.5146255e+05 1.75e-10 1.42e+05 -1.0 3.56e+05 - 4.22e-01 1.63e-02f 1
22 3.2997373e+05 1.16e-10 1.34e+05 -1.0 1.62e+05 - 5.26e-02 5.90e-01f 1
23 -1.0698603e+04 1.16e-10 1.15e+05 -1.0 4.71e+05 - 1.40e-01 5.91e-01f 1
24 -2.0556869e+04 1.16e-10 2.08e+03 -1.0 5.62e+03 - 9.82e-01 5.15e-01f 1
25 -2.7169307e+04 1.16e-10 4.46e+04 -1.7 2.07e+03 - 9.89e-01 9.95e-01f 1
26 -2.7195538e+04 1.16e-10 2.00e-07 -1.7 5.63e+04 - 1.00e+00 1.00e+00f 1
27 -2.7287348e+04 1.16e-10 2.40e+05 -5.7 1.90e+05 - 6.95e-01 8.15e-01f 1
28 -2.7308859e+04 2.33e-10 1.06e+05 -5.7 1.60e+05 - 7.21e-01 8.26e-01f 1
29 -2.7313654e+04 1.16e-10 2.83e+03 -5.7 6.28e+04 - 9.69e-01 9.63e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -2.7313760e+04 1.16e-10 4.76e+02 -5.7 5.84e+02 - 8.70e-01 9.15e-01f 1
31 -2.7313767e+04 1.16e-10 1.85e-11 -5.7 4.51e+01 - 1.00e+00 1.00e+00f 1
32 -2.7313778e+04 1.16e-10 9.13e-13 -7.0 4.14e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 32
(scaled) (unscaled)
Objective...............: -2.7313778099523239e+02 -2.7313778099523239e+04
Dual infeasibility......: 9.1304741545172874e-13 9.1304741545172874e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 3.2554899141017316e-07 3.2554899141017318e-05
Overall NLP error.......: 3.2554899141017316e-07 3.2554899141017318e-05
Number of objective function evaluations = 33
Number of objective gradient evaluations = 33
Number of equality constraint evaluations = 33
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 33
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 32
Total CPU secs in IPOPT (w/o function evaluations) = 0.023
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 43818.68
Variable costs: 27847.00
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 273.54
Simulating time_step 2020-07-10 14:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.4765463e+04 1.86e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.4806788e+04 1.86e+05 9.90e+01 -1.0 2.60e+04 - 2.02e-04 1.94e-04h 1
2 -2.3370324e+04 1.86e+05 1.00e+02 -1.0 2.56e+04 - 2.15e-04 8.46e-04h 1
3 -1.9119081e+04 1.85e+05 1.00e+02 -1.0 1.68e+04 - 8.09e-04 1.94e-03h 1
4 -2.8633248e+03 1.84e+05 1.01e+02 -1.0 2.26e+03 - 3.02e-03 6.85e-03h 1
5 4.4342014e+04 1.81e+05 1.00e+02 -1.0 2.23e+03 - 1.18e-02 1.94e-02h 1
6 1.7633403e+05 1.71e+05 9.09e+01 -1.0 2.27e+03 - 1.09e-01 5.48e-02h 1
7 7.4500040e+05 1.28e+05 8.67e+01 -1.0 2.57e+03 - 1.14e-01 2.51e-01h 1
8 1.5577219e+06 6.63e+04 6.37e+01 -1.0 2.95e+03 - 3.60e-01 4.81e-01h 1
9 2.3137285e+06 6.73e+03 5.88e+01 -1.0 4.67e+03 - 3.67e-01 8.99e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.3261840e+06 6.71e+01 1.81e+02 -1.0 7.16e+03 - 3.35e-01 9.90e-01h 1
11 2.2167633e+06 4.87e-01 1.79e+04 -1.0 9.70e+03 - 3.45e-01 9.93e-01f 1
12 2.0534864e+06 1.16e-10 2.04e+06 -1.0 1.12e+04 - 2.62e-01 1.00e+00f 1
13 1.6804529e+06 1.16e-10 8.30e+06 -1.0 2.78e+04 - 1.04e-01 1.00e+00f 1
14 1.2642124e+06 1.46e-10 8.21e+06 -1.0 4.92e+04 - 1.08e-02 2.85e-01f 1
15 1.2571542e+06 1.46e-10 6.92e+06 -1.0 8.15e+04 - 1.57e-01 3.39e-03f 1
16 1.2434220e+06 1.16e-10 3.33e+05 -1.0 8.36e+04 - 9.52e-01 7.97e-03f 1
17 5.1631882e+05 1.16e-10 2.81e+05 -1.0 9.50e+04 - 1.56e-01 3.70e-01f 1
18 5.0896787e+05 1.16e-10 1.21e+04 -1.0 5.56e+04 - 9.57e-01 6.43e-03f 1
19 4.9392749e+05 5.82e-11 6.77e+03 -1.0 5.02e+04 - 4.41e-01 2.78e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 2.5216721e+05 5.82e-11 6.73e+03 -1.0 1.07e+05 - 6.84e-03 4.65e-01f 1
21 1.5838033e+05 1.16e-10 2.80e+03 -1.0 2.41e+05 - 5.83e-01 3.28e-01f 1
22 -2.6937152e+04 1.16e-10 1.06e+03 -1.0 1.63e+05 - 6.22e-01 9.73e-01f 1
23 -2.9299239e+04 1.16e-10 3.81e+04 -1.7 3.24e+03 - 9.89e-01 9.85e-01f 1
24 -2.9312097e+04 1.16e-10 4.78e+02 -1.7 8.15e+04 - 9.94e-01 1.00e+00f 1
25 -2.9300049e+04 2.33e-10 2.00e-07 -1.7 9.15e+04 - 1.00e+00 1.00e+00f 1
26 -2.9390341e+04 5.82e-11 3.86e+05 -5.7 2.21e+05 - 6.25e-01 8.18e-01f 1
27 -2.9411361e+04 5.82e-11 3.30e+04 -5.7 1.05e+05 - 8.50e-01 7.81e-01f 1
28 -2.9417536e+04 2.33e-10 4.13e+03 -5.7 5.33e+04 - 9.41e-01 9.68e-01f 1
29 -2.9417643e+04 1.16e-10 7.73e+02 -5.7 7.00e+02 - 9.46e-01 7.77e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -2.9417671e+04 1.16e-10 1.85e-11 -5.7 1.53e+02 - 1.00e+00 1.00e+00f 1
31 -2.9417680e+04 1.16e-10 9.38e-13 -7.0 4.13e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 31
(scaled) (unscaled)
Objective...............: -2.9417680285220615e+02 -2.9417680285220613e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2766012563040392e-07 1.2766012563040392e-05
Overall NLP error.......: 1.2766012563040392e-07 1.2766012563040392e-05
Number of objective function evaluations = 32
Number of objective gradient evaluations = 32
Number of equality constraint evaluations = 32
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 32
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 31
Total CPU secs in IPOPT (w/o function evaluations) = 0.032
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 109114.67
Variable costs: 33817.63
Number on/offs: 2
Sum on/off ramps: 340.00
Sum nominal ramps: 416.18
Simulating time_step 2020-07-10 15:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.6869365e+04 2.91e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.6952029e+04 2.91e+05 9.90e+01 -1.0 2.60e+04 - 4.12e-04 3.82e-04h 1
2 -2.5514174e+04 2.91e+05 9.99e+01 -1.0 2.22e+04 - 3.89e-04 1.38e-03h 1
3 -1.6794566e+04 2.89e+05 1.01e+02 -1.0 5.99e+03 - 1.08e-03 6.69e-03h 1
4 2.9908520e+03 2.85e+05 1.01e+02 -1.0 2.76e+03 - 9.33e-03 1.39e-02h 1
5 3.7803919e+03 2.85e+05 3.54e+02 -1.0 1.22e+05 - 1.03e-01 5.16e-04h 1
6 4.9450258e+05 2.04e+05 2.71e+02 -1.0 3.00e+04 - 3.31e-02 2.84e-01h 1
7 9.5611486e+05 1.27e+05 1.83e+02 -1.0 2.17e+04 - 3.12e-01 3.75e-01h 1
8 1.4729700e+06 3.91e+04 1.16e+02 -1.0 1.34e+04 - 3.89e-01 6.93e-01h 1
9 1.6412983e+06 3.91e+02 1.26e+02 -1.0 6.36e+03 - 2.11e-01 9.90e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.5560777e+06 3.62e+00 3.20e+03 -1.0 7.59e+03 - 5.62e-01 9.91e-01f 1
11 1.3564780e+06 1.16e-10 7.09e+05 -1.0 1.37e+04 - 4.67e-02 1.00e+00f 1
12 1.0972765e+06 1.16e-10 7.81e+06 -1.0 1.53e+04 - 2.16e-01 1.00e+00f 1
13 7.4653732e+05 8.73e-11 7.55e+06 -1.0 4.89e+04 - 3.31e-02 5.55e-01f 1
14 7.3756369e+05 1.16e-10 7.17e+06 -1.0 8.85e+04 - 5.01e-02 6.61e-03f 1
15 7.3684254e+05 1.16e-10 5.68e+05 -1.0 8.97e+04 - 9.21e-01 7.21e-04f 1
16 5.2780196e+04 1.16e-10 5.42e+05 -1.0 5.79e+05 - 4.61e-02 3.89e-01f 1
17 4.8309477e+04 2.33e-10 3.34e+05 -1.0 7.45e+05 - 3.84e-01 3.02e-03f 1
18 1.7588936e+04 1.16e-10 1.49e+04 -1.0 5.81e+04 - 9.55e-01 4.95e-02f 1
19 5.1670677e+03 1.46e-10 8.82e+03 -1.0 3.87e+04 - 4.08e-01 2.93e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.3691465e+03 1.16e-10 3.17e+03 -1.0 9.49e+04 - 6.40e-01 1.12e-01f 1
21 -2.7492994e+04 1.16e-10 5.25e+01 -1.0 6.47e+03 - 9.83e-01 9.93e-01f 1
22 -2.8102717e+04 1.16e-10 8.74e+05 -3.8 2.73e+04 - 9.08e-01 9.96e-01f 1
23 -2.8111183e+04 1.16e-10 2.17e+05 -3.8 1.73e+05 - 7.58e-01 8.73e-01f 1
24 -2.8114733e+04 1.16e-10 9.92e+04 -3.8 1.53e+05 - 5.53e-01 1.00e+00f 1
25 -2.8116062e+04 1.16e-10 1.03e+03 -3.8 6.45e+04 - 9.90e-01 1.00e+00f 1
26 -2.8116094e+04 1.16e-10 1.50e-09 -3.8 1.24e+03 - 1.00e+00 1.00e+00f 1
27 -2.8116894e+04 1.16e-10 1.87e+03 -5.7 3.46e+03 - 1.00e+00 8.74e-01f 1
28 -2.8116994e+04 5.82e-11 2.94e+02 -5.7 4.44e+02 - 8.93e-01 1.00e+00f 1
29 -2.8116992e+04 1.16e-10 1.85e-11 -5.7 1.90e-02 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -2.8117002e+04 2.33e-10 9.24e-13 -7.0 4.12e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 30
(scaled) (unscaled)
Objective...............: -2.8117002241856699e+02 -2.8117002241856699e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 1.2391525778005693e-07 1.2391525778005693e-05
Overall NLP error.......: 1.2391525778005693e-07 1.2391525778005693e-05
Number of objective function evaluations = 31
Number of objective gradient evaluations = 31
Number of equality constraint evaluations = 31
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 31
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 30
Total CPU secs in IPOPT (w/o function evaluations) = 0.016
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
Fixed costs: 118869.80
Variable costs: 26061.00
Number on/offs: 2
Sum on/off ramps: 340.00
Sum nominal ramps: 537.34
Simulating time_step 2020-07-10 16:00
Creating and solving SCED to determine UC initial conditions for date: 2020-07-11 hour: 0
Using persistent forecast error model when projecting demand and renewables in SCED
Extracting scenario to simulate
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.5617786e+04 2.91e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.5700457e+04 2.91e+05 9.90e+01 -1.0 2.60e+04 - 4.12e-04 3.82e-04h 1
2 -2.4265358e+04 2.91e+05 9.99e+01 -1.0 2.22e+04 - 3.89e-04 1.38e-03h 1
3 -8.6110383e+03 2.87e+05 1.03e+02 -1.0 6.01e+03 - 1.08e-03 1.20e-02h 1
4 4.5705404e+03 2.84e+05 9.68e+01 -1.0 7.36e+03 - 5.05e-01 9.07e-03h 1
5 6.2005291e+04 2.72e+05 9.25e+01 -1.0 1.69e+05 - 2.78e-02 4.45e-02h 1
6 8.4052456e+04 2.67e+05 9.08e+01 -1.0 1.11e+05 - 8.25e-02 1.88e-02h 1
7 1.1391831e+06 2.67e+03 1.21e+02 -1.0 2.84e+04 - 4.90e-03 9.90e-01h 1
8 1.0920352e+06 2.64e+01 8.30e+02 -1.0 5.34e+03 - 2.30e-01 9.90e-01f 1
9 1.0187578e+06 5.82e-11 5.17e+04 -1.0 7.03e+03 - 5.27e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 8.8278517e+05 1.16e-10 7.12e+06 -1.0 1.46e+04 - 2.84e-01 1.00e+00f 1
11 7.4582515e+05 1.16e-10 5.76e+06 -1.0 1.99e+04 - 1.91e-01 1.00e+00f 1
12 5.8765119e+05 5.82e-11 5.61e+06 -1.0 2.37e+04 - 2.56e-02 1.00e+00f 1
13 1.1207508e+05 5.82e-11 5.22e+06 -1.0 8.63e+04 - 7.07e-02 5.03e-01f 1
14 1.0324864e+05 1.16e-10 5.08e+06 -1.0 5.05e+04 - 2.53e-02 8.59e-03f 1
15 1.0302630e+05 1.16e-10 4.81e+06 -1.0 5.80e+04 - 5.45e-02 2.99e-04f 1
16 2.0374099e+03 1.16e-10 2.87e+06 -1.0 5.86e+04 - 4.04e-01 1.68e-01f 1
17 1.0152121e+03 5.82e-11 2.24e+06 -1.0 4.50e+04 - 2.19e-01 2.18e-03f 1
18 -1.5377199e+04 1.16e-10 7.31e+04 -1.0 2.28e+03 - 9.67e-01 7.22e-01f 1
19 -2.6399887e+04 5.82e-11 1.25e+03 -1.0 1.12e+03 - 9.83e-01 9.96e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 -2.6734022e+04 5.82e-11 9.28e+04 -1.7 2.59e+03 - 9.88e-01 1.00e+00f 1
21 -2.6724253e+04 5.82e-11 2.00e-07 -1.7 5.66e+04 - 1.00e+00 1.00e+00f 1
22 -2.6804204e+04 5.82e-11 2.55e+05 -5.7 1.69e+05 - 7.32e-01 8.59e-01f 1
23 -2.6820995e+04 1.16e-10 2.25e+05 -5.7 1.53e+05 - 5.74e-01 9.88e-01f 1
24 -2.6821951e+04 5.82e-11 3.00e+03 -5.7 4.31e+04 - 9.85e-01 8.73e-01f 1
25 -2.6822057e+04 5.82e-11 2.53e-02 -5.7 4.11e+03 - 1.00e+00 1.00e+00f 1
26 -2.6822057e+04 1.16e-10 2.00e+01 -5.7 4.07e+01 - 5.05e-01 1.00e+00f 1
27 -2.6822057e+04 5.82e-11 1.85e-11 -5.7 7.74e+00 - 1.00e+00 1.00e+00f 1
28 -2.6822067e+04 2.33e-10 9.38e-13 -7.0 4.33e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 28
(scaled) (unscaled)
Objective...............: -2.6822067110131451e+02 -2.6822067110131451e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 1.2652833647367491e-07 1.2652833647367490e-05
Overall NLP error.......: 1.2652833647367491e-07 1.2652833647367490e-05
Number of objective function evaluations = 29
Number of objective gradient evaluations = 29
Number of equality constraint evaluations = 29
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 29
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 28
Total CPU secs in IPOPT (w/o function evaluations) = 0.022
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.4371949e+04 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.4453313e+04 1.64e+05 9.90e+01 -1.0 2.53e+04 - 4.12e-04 3.82e-04f 1
2 -2.3686252e+04 1.64e+05 9.98e+01 -1.0 2.10e+04 - 4.75e-04 1.38e-03h 1
3 -1.3535249e+04 1.62e+05 1.02e+02 -1.0 2.72e+03 - 1.06e-03 1.21e-02h 1
4 1.1550301e+05 1.40e+05 1.04e+02 -1.0 1.28e+03 - 5.01e-02 1.30e-01h 1
5 1.7010489e+05 1.31e+05 7.92e+01 -1.0 2.43e+03 - 2.02e-01 6.77e-02h 1
6 9.3323841e+05 1.31e+03 5.01e+01 -1.0 3.06e+03 - 6.60e-01 9.90e-01h 1
7 8.6517437e+05 2.13e+02 8.73e+02 -1.0 8.92e+03 - 1.40e-01 8.37e-01f 1
8 7.7156619e+05 1.97e+00 4.80e+03 -1.0 9.65e+03 - 3.67e-01 9.91e-01f 1
9 6.5208281e+05 5.82e-11 5.28e+05 -1.0 1.20e+04 - 3.12e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 5.4375628e+05 5.82e-11 9.22e+06 -1.0 1.00e+04 - 5.54e-02 1.00e+00f 1
11 9.8786042e+03 5.82e-11 9.06e+06 -1.0 5.11e+04 - 1.75e-02 9.50e-01f 1
12 4.7945421e+03 1.16e-10 2.68e+05 -1.0 5.01e+04 - 9.70e-01 9.69e-03f 1
13 4.5707808e+03 1.16e-10 1.02e+04 -1.0 4.71e+03 - 9.62e-01 5.86e-03f 1
14 -2.4849117e+04 5.82e-11 2.10e+02 -1.0 2.33e+04 - 9.80e-01 9.87e-01f 1
15 -2.5440115e+04 5.82e-11 9.40e+04 -2.5 1.24e+03 - 9.90e-01 1.00e+00f 1
16 -2.5438175e+04 1.16e-10 5.30e+04 -2.5 1.33e+05 - 4.36e-01 1.00e+00f 1
17 -2.5441508e+04 5.82e-11 2.83e-08 -2.5 2.02e+05 - 1.00e+00 1.00e+00f 1
18 -2.5458432e+04 1.16e-10 4.09e+04 -5.7 3.51e+04 - 8.50e-01 9.95e-01f 1
19 -2.5458701e+04 1.16e-10 4.12e+02 -5.7 5.41e+03 - 9.90e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 -2.5458702e+04 1.16e-10 1.85e-11 -5.7 1.73e+01 - 1.00e+00 1.00e+00f 1
21 -2.5458712e+04 5.82e-11 9.24e-13 -7.0 4.17e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: -2.5458712118622870e+02 -2.5458712118622869e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 5.8207660913467407e-11
Complementarity.........: 1.2645480861661295e-07 1.2645480861661296e-05
Overall NLP error.......: 1.2645480861661295e-07 1.2645480861661296e-05
Number of objective function evaluations = 22
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 22
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.016
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.3058990e+04 4.00e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.3140324e+04 3.99e+05 9.90e+01 -1.0 1.11e+02 - 4.12e-04 3.82e-04h 1
2 -1.9469341e+04 3.95e+05 1.00e+02 -1.0 1.11e+02 - 4.75e-04 1.14e-02h 1
3 7.8677509e+04 3.20e+05 7.90e+01 -1.0 1.10e+02 - 3.65e-01 1.91e-01h 1
4 2.3331637e+05 1.94e+05 5.19e+01 -1.0 8.88e+01 - 2.05e-01 3.92e-01h 1
5 4.7571655e+05 1.94e+03 5.97e+01 -1.0 5.39e+01 - 4.26e-01 9.90e-01h 1
6 4.7787048e+05 1.90e+01 1.45e+03 -1.0 3.51e+00 - 2.87e-01 9.90e-01h 1
7 4.7788828e+05 9.51e+00 3.56e+04 -1.0 1.00e+01 - 3.31e-01 5.00e-01f 2
8 4.7761489e+05 1.16e-10 2.80e+05 -1.0 3.40e+01 - 3.02e-01 1.00e+00f 1
9 4.7007565e+05 1.16e-10 9.26e+06 -1.0 7.50e+02 - 5.60e-02 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.6092329e+04 5.82e-11 9.10e+06 -1.0 4.41e+04 - 1.78e-02 1.00e+00f 1
11 -2.5015465e+04 5.82e-11 9.56e+05 -1.0 5.46e+04 - 8.95e-01 9.30e-02f 1
12 -2.5526534e+04 5.82e-11 1.52e+04 -1.0 3.85e+04 - 9.84e-01 1.32e-03f 1
13 -2.5479093e+04 1.16e-10 1.64e+02 -1.0 1.07e+03 - 9.89e-01 1.00e+00f 1
14 -2.5829516e+04 5.82e-11 2.65e+04 -2.5 1.75e+03 - 9.97e-01 1.00e+00f 1
15 -2.5824427e+04 5.82e-11 2.83e-08 -2.5 2.43e+04 - 1.00e+00 1.00e+00f 1
16 -2.5838140e+04 1.16e-10 1.29e+04 -5.7 2.61e+04 - 8.58e-01 9.03e-01f 1
17 -2.5839386e+04 5.82e-11 1.47e+02 -5.7 3.64e+03 - 9.99e-01 9.94e-01f 1
18 -2.5839393e+04 5.82e-11 1.85e-11 -5.7 2.20e+01 - 1.00e+00 1.00e+00f 1
19 -2.5839402e+04 5.82e-11 9.24e-13 -7.0 1.74e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: -2.5839402011179084e+02 -2.5839402011179081e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 5.8207660913467407e-11
Complementarity.........: 1.3650734054962958e-07 1.3650734054962958e-05
Overall NLP error.......: 1.3650734054962958e-07 1.3650734054962958e-05
Number of objective function evaluations = 21
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.015
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.3439684e+04 5.00e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.3522250e+04 5.00e+03 9.90e+01 -1.0 2.59e+01 - 4.12e-04 3.82e-04f 1
2 -1.9888137e+04 4.94e+03 1.00e+02 -1.0 5.00e+01 - 4.75e-04 1.14e-02h 1
3 7.7651588e+04 4.00e+03 7.90e+01 -1.0 4.94e+01 - 7.80e-01 1.91e-01h 1
4 4.0564292e+05 6.85e+02 2.16e+01 -1.0 4.00e+01 - 2.02e-01 8.29e-01h 1
5 4.7348675e+05 6.84e+00 3.82e+01 -1.0 1.73e+01 - 4.69e-01 9.90e-01h 1
6 4.6345474e+05 6.35e-02 7.06e+03 -1.0 1.07e+03 - 2.40e-02 9.91e-01f 1
7 -2.4291431e+04 9.38e-03 6.10e+05 -1.0 5.68e+04 - 1.89e-02 8.52e-01f 1
8 -2.9168922e+04 9.29e-03 2.80e+06 -1.0 5.02e+04 - 9.90e-01 9.64e-03f 1
9 -2.9217680e+04 9.24e-03 5.04e+06 -1.0 1.02e+03 - 9.88e-01 4.75e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -2.9191960e+04 5.82e-11 1.40e+04 -1.0 1.12e+04 - 9.91e-01 1.00e+00f 1
11 -2.9152895e+04 1.16e-10 1.33e+06 -1.0 3.48e+05 - 1.00e+00 5.21e-01f 1
12 -2.9103423e+04 1.16e-10 1.82e+05 -1.0 3.78e+05 - 1.00e+00 8.63e-01f 1
13 -2.9107759e+04 1.16e-10 1.00e-06 -1.0 8.09e+04 - 1.00e+00 1.00e+00f 1
14 -2.9368706e+04 5.82e-11 2.03e+06 -5.7 1.60e+05 - 7.57e-01 9.60e-01f 1
15 -2.9434393e+04 1.16e-10 1.29e+06 -5.7 3.57e+05 - 4.69e-01 9.96e-01f 1
16 -2.9440937e+04 1.16e-10 5.94e+05 -5.7 7.67e+04 - 5.39e-01 9.14e-01f 1
17 -2.9442864e+04 1.16e-10 3.85e+04 -5.7 4.16e+04 - 9.35e-01 9.90e-01f 1
18 -2.9442966e+04 5.82e-11 2.28e-02 -5.7 2.91e+03 - 1.00e+00 9.82e-01f 1
19 -2.9442966e+04 5.82e-11 1.85e-11 -5.7 1.83e+01 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 -2.9442974e+04 1.16e-10 9.24e-13 -7.0 1.74e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 20
(scaled) (unscaled)
Objective...............: -2.9442974322140378e+02 -2.9442974322140377e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 9.1088471545660851e-08 9.1088471545660845e-06
Overall NLP error.......: 9.1088471545660851e-08 9.1088471545660845e-06
Number of objective function evaluations = 21
Number of objective gradient evaluations = 21
Number of equality constraint evaluations = 21
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 21
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 20
Total CPU secs in IPOPT (w/o function evaluations) = 0.018
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.7042975e+04 1.00e-02 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.9408672e+04 9.89e-03 1.08e+01 -1.0 7.90e+00 - 9.90e-01 1.10e-02f 1
2 -2.9202851e+04 9.89e-05 1.08e-01 -1.0 9.85e+00 - 9.90e-01 9.90e-01h 1
3 -2.9198319e+04 9.79e-07 5.17e-01 -1.0 9.84e+02 - 9.91e-01 9.90e-01f 1
4 -2.9173280e+04 1.16e-10 1.00e-06 -1.0 8.80e+04 - 1.00e+00 1.00e+00f 1
5 -2.9430087e+04 5.82e-11 1.19e+04 -3.8 4.83e+04 - 8.56e-01 9.93e-01f 1
6 -2.9440655e+04 1.16e-10 1.02e+03 -3.8 6.36e+04 - 9.15e-01 9.23e-01f 1
7 -2.9442268e+04 1.16e-10 7.28e+01 -3.8 2.36e+04 - 9.32e-01 1.00e+00f 1
8 -2.9442268e+04 1.16e-10 1.50e-09 -3.8 3.81e+02 - 1.00e+00 1.00e+00f 1
9 -2.9442966e+04 5.82e-11 1.85e-11 -5.7 1.47e+03 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -2.9442974e+04 5.82e-11 9.24e-13 -7.0 1.84e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 10
(scaled) (unscaled)
Objective...............: -2.9442974322176036e+02 -2.9442974322176036e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 5.8207660913467407e-11
Complementarity.........: 9.1235823999943838e-08 9.1235823999943832e-06
Overall NLP error.......: 9.1235823999943838e-08 9.1235823999943832e-06
Number of objective function evaluations = 11
Number of objective gradient evaluations = 11
Number of equality constraint evaluations = 11
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 11
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 10
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.7042975e+04 1.00e-02 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.9408672e+04 9.89e-03 1.08e+01 -1.0 7.90e+00 - 9.90e-01 1.10e-02f 1
2 -2.9202851e+04 9.89e-05 1.08e-01 -1.0 9.85e+00 - 9.90e-01 9.90e-01h 1
3 -2.9198319e+04 9.79e-07 5.17e-01 -1.0 9.84e+02 - 9.91e-01 9.90e-01f 1
4 -2.9173280e+04 5.82e-11 1.00e-06 -1.0 8.80e+04 - 1.00e+00 1.00e+00f 1
5 -2.9430087e+04 5.82e-11 1.19e+04 -3.8 4.83e+04 - 8.56e-01 9.93e-01f 1
6 -2.9440655e+04 1.16e-10 1.02e+03 -3.8 6.36e+04 - 9.15e-01 9.23e-01f 1
7 -2.9442268e+04 1.16e-10 7.28e+01 -3.8 2.36e+04 - 9.32e-01 1.00e+00f 1
8 -2.9442268e+04 5.82e-11 1.50e-09 -3.8 3.81e+02 - 1.00e+00 1.00e+00f 1
9 -2.9442966e+04 5.82e-11 1.85e-11 -5.7 1.47e+03 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -2.9442974e+04 5.82e-11 9.24e-13 -7.0 1.84e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 10
(scaled) (unscaled)
Objective...............: -2.9442974322176042e+02 -2.9442974322176040e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 5.8207660913467407e-11
Complementarity.........: 9.1235823999923126e-08 9.1235823999923131e-06
Overall NLP error.......: 9.1235823999923126e-08 9.1235823999923131e-06
Number of objective function evaluations = 11
Number of objective gradient evaluations = 11
Number of equality constraint evaluations = 11
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 11
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 10
Total CPU secs in IPOPT (w/o function evaluations) = 0.011
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.7042975e+04 1.00e-02 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.9408672e+04 9.89e-03 1.08e+01 -1.0 7.90e+00 - 9.90e-01 1.10e-02f 1
2 -2.9202851e+04 9.89e-05 1.08e-01 -1.0 9.85e+00 - 9.90e-01 9.90e-01h 1
3 -2.9198319e+04 9.79e-07 5.17e-01 -1.0 9.84e+02 - 9.91e-01 9.90e-01f 1
4 -2.9173280e+04 1.16e-10 1.00e-06 -1.0 8.80e+04 - 1.00e+00 1.00e+00f 1
5 -2.9430087e+04 1.16e-10 1.19e+04 -3.8 4.83e+04 - 8.56e-01 9.93e-01f 1
6 -2.9440655e+04 1.16e-10 1.02e+03 -3.8 6.36e+04 - 9.15e-01 9.23e-01f 1
7 -2.9442268e+04 1.16e-10 7.28e+01 -3.8 2.36e+04 - 9.32e-01 1.00e+00f 1
8 -2.9442268e+04 5.82e-11 1.50e-09 -3.8 3.81e+02 - 1.00e+00 1.00e+00f 1
9 -2.9442966e+04 5.82e-11 1.85e-11 -5.7 1.47e+03 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -2.9442974e+04 1.16e-10 9.24e-13 -7.0 1.84e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 10
(scaled) (unscaled)
Objective...............: -2.9442974322176036e+02 -2.9442974322176036e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 9.1235823999924264e-08 9.1235823999924266e-06
Overall NLP error.......: 9.1235823999924264e-08 9.1235823999924266e-06
Number of objective function evaluations = 11
Number of objective gradient evaluations = 11
Number of equality constraint evaluations = 11
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 11
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 10
Total CPU secs in IPOPT (w/o function evaluations) = 0.007
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.7042975e+04 1.00e-02 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.9408672e+04 9.89e-03 1.08e+01 -1.0 7.90e+00 - 9.90e-01 1.10e-02f 1
2 -2.9202851e+04 9.89e-05 1.08e-01 -1.0 9.85e+00 - 9.90e-01 9.90e-01h 1
3 -2.9198319e+04 9.79e-07 5.17e-01 -1.0 9.84e+02 - 9.91e-01 9.90e-01f 1
4 -2.9173280e+04 5.82e-11 1.00e-06 -1.0 8.80e+04 - 1.00e+00 1.00e+00f 1
5 -2.9430087e+04 5.82e-11 1.19e+04 -3.8 4.83e+04 - 8.56e-01 9.93e-01f 1
6 -2.9440655e+04 5.82e-11 1.02e+03 -3.8 6.36e+04 - 9.15e-01 9.23e-01f 1
7 -2.9442268e+04 5.82e-11 7.28e+01 -3.8 2.36e+04 - 9.32e-01 1.00e+00f 1
8 -2.9442268e+04 5.82e-11 1.50e-09 -3.8 3.81e+02 - 1.00e+00 1.00e+00f 1
9 -2.9442966e+04 1.16e-10 1.85e-11 -5.7 1.47e+03 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -2.9442974e+04 1.16e-10 9.24e-13 -7.0 1.84e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 10
(scaled) (unscaled)
Objective...............: -2.9442974322176036e+02 -2.9442974322176036e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 9.1235823999924489e-08 9.1235823999924486e-06
Overall NLP error.......: 9.1235823999924489e-08 9.1235823999924486e-06
Number of objective function evaluations = 11
Number of objective gradient evaluations = 11
Number of equality constraint evaluations = 11
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 11
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 10
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 6903
Number of nonzeros in inequality constraint Jacobian.: 536
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 4317
variables with only lower bounds: 864
variables with lower and upper bounds: 3309
variables with only upper bounds: 144
Total number of equality constraints.................: 4029
Total number of inequality constraints...............: 288
inequality constraints with only lower bounds: 288
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -1.9472200e+06 3.11e+04 3.38e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.9472205e+06 3.10e+04 2.80e+00 -1.0 9.77e+04 - 2.98e-04 7.79e-05h 1
2 -1.9472203e+06 3.10e+04 2.39e+00 -1.0 9.97e+04 - 5.38e-05 6.88e-05h 1
3 -1.9472198e+06 3.10e+04 8.23e+00 -1.0 9.99e+04 - 2.22e-04 1.27e-04h 1
4 -1.9472202e+06 3.10e+04 1.23e+01 -1.0 1.00e+05 - 1.54e-05 5.33e-04h 1
5 -1.9472215e+06 3.10e+04 2.42e+01 -1.0 9.99e+04 - 1.70e-03 5.98e-04h 1
6 -1.9472242e+06 3.10e+04 1.52e+01 -1.0 9.99e+04 - 9.18e-04 1.26e-03h 1
7 -1.9472267e+06 3.09e+04 2.79e+00 -1.0 9.97e+04 - 5.12e-04 1.26e-03h 1
8 -1.9472335e+06 3.08e+04 5.78e+01 -1.0 9.96e+04 - 1.03e-03 4.01e-03f 1
9 -1.9472327e+06 3.08e+04 6.43e+01 -1.0 1.45e+05 - 6.36e-04 1.11e-03h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -1.9472315e+06 3.08e+04 5.23e+01 -1.0 3.91e+05 - 9.95e-03 5.98e-04h 1
11 -1.9472201e+06 3.07e+04 5.15e+01 -1.0 3.80e+05 - 2.98e-03 3.09e-03h 1
12 -1.9472088e+06 3.06e+04 8.25e+01 -1.0 3.62e+05 - 5.77e-03 1.44e-03h 1
13 -1.9471674e+06 3.05e+04 5.87e+01 -1.0 3.62e+05 - 1.15e-04 3.74e-03h 1
14 -1.9471166e+06 3.04e+04 1.94e+02 -1.0 3.62e+05 - 1.47e-02 4.13e-03h 1
15 -1.9470525e+06 3.03e+04 1.58e+02 -1.0 3.86e+05 - 3.69e-04 3.47e-03h 1
16 -1.9470221e+06 3.02e+04 1.82e+02 -1.0 4.13e+05 - 3.55e-03 1.29e-03h 1
17 -1.9470049e+06 3.02e+04 1.76e+02 -1.0 4.40e+05 - 1.52e-04 7.17e-04h 1
18 -1.9469838e+06 3.02e+04 1.70e+02 -1.0 4.43e+05 - 3.27e-04 9.88e-04h 1
19 -1.9469416e+06 3.01e+04 1.75e+02 -1.0 4.46e+05 - 2.58e-03 1.94e-03h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 -1.9468893e+06 3.01e+04 1.77e+02 -1.0 4.51e+05 - 2.35e-03 2.08e-03h 1
21 -1.9467242e+06 2.99e+04 1.37e+02 -1.0 4.48e+05 - 1.09e-03 6.25e-03h 1
22 -1.9466573e+06 2.98e+04 1.32e+02 -1.0 4.38e+05 - 1.54e-03 2.26e-03h 1
23 -1.9465307e+06 2.97e+04 1.09e+02 -1.0 4.32e+05 - 1.16e-03 4.94e-03h 1
24 -1.9463708e+06 2.95e+04 1.37e+02 -1.0 4.20e+05 - 1.12e-02 5.91e-03h 1
25 -1.9462185e+06 2.93e+04 1.88e+02 -1.0 3.87e+05 - 1.82e-02 4.56e-03h 1
26 -1.9454550e+06 2.87e+04 2.04e+02 -1.0 3.33e+05 - 3.02e-02 2.12e-02h 1
27 -1.9448299e+06 2.83e+04 2.01e+02 -1.0 1.88e+05 - 1.56e-02 1.56e-02h 1
28 -1.9436496e+06 2.75e+04 1.91e+02 -1.0 1.32e+05 - 1.45e-02 2.90e-02h 1
29 -1.9423776e+06 2.66e+04 1.87e+02 -1.0 9.72e+04 - 4.70e-02 3.14e-02h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -1.9415884e+06 2.61e+04 1.78e+02 -1.0 8.56e+04 - 1.01e-01 1.97e-02h 1
31 -1.9398715e+06 2.50e+04 1.71e+02 -1.0 8.40e+04 - 3.90e-02 4.28e-02h 1
32 -1.9380121e+06 2.38e+04 1.66e+02 -1.0 8.04e+04 - 3.12e-02 4.81e-02h 1
33 -1.9376389e+06 2.35e+04 1.66e+02 -1.0 7.65e+04 - 5.30e-03 1.01e-02h 1
34 -1.9363534e+06 2.27e+04 1.45e+02 -1.0 7.57e+04 - 9.87e-02 3.49e-02h 1
35 -1.9338367e+06 2.11e+04 1.49e+02 -1.0 7.31e+04 - 1.55e-02 7.05e-02h 1
36 -1.9326919e+06 2.04e+04 1.47e+02 -1.0 6.79e+04 - 2.24e-02 3.43e-02h 1
37 -1.9300710e+06 1.87e+04 1.44e+02 -1.0 6.78e+04 - 4.81e-02 8.13e-02h 1
38 -1.9293425e+06 1.83e+04 1.45e+02 -1.0 6.73e+04 - 9.77e-03 2.47e-02h 1
39 -1.9285172e+06 1.77e+04 1.47e+02 -1.0 6.69e+04 - 5.43e-03 2.98e-02h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -1.9283299e+06 1.76e+04 1.45e+02 -1.0 6.63e+04 - 1.27e-02 7.62e-03h 1
41 -1.9280734e+06 1.74e+04 1.40e+02 -1.0 6.65e+04 - 1.96e-02 9.84e-03h 1
42 -1.9274124e+06 1.70e+04 1.30e+02 -1.0 6.71e+04 - 4.71e-02 2.58e-02h 1
43 -1.9271469e+06 1.68e+04 1.28e+02 -1.0 6.99e+04 - 1.51e-02 1.02e-02h 1
44 -1.9265047e+06 1.64e+04 1.29e+02 -1.0 7.01e+04 - 9.01e-03 2.50e-02h 1
45 -1.9260249e+06 1.60e+04 1.07e+02 -1.0 6.96e+04 - 8.27e-02 1.90e-02h 1
46 -1.9242419e+06 1.49e+04 1.05e+02 -1.0 7.22e+04 - 5.32e-02 7.28e-02h 1
47 -1.9232042e+06 1.42e+04 9.53e+01 -1.0 7.14e+04 - 6.36e-02 4.63e-02h 1
48 -1.9212135e+06 1.29e+04 9.03e+01 -1.0 7.19e+04 - 8.10e-02 9.42e-02h 1
49 -1.9204594e+06 1.23e+04 9.48e+01 -1.0 7.06e+04 - 1.34e-02 4.00e-02h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
50 -1.9192243e+06 1.15e+04 1.04e+02 -1.0 6.94e+04 - 1.83e-02 6.87e-02h 1
51 -1.9190933e+06 1.14e+04 9.43e+01 -1.0 6.71e+04 - 3.54e-02 7.86e-03h 1
52 -1.9183745e+06 1.09e+04 6.98e+01 -1.0 6.78e+04 - 2.78e-01 4.32e-02h 1
53 -1.9165127e+06 9.56e+03 6.15e+01 -1.0 7.55e+04 - 8.05e-02 1.24e-01h 1
54 -1.9155451e+06 8.82e+03 5.54e+01 -1.0 7.19e+04 - 9.79e-02 7.71e-02h 1
55 -1.9149323e+06 8.33e+03 1.22e+02 -1.0 1.19e+05 - 2.48e-01 5.55e-02h 1
56 -1.9148162e+06 8.23e+03 1.81e+02 -1.0 1.16e+05 - 3.18e-01 1.18e-02h 1
57 -1.9127545e+06 6.26e+03 1.38e+02 -1.0 1.07e+05 - 2.53e-01 2.40e-01h 1
58 -1.9121858e+06 5.52e+03 1.05e+02 -1.0 8.20e+04 - 3.48e-01 1.17e-01h 1
59 -1.9119593e+06 4.96e+03 9.99e+01 -1.0 9.11e+04 - 6.03e-02 1.03e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
60 -1.9118235e+06 4.42e+03 1.02e+02 -1.0 8.86e+04 - 2.05e-02 1.08e-01h 1
61 -1.9118098e+06 4.26e+03 1.01e+02 -1.0 8.46e+04 - 2.23e-02 3.57e-02h 1
62 -1.9118796e+06 4.13e+03 1.19e+02 -1.0 8.42e+04 - 6.28e-03 3.14e-02f 1
63 -1.9118798e+06 4.12e+03 1.09e+02 -1.0 8.32e+04 - 5.96e-02 2.08e-03h 1
64 -1.9118754e+06 3.80e+03 1.01e+02 -1.0 8.60e+04 - 1.34e-02 7.73e-02h 1
65 -1.9119140e+06 3.37e+03 9.67e+01 -1.0 8.38e+04 - 8.62e-02 1.13e-01f 1
66 -1.9120320e+06 3.06e+03 8.45e+01 -1.0 8.45e+04 - 1.04e-01 9.30e-02f 1
67 -1.9121859e+06 2.85e+03 7.55e+01 -1.0 8.80e+04 - 1.65e-01 6.73e-02f 1
68 -1.9124339e+06 2.65e+03 6.97e+01 -1.0 9.84e+04 - 1.57e-01 7.05e-02f 1
69 -1.9133664e+06 2.15e+03 5.65e+01 -1.0 1.11e+05 - 1.92e-01 1.90e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
70 -1.9135605e+06 2.09e+03 1.47e+02 -1.0 1.29e+05 - 3.65e-01 2.69e-02f 1
71 -1.9136524e+06 2.07e+03 1.55e+02 -1.0 1.97e+05 - 5.74e-02 1.02e-02f 1
72 -1.9148573e+06 1.81e+03 1.25e+02 -1.0 2.08e+05 - 6.78e-02 1.25e-01f 1
73 -1.9154335e+06 1.72e+03 1.09e+02 -1.0 2.22e+05 - 8.66e-04 4.99e-02f 1
74 -1.9173343e+06 1.53e+03 1.09e+02 -1.0 4.96e+05 - 1.69e-01 1.08e-01f 1
75 -1.9178571e+06 1.50e+03 1.05e+02 -1.0 6.62e+05 - 1.65e-02 2.35e-02f 1
76 -1.9187137e+06 1.44e+03 1.00e+02 -1.0 6.80e+05 - 3.17e-02 3.72e-02f 1
77 -1.9204659e+06 1.34e+03 9.28e+01 -1.0 7.08e+05 - 5.14e-02 7.28e-02f 1
78 -1.9211088e+06 1.31e+03 9.26e+01 -1.0 7.41e+05 - 1.28e-03 2.34e-02f 1
79 -1.9214410e+06 1.29e+03 9.74e+01 -1.0 7.36e+05 - 1.05e-01 1.23e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
80 -1.9232381e+06 1.21e+03 8.56e+01 -1.0 7.83e+05 - 1.94e-02 6.05e-02f 1
81 -1.9244234e+06 1.17e+03 9.25e+01 -1.0 7.47e+05 - 9.19e-03 3.71e-02f 1
82 -1.9252291e+06 1.14e+03 9.42e+01 -1.0 7.13e+05 - 1.50e-01 2.55e-02f 1
83 -1.9269706e+06 1.08e+03 8.94e+01 -1.0 6.49e+05 - 4.87e-02 4.96e-02f 1
84 -1.9270080e+06 1.08e+03 1.10e+02 -1.0 5.54e+05 - 1.68e-01 1.22e-03f 1
85 -1.9300755e+06 9.73e+02 9.77e+01 -1.0 7.88e+05 - 8.70e-02 9.78e-02f 1
86 -1.9301374e+06 9.71e+02 1.42e+02 -1.0 8.49e+05 - 1.52e-01 2.18e-03f 1
87 -1.9310170e+06 9.38e+02 1.67e+02 -1.0 9.30e+05 - 1.25e-01 3.40e-02f 1
88 -1.9333418e+06 8.58e+02 2.71e+02 -1.0 9.22e+05 - 5.03e-02 8.53e-02f 1
89 -1.9340114e+06 8.37e+02 2.64e+02 -1.0 8.01e+05 - 2.91e-02 2.49e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
90 -1.9344580e+06 8.23e+02 2.58e+02 -1.0 7.43e+05 - 3.12e-02 1.62e-02f 1
91 -1.9346092e+06 8.18e+02 2.57e+02 -1.0 5.92e+05 - 2.35e-02 6.40e-03f 1
92 -1.9347529e+06 8.11e+02 2.58e+02 -1.0 2.42e+05 - 1.08e-01 8.14e-03f 1
93 -1.9358266e+06 7.68e+02 2.44e+02 -1.0 2.80e+05 - 1.06e-02 5.34e-02f 1
94 -1.9362473e+06 7.52e+02 2.39e+02 -1.0 2.83e+05 - 4.91e-02 2.05e-02f 1
95 -1.9365906e+06 7.40e+02 2.35e+02 -1.0 2.97e+05 - 4.29e-02 1.66e-02f 1
96 -1.9396085e+06 6.38e+02 2.03e+02 -1.0 3.09e+05 - 2.11e-02 1.38e-01f 1
97 -1.9396461e+06 6.37e+02 2.02e+02 -1.0 3.11e+05 - 4.53e-02 1.71e-03f 1
98 -1.9399529e+06 6.28e+02 1.99e+02 -1.0 3.24e+05 - 5.19e-03 1.41e-02f 1
99 -1.9410991e+06 5.95e+02 1.89e+02 -1.0 3.25e+05 - 1.28e-01 5.32e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
100 -1.9431161e+06 5.48e+02 1.74e+02 -1.0 3.83e+05 - 1.33e-02 7.88e-02f 1
101 -1.9431527e+06 5.47e+02 1.74e+02 -1.0 3.92e+05 - 4.98e-02 1.41e-03f 1
102 -1.9451450e+06 5.05e+02 1.61e+02 -1.0 4.04e+05 - 1.59e-02 7.63e-02f 1
103 -1.9452041e+06 5.04e+02 1.60e+02 -1.0 3.84e+05 - 9.19e-02 2.33e-03f 1
104 -1.9456222e+06 4.94e+02 1.57e+02 -1.0 3.97e+05 - 3.27e-03 2.03e-02f 1
105 -1.9461479e+06 4.81e+02 1.53e+02 -1.0 3.93e+05 - 6.29e-02 2.62e-02f 1
106 -1.9463234e+06 4.77e+02 1.54e+02 -1.0 4.21e+05 - 2.30e-02 8.84e-03f 1
107 -1.9470610e+06 4.61e+02 1.46e+02 -1.0 4.47e+05 - 1.19e-03 3.28e-02f 1
108 -1.9471060e+06 4.60e+02 1.66e+02 -1.0 5.07e+05 - 5.96e-02 2.20e-03f 1
109 -1.9526968e+06 3.53e+02 2.10e+02 -1.0 5.65e+05 - 3.53e-03 2.32e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
110 -1.9528991e+06 3.50e+02 1.38e+02 -1.0 6.15e+05 - 1.94e-01 7.90e-03f 1
111 -1.9531610e+06 3.47e+02 1.55e+02 -1.0 8.82e+05 - 2.98e-02 8.91e-03f 1
112 -1.9537991e+06 3.40e+02 1.54e+02 -1.0 9.23e+05 - 2.46e-02 2.13e-02f 1
113 -1.9549607e+06 3.27e+02 1.19e+02 -1.0 9.61e+05 - 4.57e-03 3.73e-02f 1
114 -1.9550031e+06 3.27e+02 1.76e+02 -1.0 9.86e+05 - 6.18e-02 1.51e-03f 1
115 -1.9553800e+06 3.22e+02 1.67e+02 -1.0 1.08e+06 - 7.67e-03 1.39e-02f 1
116 -1.9562432e+06 3.12e+02 2.01e+02 -1.0 1.09e+06 - 7.32e-02 3.31e-02f 1
117 -1.9565030e+06 3.09e+02 1.94e+02 -1.0 1.25e+06 - 5.43e-03 9.68e-03f 1
118 -1.9565325e+06 3.08e+02 2.71e+02 -1.0 9.42e+05 - 7.83e-02 1.86e-03f 1
119 -1.9567016e+06 3.03e+02 3.51e+02 -1.0 5.04e+05 - 1.00e-01 1.60e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
120 -1.9577207e+06 2.75e+02 2.40e+02 -1.0 5.23e+05 - 1.68e-02 9.36e-02f 1
121 -1.9578171e+06 2.72e+02 3.52e+02 -1.0 5.19e+05 - 1.12e-01 1.01e-02f 1
122 -1.9584404e+06 2.53e+02 2.54e+02 -1.0 5.61e+05 - 5.24e-03 6.97e-02f 1
123 -1.9600330e+06 2.10e+02 6.60e+01 -1.0 5.53e+05 - 4.39e-02 1.71e-01f 1
124 -1.9600502e+06 2.09e+02 4.82e+02 -1.0 4.70e+05 - 2.91e-01 2.08e-03f 1
125 -1.9604517e+06 1.93e+02 5.30e+02 -1.0 5.20e+05 - 1.33e-01 7.62e-02f 1
126 -1.9610921e+06 1.68e+02 3.84e+02 -1.0 3.93e+05 - 8.24e-02 1.30e-01f 1
127 -1.9613594e+06 1.58e+02 3.02e+02 -1.0 2.85e+05 - 2.91e-02 6.07e-02f 1
128 -1.9618123e+06 1.41e+02 2.83e+02 -1.0 2.90e+05 - 1.12e-01 1.05e-01f 1
129 -1.9624956e+06 1.22e+02 7.23e+01 -1.0 7.05e+05 - 4.91e-03 1.37e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
130 -1.9628174e+06 1.14e+02 6.78e+01 -1.0 1.14e+06 - 9.37e-02 6.37e-02f 1
131 -1.9633902e+06 1.00e+02 6.75e+01 -1.0 8.95e+05 - 8.52e-02 1.21e-01f 1
132 -1.9641242e+06 8.33e+01 2.48e+02 -1.0 5.09e+05 - 1.08e-01 1.70e-01f 1
133 -1.9643768e+06 7.76e+01 2.57e+02 -1.0 3.14e+05 - 6.16e-02 6.88e-02f 1
134 -1.9655494e+06 5.40e+01 1.32e+03 -1.0 3.54e+05 - 1.80e-02 3.03e-01f 1
135 -1.9659751e+06 4.65e+01 1.34e+03 -1.0 2.95e+05 - 1.05e-01 1.40e-01f 1
136 -1.9664792e+06 3.88e+01 1.88e+03 -1.0 3.17e+05 - 5.09e-02 1.66e-01f 1
137 -1.9668640e+06 3.37e+01 2.09e+03 -1.0 3.19e+05 - 7.39e-02 1.30e-01f 1
138 -1.9670269e+06 3.19e+01 1.14e+03 -1.0 3.44e+05 - 1.44e-01 5.30e-02f 1
139 -1.9677533e+06 2.52e+01 2.28e+03 -1.0 4.31e+05 - 6.79e-02 2.11e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
140 -1.9681841e+06 2.20e+01 2.97e+03 -1.0 4.58e+05 - 4.66e-02 1.26e-01f 1
141 -1.9684289e+06 2.01e+01 2.55e+03 -1.0 4.11e+05 - 9.76e-02 8.61e-02f 1
142 -1.9689959e+06 1.59e+01 4.68e+03 -1.0 4.05e+05 - 3.87e-02 2.13e-01f 1
143 -1.9691252e+06 1.48e+01 4.94e+03 -1.0 3.28e+05 - 3.84e-02 6.80e-02f 1
144 -1.9693180e+06 1.32e+01 6.50e+03 -1.0 3.62e+05 - 6.43e-03 1.06e-01f 1
145 -1.9695539e+06 1.13e+01 5.21e+03 -1.0 3.72e+05 - 1.60e-01 1.45e-01f 1
146 -1.9696684e+06 1.05e+01 6.21e+03 -1.0 4.39e+05 - 1.75e-02 6.69e-02f 1
147 -1.9697606e+06 9.96e+00 2.41e+03 -1.0 4.37e+05 - 1.73e-01 5.53e-02f 1
148 -1.9701356e+06 7.70e+00 5.33e+03 -1.0 5.01e+05 - 1.15e-01 2.27e-01f 1
149 -1.9703104e+06 6.83e+00 7.17e+03 -1.0 3.57e+05 - 5.21e-02 1.13e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
150 -1.9703833e+06 6.44e+00 2.40e+03 -1.0 3.73e+05 - 1.54e-01 5.70e-02f 1
151 -1.9706892e+06 4.92e+00 1.13e+04 -1.0 3.21e+05 - 3.87e-02 2.36e-01f 1
152 -1.9708911e+06 4.07e+00 9.20e+03 -1.0 4.00e+05 - 1.74e-01 1.72e-01f 1
153 -1.9710174e+06 3.55e+00 1.40e+04 -1.0 4.41e+05 - 4.99e-02 1.29e-01f 1
154 -1.9712708e+06 2.51e+00 1.99e+04 -1.0 4.59e+05 - 1.76e-01 2.92e-01f 1
155 -1.9713313e+06 2.24e+00 5.66e+03 -1.0 3.75e+05 - 2.08e-01 1.08e-01f 1
156 -1.9713913e+06 1.77e+00 2.10e+04 -1.0 1.93e+05 - 8.83e-02 2.10e-01f 1
157 -1.9714412e+06 1.37e+00 3.85e+04 -1.0 1.47e+05 - 9.37e-02 2.24e-01f 1
158 -1.9714688e+06 1.16e+00 1.20e+03 -1.0 1.75e+05 - 3.08e-01 1.54e-01f 1
159 -1.9715025e+06 1.02e+00 1.52e+04 -1.0 9.36e+05 - 6.08e-02 1.24e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
160 -1.9715524e+06 7.95e-01 2.51e+04 -1.0 8.48e+05 - 3.47e-01 2.20e-01f 1
161 -1.9716109e+06 3.84e-01 1.42e+05 -1.0 3.48e+05 - 9.45e-02 5.16e-01f 1
162 -1.9716368e+06 2.42e-01 2.42e+05 -1.0 1.17e+05 - 1.60e-01 3.71e-01f 1
163 -1.9716720e+06 1.27e-01 5.41e+05 -1.0 1.77e+05 - 9.27e-02 4.73e-01f 1
164 -1.9717044e+06 2.03e-02 6.22e+05 -1.0 2.64e+05 - 5.52e-01 8.41e-01f 1
165 -1.9717158e+06 2.65e-03 9.97e+05 -1.0 4.90e+04 - 6.89e-01 8.69e-01f 1
166 -1.9717157e+06 1.99e-03 2.64e+06 -1.0 9.07e+03 - 1.00e+00 2.50e-01f 3
167 -1.9717149e+06 3.49e-10 1.00e-06 -1.0 1.08e+04 - 1.00e+00 1.00e+00h 1
168 -1.9717449e+06 4.66e-10 3.79e+06 -5.7 4.33e+04 - 8.42e-01 4.63e-01f 1
169 -1.9717622e+06 4.66e-10 2.50e+06 -5.7 2.29e+04 - 8.91e-01 5.02e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
170 -1.9717784e+06 3.49e-10 8.42e+04 -5.7 1.12e+04 - 8.84e-01 9.61e-01f 1
171 -1.9717791e+06 4.66e-10 9.86e+01 -5.7 3.82e+02 - 9.97e-01 9.98e-01f 1
172 -1.9717791e+06 4.66e-10 1.84e-11 -5.7 4.26e-01 - 1.00e+00 1.00e+00f 1
173 -1.9717791e+06 4.66e-10 1.68e+01 -7.0 7.35e-01 - 1.00e+00 9.04e-01f 1
174 -1.9717791e+06 3.49e-10 9.09e-13 -7.0 6.75e-02 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 174
(scaled) (unscaled)
Objective...............: -1.9717791134228932e+06 -1.9717791134228932e+06
Dual infeasibility......: 9.0949470177292824e-13 9.0949470177292824e-13
Constraint violation....: 5.8207660913467407e-11 3.4924596548080444e-10
Complementarity.........: 4.7875190673898384e-07 4.7875190673898384e-07
Overall NLP error.......: 4.7875190673898384e-07 4.7875190673898384e-07
Number of objective function evaluations = 177
Number of objective gradient evaluations = 175
Number of equality constraint evaluations = 177
Number of inequality constraint evaluations = 177
Number of equality constraint Jacobian evaluations = 175
Number of inequality constraint Jacobian evaluations = 175
Number of Lagrangian Hessian evaluations = 174
Total CPU secs in IPOPT (w/o function evaluations) = 1.262
Total CPU secs in NLP function evaluations = 0.061
EXIT: Optimal Solution Found.
Pyomo model construction time: 8.12
Pyomo model solve time: 46.82629179954529
Deterministic RUC Cost: 4319462.46
Generator Commitments:
101_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
101_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
101_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
101_STEAM_4 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
102_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
102_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
102_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
102_STEAM_4 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
107_CC_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
113_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
113_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
113_CT_3 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
113_CT_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
115_STEAM_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
115_STEAM_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
115_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
116_STEAM_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
118_CC_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
123_STEAM_2 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
123_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
123_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
123_CT_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
123_CT_5 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
201_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
201_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
201_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
202_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
202_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
202_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
202_STEAM_4 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
207_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
207_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
213_CC_3 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
213_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
213_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
215_CT_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
215_CT_5 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
216_STEAM_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
218_CC_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
221_CC_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
223_STEAM_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
223_STEAM_2 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
223_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
223_CT_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
223_CT_5 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
223_CT_6 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
301_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
301_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
301_CT_3 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
301_CT_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
302_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
302_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
302_CT_3 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
302_CT_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
307_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
307_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
313_CC_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
315_STEAM_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_STEAM_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_STEAM_3 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_STEAM_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_STEAM_5 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_CT_6 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_CT_7 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_CT_8 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
316_STEAM_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
318_CC_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
321_CC_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
322_CT_5 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
322_CT_6 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
323_CC_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
323_CC_2 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
114_SYNC_COND_1: 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
121_NUCLEAR_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
214_SYNC_COND_1: 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
314_SYNC_COND_1: 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
Generator Dispatch Levels:
101_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 8.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
101_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 8.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
101_STEAM_3 : 76.00 76.00 76.00 76.00 76.00 76.00 45.30 45.30 45.30 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 | 76.00 76.00 76.00 76.00 76.00 76.00 45.30 45.30 45.30 60.70 76.00 76.00
101_STEAM_4 : 76.00 76.00 76.00 76.00 76.00 76.00 45.30 45.30 45.30 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 | 76.00 76.00 76.00 76.00 76.00 76.00 45.30 45.30 45.30 73.94 76.00 76.00
102_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
102_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
102_STEAM_3 : 76.00 76.00 60.70 60.70 60.70 45.30 30.00 31.97 34.97 40.31 45.30 60.70 71.11 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 | 76.00 76.00 60.70 60.70 60.70 45.30 36.30 30.00 30.00 38.97 45.30 60.70
102_STEAM_4 : 76.00 76.00 60.70 60.70 60.70 45.30 30.00 30.00 30.00 30.00 45.30 60.70 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 | 76.00 76.00 60.70 60.70 60.70 45.30 30.00 31.97 34.97 30.00 45.30 60.70
107_CC_1 : 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 211.65 231.70 293.30 293.30 355.00 355.00 355.00 355.00 293.30 293.30 231.70 | 231.70 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00
113_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
115_STEAM_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
115_STEAM_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
115_STEAM_3 : 124.00 124.00 93.00 93.00 93.00 62.00 62.00 62.00 62.00 62.00 62.00 93.00 124.00 124.00 124.00 133.35 155.00 155.00 155.00 155.00 155.00 155.00 139.70 124.00 | 124.00 124.00 93.00 93.00 93.00 62.00 62.00 62.00 62.00 62.00 62.00 93.00
116_STEAM_1 : 124.00 124.00 124.00 124.00 93.00 62.00 62.00 62.00 62.00 62.00 93.00 93.00 124.00 124.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 | 124.00 124.00 124.00 124.00 93.00 62.00 62.00 62.00 62.00 62.00 93.00 93.00
118_CC_1 : 231.70 231.70 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 231.70 231.70 231.70 293.30 313.60 313.60 355.00 293.30 293.30 231.70 231.70 | 231.70 231.70 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00
123_STEAM_2 : 124.00 124.00 93.00 93.00 93.00 62.00 62.00 62.00 62.00 62.00 93.00 93.00 93.00 124.00 124.00 124.00 124.00 125.00 125.00 134.19 124.00 124.00 124.00 124.00 | 124.00 93.00 93.00 93.00 93.00 62.00 62.00 62.00 62.00 62.00 93.00 93.00
123_STEAM_3 : 280.00 280.00 280.00 229.37 210.00 140.00 140.00 140.00 140.00 140.00 140.00 210.00 280.00 280.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 | 300.58 280.00 280.00 280.00 210.00 140.00 140.00 140.00 140.00 140.00 140.00 210.00
123_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
123_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
123_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
201_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 8.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
201_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 8.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
201_STEAM_3 : 45.30 45.30 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 45.30 45.30 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 | 45.30 45.30 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00
202_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 8.00 8.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
202_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 8.00 8.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
202_STEAM_3 : 60.70 60.70 60.70 60.70 45.30 30.00 30.00 30.00 30.00 30.00 30.00 57.95 60.70 60.70 60.70 60.70 60.70 60.70 76.00 76.00 60.70 75.81 60.70 60.70 | 60.70 60.70 60.70 60.70 45.30 30.00 30.00 30.00 30.00 30.00 30.00 38.85
202_STEAM_4 : 60.70 60.70 60.70 60.70 45.30 30.00 30.00 30.00 30.00 30.00 30.00 60.70 60.70 60.70 60.70 60.70 63.59 67.16 76.00 76.00 73.03 60.70 60.70 60.70 | 60.70 60.70 60.70 60.70 45.30 30.00 30.00 30.00 30.00 30.00 30.00 30.00
207_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
207_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
213_CC_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
213_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
213_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
215_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
215_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
216_STEAM_1 : 124.00 124.00 117.30 93.00 93.00 93.00 62.00 62.00 62.00 62.00 93.00 93.00 124.00 124.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 | 124.00 124.00 119.40 98.47 93.00 93.00 62.00 62.00 62.00 62.00 93.00 93.00
218_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
221_CC_1 : 206.78 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 231.70 281.19 293.30 293.30 293.30 304.17 296.92 293.30 293.30 293.30 231.70 | 231.70 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00
223_STEAM_1 : 155.00 155.00 155.00 155.00 155.00 62.00 62.00 62.00 62.00 62.00 103.89 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 | 155.00 155.00 155.00 155.00 155.00 62.00 62.00 62.00 62.00 62.00 93.00 155.00
223_STEAM_2 : 155.00 155.00 155.00 155.00 155.00 72.48 62.00 62.00 62.00 62.00 93.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 | 155.00 155.00 155.00 155.00 155.00 63.18 62.00 62.00 62.00 62.00 101.19 155.00
223_STEAM_3 : 280.00 217.77 210.00 210.00 210.00 210.00 140.00 140.00 140.00 140.00 210.00 210.00 210.00 280.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 | 280.00 210.00 210.00 210.00 210.00 210.00 140.00 140.00 140.00 140.00 210.00 210.00
223_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
223_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
223_CT_6 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
307_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
307_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
313_CC_1 : 231.70 231.70 231.70 231.70 231.70 231.70 208.10 216.10 216.10 231.70 231.70 231.70 231.70 231.70 231.70 293.30 293.30 308.33 313.60 314.35 293.30 293.30 293.30 231.70 | 231.70 231.70 231.70 231.70 231.70 231.70 208.10 216.10 216.10 231.70 231.70 231.70
315_STEAM_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_CT_6 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_CT_7 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_CT_8 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
316_STEAM_1 : 124.00 124.00 124.00 124.00 89.61 62.00 62.00 62.00 62.00 62.00 62.00 124.00 124.00 124.00 124.00 124.00 155.00 155.00 155.00 155.00 155.00 155.00 124.00 124.00 | 124.00 124.00 124.00 124.00 97.51 62.00 62.00 62.00 62.00 62.00 62.00 62.00
318_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
321_CC_1 : 231.70 231.70 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 231.70 293.30 293.30 293.30 293.30 313.60 313.60 293.30 293.30 293.30 270.91 | 231.70 228.27 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00
322_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
322_CT_6 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
323_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 170.00 231.70 332.85 354.15 355.00 337.14 259.22 231.70 170.00 | 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00
323_CC_2 : 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 231.70 242.64 355.00 355.00 355.00 355.00 170.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
114_SYNC_COND_1: 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
121_NUCLEAR_1 : 500.00 400.00 500.00 450.00 500.00 450.00 406.30 408.33 408.33 450.00 450.00 400.00 450.00 450.00 400.00 450.00 500.00 483.33 483.33 483.33 500.00 500.00 500.00 500.00 | 400.00 450.00 500.00 400.00 500.00 450.00 400.00 408.33 408.33 450.00 450.00 500.00
214_SYNC_COND_1: 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
314_SYNC_COND_1: 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
Generator Reserve Headroom:
101_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
101_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
101_STEAM_3 : 0.00 0.00 0.00 0.00 0.00 0.00 30.70 30.70 30.70 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 30.70 30.70 30.70 15.30 0.00 0.00
101_STEAM_4 : 0.00 0.00 0.00 0.00 0.00 0.00 30.70 30.70 30.70 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 30.70 30.70 30.70 2.06 0.00 0.00
102_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
102_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
102_STEAM_3 : 0.00 0.00 15.30 15.30 15.30 30.70 46.00 44.03 41.03 35.69 30.70 15.30 4.89 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 15.30 15.30 15.30 30.70 39.70 46.00 46.00 37.03 30.70 15.30
102_STEAM_4 : 0.00 0.00 15.30 15.30 15.30 30.70 46.00 46.00 46.00 46.00 30.70 15.30 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 15.30 15.30 15.30 30.70 46.00 44.03 41.03 46.00 30.70 15.30
107_CC_1 : 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 143.35 123.30 61.70 61.70 0.00 0.00 0.00 0.00 61.70 61.70 123.30 | 123.30 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00
113_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
115_STEAM_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
115_STEAM_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
115_STEAM_3 : 31.00 31.00 62.00 62.00 62.00 93.00 93.00 93.00 93.00 93.00 93.00 62.00 31.00 31.00 31.00 21.65 0.00 0.00 0.00 0.00 0.00 0.00 15.30 31.00 | 31.00 31.00 62.00 62.00 62.00 93.00 93.00 93.00 93.00 93.00 93.00 62.00
116_STEAM_1 : 31.00 31.00 31.00 31.00 62.00 93.00 93.00 93.00 93.00 93.00 62.00 62.00 31.00 31.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 31.00 31.00 31.00 31.00 62.00 93.00 93.00 93.00 93.00 93.00 62.00 62.00
118_CC_1 : 123.30 123.30 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 123.30 123.30 123.30 61.70 41.40 41.40 0.00 61.70 61.70 123.30 123.30 | 123.30 123.30 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00
123_STEAM_2 : 31.00 31.00 62.00 62.00 62.00 93.00 93.00 93.00 93.00 93.00 62.00 62.00 62.00 31.00 31.00 31.00 31.00 30.00 30.00 20.81 31.00 31.00 31.00 31.00 | 31.00 62.00 62.00 62.00 62.00 93.00 93.00 93.00 93.00 93.00 62.00 62.00
123_STEAM_3 : 70.00 70.00 70.00 120.63 140.00 210.00 210.00 210.00 210.00 210.00 210.00 140.00 70.00 70.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 49.42 70.00 70.00 70.00 140.00 210.00 210.00 210.00 210.00 210.00 210.00 140.00
123_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
123_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
123_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
201_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
201_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
201_STEAM_3 : 30.70 30.70 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 30.70 30.70 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 30.70 30.70 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00
202_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
202_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
202_STEAM_3 : 15.30 15.30 15.30 15.30 30.70 46.00 46.00 46.00 46.00 46.00 46.00 18.05 15.30 15.30 15.30 15.30 15.30 15.30 0.00 0.00 15.30 0.19 15.30 15.30 | 15.30 15.30 15.30 15.30 30.70 46.00 46.00 46.00 46.00 46.00 46.00 37.15
202_STEAM_4 : 15.30 15.30 15.30 15.30 30.70 46.00 46.00 46.00 46.00 46.00 46.00 15.30 15.30 15.30 15.30 15.30 12.41 8.84 0.00 0.00 2.97 15.30 15.30 15.30 | 15.30 15.30 15.30 15.30 30.70 46.00 46.00 46.00 46.00 46.00 46.00 46.00
207_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
207_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
213_CC_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
213_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
213_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
215_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
215_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
216_STEAM_1 : 31.00 31.00 37.70 62.00 62.00 62.00 93.00 93.00 93.00 93.00 62.00 62.00 31.00 31.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 31.00 31.00 35.60 56.53 62.00 62.00 93.00 93.00 93.00 93.00 62.00 62.00
218_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
221_CC_1 : 148.22 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 123.30 73.81 61.70 61.70 61.70 50.83 58.08 61.70 61.70 61.70 123.30 | 123.30 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00
223_STEAM_1 : 0.00 0.00 0.00 0.00 0.00 93.00 93.00 93.00 93.00 93.00 51.11 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 93.00 93.00 93.00 93.00 93.00 62.00 0.00
223_STEAM_2 : 0.00 0.00 0.00 0.00 0.00 82.52 93.00 93.00 93.00 93.00 62.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 91.82 93.00 93.00 93.00 93.00 53.81 0.00
223_STEAM_3 : 70.00 132.23 140.00 140.00 140.00 140.00 210.00 210.00 210.00 210.00 140.00 140.00 140.00 70.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 70.00 140.00 140.00 140.00 140.00 140.00 210.00 210.00 210.00 210.00 140.00 140.00
223_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
223_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
223_CT_6 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
307_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
307_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
313_CC_1 : 123.30 123.30 123.30 123.30 123.30 123.30 146.90 138.90 138.90 123.30 123.30 123.30 123.30 123.30 123.30 61.70 61.70 46.67 41.40 40.65 61.70 61.70 61.70 123.30 | 123.30 123.30 123.30 123.30 123.30 123.30 146.90 138.90 138.90 123.30 123.30 123.30
315_STEAM_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_CT_6 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_CT_7 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_CT_8 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
316_STEAM_1 : 31.00 31.00 31.00 31.00 65.39 93.00 93.00 93.00 93.00 93.00 93.00 31.00 31.00 31.00 31.00 31.00 0.00 0.00 0.00 0.00 0.00 0.00 31.00 31.00 | 31.00 31.00 31.00 31.00 57.49 93.00 93.00 93.00 93.00 93.00 93.00 93.00
318_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
321_CC_1 : 123.30 123.30 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 123.30 61.70 61.70 61.70 61.70 41.40 41.40 61.70 61.70 61.70 84.09 | 123.30 126.73 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00
322_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
322_CT_6 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
323_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 123.30 22.15 0.85 0.00 17.86 95.78 123.30 185.00 | 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00
323_CC_2 : 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 123.30 112.36 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
114_SYNC_COND_1: 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
121_NUCLEAR_1 : 0.00 100.00 0.00 50.00 0.00 50.00 93.70 91.67 91.67 50.00 50.00 100.00 50.00 50.00 100.00 50.00 0.00 16.67 16.67 16.67 0.00 0.00 0.00 0.00 | 100.00 50.00 0.00 100.00 0.00 50.00 100.00 91.67 91.67 50.00 50.00 0.00
214_SYNC_COND_1: 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
314_SYNC_COND_1: 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
Total : 1244.42 1443.43 1589.20 1714.13 1779.69 2257.22 2528.00 2516.00 2513.00 2388.99 2132.81 1817.25 1560.49 1227.85 914.01 657.65 602.87 304.43 222.55 177.61 313.94 450.77 601.30 885.89 | 1237.22 1435.63 1587.10 1708.03 1771.79 2266.52 2528.00 2516.00 2513.00 2407.69 2135.51 1829.05
Fixed costs: 2947836.41
Variable costs: 1371626.05
Renewables curtailment summary (time-period, aggregate_quantity):
2020-07-11 06:00 97.34
2020-07-11 07:00 173.22
2020-07-11 08:00 108.51
2020-07-12 06:00 98.44
2020-07-12 07:00 177.72
2020-07-12 08:00 127.41
Solving day-ahead market
Computing day-ahead prices using method LMP.
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.5617786e+04 2.91e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.5699713e+04 2.91e+05 9.90e+01 -1.0 2.70e+04 - 4.12e-04 3.82e-04h 1
2 -2.3411289e+04 2.91e+05 9.99e+01 -1.0 2.36e+04 - 3.89e-04 1.38e-03h 1
3 8.2776208e+03 2.87e+05 1.03e+02 -1.0 7.07e+03 - 1.06e-03 1.20e-02h 1
4 3.4194476e+04 2.84e+05 1.00e+02 -1.0 7.35e+03 - 1.77e-02 9.07e-03h 1
5 3.7110268e+04 2.84e+05 3.34e+02 -1.0 1.83e+05 - 1.14e-01 1.07e-03h 1
6 2.5375447e+06 2.84e+03 1.67e+02 -1.0 2.96e+04 - 2.72e-02 9.90e-01h 1
7 2.5144664e+06 2.05e+03 1.31e+02 -1.0 2.78e+03 - 2.16e-01 2.80e-01f 1
8 2.3930969e+06 2.02e+01 9.43e+02 -1.0 3.53e+03 - 3.28e-01 9.90e-01f 1
9 2.2278129e+06 4.23e+00 4.56e+04 -1.0 5.34e+03 - 4.71e-01 7.90e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.9224105e+06 7.28e-01 2.33e+05 -1.0 9.98e+03 - 4.75e-01 8.28e-01f 1
11 1.9146208e+06 7.16e-01 2.28e+05 -1.0 1.86e+04 - 1.83e-01 1.64e-02f 1
12 1.4218169e+06 1.16e-10 2.41e+06 -1.0 2.27e+04 - 8.62e-02 1.00e+00f 1
13 1.2919845e+06 2.33e-10 4.38e+06 -1.0 2.40e+04 - 2.12e-02 3.33e-01f 1
14 6.8186584e+05 1.16e-10 6.36e+06 -1.0 8.79e+04 - 3.56e-02 5.29e-01f 1
15 6.7406106e+05 1.16e-10 6.06e+06 -1.0 5.03e+04 - 3.86e-02 9.25e-03f 1
16 6.7374676e+05 1.16e-10 5.95e+06 -1.0 5.92e+04 - 1.36e-02 3.56e-04f 1
17 5.1259921e+05 1.16e-10 3.36e+06 -1.0 6.06e+04 - 3.78e-01 2.11e-01f 1
18 5.1089121e+05 1.16e-10 2.24e+06 -1.0 4.84e+04 - 2.26e-01 2.64e-03f 1
19 4.9709321e+05 1.16e-10 9.19e+05 -1.0 5.96e+03 - 8.58e-01 7.79e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 2.9875083e+05 1.16e-10 4.86e+05 -1.0 6.79e+03 - 6.02e-02 9.81e-01f 1
21 1.2645012e+05 1.16e-10 5.04e+05 -1.0 2.20e+05 - 1.78e-03 6.87e-01f 1
22 -2.0074672e+04 1.16e-10 4.33e+05 -1.0 9.19e+05 - 1.40e-01 1.44e-01f 1
23 -2.1696700e+04 1.16e-10 2.17e+05 -1.0 9.27e+03 - 4.93e-01 1.43e-01f 1
24 -2.2647404e+04 1.16e-10 2.55e+04 -1.0 1.68e+02 - 8.85e-01 1.00e+00f 1
25 -2.2686218e+04 1.16e-10 1.98e+04 -1.0 1.42e+03 - 2.25e-01 1.00e+00f 1
26 -2.2666087e+04 1.16e-10 6.31e+03 -1.0 1.79e+03 - 6.81e-01 1.00e+00f 1
27 -2.2664581e+04 5.82e-11 2.52e+03 -1.0 5.25e+03 - 6.00e-01 1.00e+00f 1
28 -2.2661068e+04 1.16e-10 1.11e+03 -1.0 1.13e+04 - 5.58e-01 1.00e+00f 1
29 -2.3091796e+04 1.16e-10 8.45e+05 -1.7 3.68e+03 - 8.94e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -2.3090188e+04 1.16e-10 3.89e+05 -1.7 3.06e+04 - 5.40e-01 1.00e+00f 1
31 -2.3085961e+04 1.16e-10 1.07e+05 -1.7 5.41e+04 - 7.26e-01 1.00e+00f 1
32 -2.3076954e+04 1.16e-10 2.43e+04 -1.7 9.69e+04 - 7.72e-01 1.00e+00f 1
33 -2.3067719e+04 5.82e-11 2.00e-07 -1.7 9.08e+04 - 1.00e+00 1.00e+00f 1
34 -2.3190199e+04 5.82e-11 3.77e+05 -5.7 1.93e+05 - 7.00e-01 8.89e-01f 1
35 -2.3205753e+04 1.16e-10 9.81e+04 -5.7 1.02e+05 - 7.30e-01 7.13e-01f 1
36 -2.3212292e+04 1.16e-10 1.15e+04 -5.7 6.03e+04 - 9.01e-01 9.29e-01f 1
37 -2.3212585e+04 1.16e-10 1.65e+03 -5.7 3.22e+03 - 1.00e+00 6.36e-01f 1
38 -2.3212733e+04 5.82e-11 1.60e+02 -5.7 1.14e+03 - 9.16e-01 1.00e+00f 1
39 -2.3212732e+04 2.33e-10 1.85e-11 -5.7 1.79e+00 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -2.3212744e+04 2.33e-10 9.24e-13 -7.0 4.12e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 40
(scaled) (unscaled)
Objective...............: -2.3212743816508134e+02 -2.3212743816508133e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 1.2587497954783794e-07 1.2587497954783794e-05
Overall NLP error.......: 1.2587497954783794e-07 1.2587497954783794e-05
Number of objective function evaluations = 41
Number of objective gradient evaluations = 41
Number of equality constraint evaluations = 41
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 41
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 40
Total CPU secs in IPOPT (w/o function evaluations) = 0.028
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 68068.44
Variable costs: 33918.54
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 343.58
Simulating time_step 2020-07-10 17:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.0713806e+04 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.0754381e+04 1.64e+05 9.90e+01 -1.0 2.70e+04 - 2.02e-04 1.94e-04h 1
2 -1.8176311e+04 1.64e+05 1.00e+02 -1.0 2.66e+04 - 1.94e-04 8.73e-04h 1
3 -1.1070329e+04 1.63e+05 1.00e+02 -1.0 1.85e+04 - 8.11e-04 1.84e-03h 1
4 4.4228513e+04 1.61e+05 1.01e+02 -1.0 2.65e+03 - 1.89e-03 1.27e-02h 1
5 5.0299716e+05 1.44e+05 1.08e+02 -1.0 2.33e+03 - 1.71e-02 1.05e-01h 1
6 6.3607123e+05 1.39e+05 8.42e+01 -1.0 2.37e+03 - 1.43e-01 3.44e-02h 1
7 4.3367053e+06 1.39e+03 1.26e+02 -1.0 2.77e+03 - 2.39e-01 9.90e-01h 1
8 4.3055005e+06 7.96e+02 2.99e+02 -1.0 3.63e+03 - 1.80e-01 4.29e-01f 1
9 4.1954861e+06 7.79e+00 9.39e+02 -1.0 4.39e+03 - 5.35e-01 9.90e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.9215792e+06 1.16e-10 1.49e+05 -1.0 8.94e+03 - 2.78e-01 1.00e+00f 1
11 3.5879685e+06 8.73e-11 5.58e+06 -1.0 1.05e+04 - 4.39e-01 1.00e+00f 1
12 2.9939031e+06 1.16e-10 5.20e+06 -1.0 2.34e+04 - 6.83e-02 1.00e+00f 1
13 2.0284319e+06 5.82e-11 5.11e+06 -1.0 5.39e+04 - 1.70e-02 7.51e-01f 1
14 1.9770662e+06 9.15e-11 4.32e+06 -1.0 7.88e+04 - 1.55e-01 1.91e-02f 1
15 1.7146702e+06 1.16e-10 2.68e+06 -1.0 8.18e+04 - 3.79e-01 1.02e-01f 1
16 1.2811479e+06 1.16e-10 1.07e+06 -1.0 7.82e+04 - 6.02e-01 1.75e-01f 1
17 1.2254550e+06 1.16e-10 2.72e+05 -1.0 1.03e+05 - 7.44e-01 3.26e-02f 1
18 9.3126953e+05 5.82e-11 2.65e+05 -1.0 2.11e+05 - 2.91e-02 1.61e-01f 1
19 9.2652138e+05 1.16e-10 2.64e+05 -1.0 3.50e+05 - 4.76e-04 2.71e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 7.5027662e+05 1.16e-10 2.08e+05 -1.0 9.47e+05 - 2.12e-01 8.95e-02f 1
21 3.9066857e+05 1.16e-10 2.08e+05 -1.0 3.73e+05 - 2.68e-03 2.87e-01f 1
22 3.6115029e+05 1.16e-10 2.01e+05 -1.0 8.19e+05 - 3.13e-02 2.18e-02f 1
23 3.6055171e+05 1.16e-10 7.35e+03 -1.0 1.83e+05 - 9.63e-01 9.98e-04f 1
24 1.0059645e+05 1.16e-10 6.94e+03 -1.0 3.11e+04 - 5.64e-02 6.84e-01f 1
25 8.9904135e+04 5.82e-11 4.93e+03 -1.0 6.52e+04 - 2.89e-01 9.25e-02f 1
26 -1.6762718e+04 1.16e-10 4.36e+03 -1.0 8.01e+04 - 1.16e-01 9.98e-01f 1
27 -1.7633170e+04 1.16e-10 6.05e+02 -1.0 3.82e+03 - 9.08e-01 9.93e-01f 1
28 -1.8107216e+04 1.16e-10 2.23e+06 -1.7 8.36e+03 - 7.22e-01 1.00e+00f 1
29 -1.8105893e+04 1.16e-10 1.01e+06 -1.7 2.01e+04 - 5.44e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -1.8102785e+04 1.16e-10 3.08e+05 -1.7 3.93e+04 - 6.96e-01 1.00e+00f 1
31 -1.8095551e+04 1.16e-10 1.02e+05 -1.7 8.31e+04 - 6.69e-01 1.00e+00f 1
32 -1.8086607e+04 1.16e-10 8.73e+03 -1.7 9.79e+04 - 9.14e-01 1.00e+00f 1
33 -1.8083027e+04 5.82e-11 2.00e-07 -1.7 1.84e+05 - 1.00e+00 1.00e+00f 1
34 -1.8234553e+04 5.82e-11 6.52e+05 -5.7 2.13e+05 - 6.73e-01 9.99e-01f 1
35 -1.8243693e+04 1.16e-10 2.43e+05 -5.7 1.70e+05 - 6.29e-01 8.24e-01f 1
36 -1.8245199e+04 1.16e-10 1.61e+04 -5.7 4.16e+04 - 9.33e-01 6.91e-01f 1
37 -1.8245794e+04 1.16e-10 4.03e+01 -5.7 1.22e+04 - 9.97e-01 9.91e-01f 1
38 -1.8245795e+04 5.82e-11 1.85e-11 -5.7 3.41e+01 - 1.00e+00 1.00e+00f 1
39 -1.8245808e+04 1.16e-10 9.38e-13 -7.0 4.18e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 39
(scaled) (unscaled)
Objective...............: -1.8245808444861930e+02 -1.8245808444861930e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.8856055994693922e-07 1.8856055994693922e-05
Overall NLP error.......: 1.8856055994693922e-07 1.8856055994693922e-05
Number of objective function evaluations = 40
Number of objective gradient evaluations = 40
Number of equality constraint evaluations = 40
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 40
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 39
Total CPU secs in IPOPT (w/o function evaluations) = 0.028
Total CPU secs in NLP function evaluations = 0.002
EXIT: Optimal Solution Found.
Fixed costs: 64688.44
Variable costs: 40286.93
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 254.80
Simulating time_step 2020-07-10 18:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -1.5797542e+04 4.00e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.5838102e+04 4.00e+05 9.90e+01 -1.0 2.70e+04 - 2.02e-04 1.94e-04h 1
2 -1.2121048e+04 3.99e+05 1.00e+02 -1.0 2.66e+04 - 1.94e-04 8.73e-04h 1
3 -2.8380376e+03 3.98e+05 1.00e+02 -1.0 1.85e+04 - 8.40e-04 1.84e-03h 1
4 6.5659228e+04 3.93e+05 1.01e+02 -1.0 2.38e+03 - 2.68e-03 1.27e-02h 1
5 6.9877273e+05 3.47e+05 1.08e+02 -1.0 2.33e+03 - 2.43e-02 1.18e-01h 1
6 9.0147613e+05 3.32e+05 8.23e+01 -1.0 2.39e+03 - 3.31e-01 4.31e-02h 1
7 5.3484098e+06 3.32e+03 9.17e+01 -1.0 3.58e+03 - 2.81e-01 9.90e-01h 1
8 5.3014397e+06 4.92e+02 8.30e+02 -1.0 4.93e+03 - 1.63e-01 8.52e-01f 1
9 5.1916635e+06 4.53e+00 3.31e+03 -1.0 5.72e+03 - 5.84e-01 9.91e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 4.9319008e+06 1.16e-10 6.25e+05 -1.0 1.20e+04 - 2.29e-01 1.00e+00f 1
11 4.6301524e+06 5.82e-11 7.33e+06 -1.0 1.11e+04 - 2.53e-01 1.00e+00f 1
12 3.8938882e+06 5.82e-11 7.10e+06 -1.0 4.53e+04 - 3.19e-02 1.00e+00f 1
13 2.5189415e+06 5.82e-11 6.89e+06 -1.0 8.62e+04 - 2.98e-02 3.11e-01f 1
14 2.4824646e+06 1.16e-10 4.92e+06 -1.0 7.07e+04 - 2.85e-01 9.87e-03f 1
15 2.0586075e+06 1.16e-10 2.52e+06 -1.0 7.32e+04 - 4.88e-01 1.15e-01f 1
16 1.9387468e+06 1.16e-10 4.05e+05 -1.0 6.92e+04 - 8.39e-01 4.06e-02f 1
17 1.3830445e+06 1.16e-10 3.59e+05 -1.0 2.05e+05 - 1.12e-01 1.79e-01f 1
18 1.3761239e+06 1.16e-10 3.59e+05 -1.0 1.83e+05 - 1.32e-03 2.96e-03f 1
19 1.3670492e+06 1.16e-10 3.33e+05 -1.0 9.29e+05 - 7.16e-02 3.75e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 7.0742104e+05 1.16e-10 3.33e+05 -1.0 4.28e+05 - 8.26e-04 3.35e-01f 1
21 7.0585541e+05 1.16e-10 3.17e+05 -1.0 7.78e+05 - 4.80e-02 8.70e-04f 1
22 6.8973728e+05 1.75e-10 1.68e+05 -1.0 1.69e+05 - 4.71e-01 2.09e-02f 1
23 5.7829661e+05 1.16e-10 1.40e+05 -1.0 6.85e+04 - 1.62e-01 2.53e-01f 1
24 3.9510450e+05 1.16e-10 1.40e+05 -1.0 3.91e+04 - 2.14e-03 5.24e-01f 1
25 3.7938423e+05 1.16e-10 5.32e+04 -1.0 3.83e+05 - 6.20e-01 2.94e-02f 1
26 1.6809904e+05 1.16e-10 5.16e+04 -1.0 2.95e+05 - 2.93e-02 4.65e-01f 1
27 1.6533486e+05 1.16e-10 4.03e+04 -1.0 8.33e+04 - 2.19e-01 1.66e-02f 1
28 3.4165164e+04 1.16e-10 4.02e+04 -1.0 7.67e+04 - 2.37e-03 8.46e-01f 1
29 -2.4124910e+04 1.16e-10 9.62e+03 -1.0 6.36e+04 - 7.61e-01 7.77e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -2.5355182e+04 1.16e-10 5.47e+03 -1.0 2.10e+03 - 4.31e-01 9.68e-01f 1
31 -2.5339914e+04 1.16e-10 2.18e+03 -1.0 3.14e+03 - 6.01e-01 1.00e+00f 1
32 -2.5721841e+04 1.16e-10 8.94e+05 -1.7 1.61e+03 - 8.88e-01 1.00e+00f 1
33 -2.5721525e+04 2.33e-10 4.27e+05 -1.7 1.33e+04 - 5.22e-01 1.00e+00f 1
34 -2.5719239e+04 1.16e-10 1.44e+05 -1.7 2.61e+04 - 6.62e-01 1.00e+00f 1
35 -2.5712996e+04 1.16e-10 5.40e+04 -1.7 5.92e+04 - 6.25e-01 1.00e+00f 1
36 -2.5703292e+04 1.16e-10 4.70e+03 -1.7 9.13e+04 - 9.13e-01 1.00e+00f 1
37 -2.5689924e+04 1.16e-10 2.00e-07 -1.7 1.05e+05 - 1.00e+00 1.00e+00f 1
38 -2.5808540e+04 1.16e-10 4.23e+05 -5.7 2.19e+05 - 7.04e-01 9.16e-01f 1
39 -2.5820630e+04 1.16e-10 8.68e+04 -5.7 1.25e+05 - 7.75e-01 7.24e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -2.5824840e+04 1.16e-10 1.80e+03 -5.7 5.71e+04 - 9.26e-01 8.25e-01f 1
41 -2.5825438e+04 1.16e-10 1.73e+03 -5.7 8.58e+03 - 9.84e-01 7.67e-01f 1
42 -2.5825592e+04 1.16e-10 2.85e+02 -5.7 1.91e+03 - 8.93e-01 1.00e+00f 1
43 -2.5825591e+04 2.33e-10 1.85e-11 -5.7 1.08e+00 - 1.00e+00 1.00e+00f 1
44 -2.5825602e+04 1.16e-10 9.24e-13 -7.0 4.12e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 44
(scaled) (unscaled)
Objective...............: -2.5825601741697602e+02 -2.5825601741697603e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2429630732907041e-07 1.2429630732907041e-05
Overall NLP error.......: 1.2429630732907041e-07 1.2429630732907041e-05
Number of objective function evaluations = 45
Number of objective gradient evaluations = 45
Number of equality constraint evaluations = 45
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 45
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 44
Total CPU secs in IPOPT (w/o function evaluations) = 0.031
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 62776.44
Variable costs: 46103.63
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 385.37
Simulating time_step 2020-07-10 19:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.3277566e+04 2.91e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.3319501e+04 2.91e+05 9.90e+01 -1.0 2.70e+04 - 2.02e-04 1.94e-04h 1
2 -2.0552856e+04 2.91e+05 1.00e+02 -1.0 2.66e+04 - 1.94e-04 8.46e-04h 1
3 -1.3245262e+04 2.90e+05 1.00e+02 -1.0 1.87e+04 - 8.33e-04 1.72e-03h 1
4 4.6439979e+04 2.87e+05 1.02e+02 -1.0 3.45e+03 - 1.65e-03 1.25e-02h 1
5 8.2219679e+04 2.85e+05 9.90e+01 -1.0 5.25e+03 - 1.68e-02 7.50e-03h 1
6 8.6172851e+04 2.84e+05 3.47e+02 -1.0 1.51e+05 - 8.24e-02 8.55e-04h 1
7 1.9228789e+06 1.66e+05 2.58e+02 -1.0 3.03e+04 - 3.30e-02 4.15e-01h 1
8 2.0552567e+06 1.58e+05 2.30e+02 -1.0 1.84e+04 - 1.02e-01 5.19e-02h 1
9 3.5415269e+06 6.04e+04 1.31e+02 -1.0 1.73e+04 - 4.64e-01 6.17e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.8647633e+06 3.53e+04 1.15e+02 -1.0 7.11e+03 - 2.28e-01 4.15e-01h 1
11 3.8977477e+06 3.19e+04 6.36e+01 -1.0 7.08e+03 - 3.33e-01 9.64e-02h 1
12 4.0827418e+06 3.19e+02 9.17e+01 -1.0 1.03e+04 - 2.16e-01 9.90e-01h 1
13 4.0097784e+06 2.53e+02 4.79e+02 -1.0 1.12e+04 - 1.61e-01 2.07e-01f 1
14 4.0047259e+06 2.49e+02 2.08e+02 -1.0 1.22e+04 - 7.57e-02 1.66e-02f 1
15 3.6924692e+06 2.20e+00 8.68e+03 -1.0 1.29e+04 - 2.48e-01 9.91e-01f 1
16 3.5076779e+06 1.45e+00 3.16e+05 -1.0 3.05e+04 - 7.59e-02 3.42e-01f 1
17 2.0980635e+06 4.21e-02 1.61e+06 -1.0 5.16e+04 - 8.13e-03 9.71e-01f 1
18 2.0420928e+06 4.11e-02 2.15e+05 -1.0 7.36e+04 - 2.29e-01 2.27e-02f 1
19 1.8176243e+06 3.71e-02 1.05e+05 -1.0 7.61e+04 - 5.40e-02 9.71e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.7943137e+06 3.67e-02 1.68e+05 -1.0 6.98e+04 - 1.70e-03 1.13e-02f 1
21 1.3048265e+06 2.85e-02 2.02e+06 -1.0 6.91e+04 - 5.45e-01 2.23e-01f 1
22 1.2993814e+06 2.85e-02 2.84e+06 -1.0 7.06e+04 - 2.37e-01 2.92e-03f 1
23 1.2226573e+06 2.69e-02 4.06e+06 -1.0 8.63e+04 - 5.49e-01 5.51e-02f 1
24 1.2147806e+06 2.67e-02 4.03e+06 -1.0 1.40e+05 - 1.22e-02 8.28e-03f 1
25 8.2714751e+05 1.72e-02 2.11e+06 -1.0 1.68e+05 - 1.48e-04 3.55e-01f 1
26 8.0517311e+05 1.69e-02 2.64e+06 -1.0 8.76e+05 - 4.14e-01 1.57e-02f 1
27 5.3504395e+05 1.24e-02 1.71e+06 -1.0 5.73e+05 - 5.81e-03 2.66e-01f 1
28 5.2236041e+05 1.23e-02 1.69e+06 -1.0 4.72e+05 - 3.25e-03 8.63e-03f 1
29 5.2145326e+05 1.23e-02 1.84e+06 -1.0 4.71e+05 - 1.70e-01 7.00e-04f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 4.6162045e+05 1.17e-02 1.70e+06 -1.0 3.89e+05 - 2.14e-03 5.31e-02f 1
31 4.6026401e+05 1.16e-02 1.75e+06 -1.0 3.77e+05 - 7.02e-02 1.44e-03f 1
32 3.5198439e+05 1.01e-02 1.88e+06 -1.0 3.59e+05 - 6.43e-01 1.28e-01f 1
33 1.2163933e+05 4.79e-03 7.69e+05 -1.0 1.85e+05 - 7.24e-02 5.27e-01f 1
34 1.1621219e+05 4.57e-03 7.69e+05 -1.0 4.98e+04 - 1.92e-01 4.72e-02f 1
35 5.4029537e+04 1.85e-03 2.02e+05 -1.0 7.84e+04 - 4.64e-02 5.94e-01f 1
36 -1.8083608e+04 1.16e-10 1.70e+05 -1.0 5.93e+04 - 1.21e-01 1.00e+00f 1
37 -2.5296257e+04 1.16e-10 5.21e+04 -1.0 7.26e+03 - 6.95e-01 9.07e-01f 1
38 -2.5363190e+04 1.16e-10 2.39e+04 -1.0 7.82e+02 - 5.43e-01 1.00e+00f 1
39 -2.5349793e+04 1.16e-10 1.02e+04 -1.0 1.55e+03 - 5.75e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -2.5344712e+04 1.16e-10 3.82e+03 -1.0 3.73e+03 - 6.24e-01 1.00e+00f 1
41 -2.5335996e+04 1.16e-10 1.73e+03 -1.0 9.68e+03 - 5.46e-01 1.00e+00f 1
42 -2.5718464e+04 1.16e-10 8.06e+05 -1.7 4.17e+03 - 8.99e-01 1.00e+00f 1
43 -2.5719462e+04 1.16e-10 3.76e+05 -1.7 3.58e+04 - 5.33e-01 1.00e+00f 1
44 -2.5714628e+04 1.16e-10 9.24e+04 -1.7 6.00e+04 - 7.54e-01 1.00e+00f 1
45 -2.5705635e+04 1.16e-10 1.92e+04 -1.7 1.05e+05 - 7.93e-01 1.00e+00f 1
46 -2.5699491e+04 1.16e-10 2.00e-07 -1.7 8.21e+04 - 1.00e+00 1.00e+00f 1
47 -2.5809384e+04 2.33e-10 2.80e+05 -5.7 2.13e+05 - 7.10e-01 8.50e-01f 1
48 -2.5825786e+04 2.33e-10 1.82e+04 -5.7 1.32e+05 - 7.88e-01 6.50e-01f 1
49 -2.5833897e+04 2.33e-10 1.84e+02 -5.7 6.99e+04 - 8.93e-01 8.73e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
50 -2.5834796e+04 1.16e-10 2.05e+03 -5.7 7.36e+03 - 9.96e-01 8.42e-01f 1
51 -2.5834934e+04 1.16e-10 3.05e+02 -5.7 1.09e+03 - 8.81e-01 9.73e-01f 1
52 -2.5834935e+04 2.33e-10 1.85e-11 -5.7 2.92e+01 - 1.00e+00 1.00e+00f 1
53 -2.5834946e+04 1.16e-10 9.38e-13 -7.0 4.12e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 53
(scaled) (unscaled)
Objective...............: -2.5834946077156388e+02 -2.5834946077156386e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 3.1779287818427350e-07 3.1779287818427351e-05
Overall NLP error.......: 3.1779287818427350e-07 3.1779287818427351e-05
Number of objective function evaluations = 54
Number of objective gradient evaluations = 54
Number of equality constraint evaluations = 54
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 54
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 53
Total CPU secs in IPOPT (w/o function evaluations) = 0.036
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 69611.82
Variable costs: 48662.52
Number on/offs: 3
Sum on/off ramps: 24.00
Sum nominal ramps: 109.51
Simulating time_step 2020-07-10 20:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.3285608e+04 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.3326882e+04 1.64e+05 9.90e+01 -1.0 2.70e+04 - 2.02e-04 1.94e-04h 1
2 -2.0786266e+04 1.64e+05 1.00e+02 -1.0 2.66e+04 - 1.94e-04 8.73e-04h 1
3 -1.4231219e+04 1.63e+05 1.00e+02 -1.0 1.85e+04 - 8.40e-04 1.75e-03h 1
4 1.1083352e+04 1.62e+05 1.01e+02 -1.0 3.42e+03 - 1.68e-03 5.91e-03h 1
5 6.5793486e+04 1.60e+05 1.00e+02 -1.0 2.36e+03 - 9.56e-03 1.27e-02h 1
6 2.4747937e+05 1.54e+05 9.88e+01 -1.0 2.39e+03 - 2.69e-02 4.25e-02h 1
7 8.8478564e+05 1.30e+05 9.46e+01 -1.0 2.46e+03 - 9.71e-02 1.56e-01h 1
8 1.4126021e+06 1.10e+05 6.63e+01 -1.0 2.72e+03 - 5.22e-01 1.54e-01h 1
9 4.1757026e+06 1.10e+03 5.31e+01 -1.0 5.67e+03 - 3.46e-01 9.90e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 4.1615156e+06 1.04e+03 3.29e+02 -1.0 8.34e+03 - 2.82e-01 5.51e-02f 1
11 4.1554005e+06 1.02e+03 5.25e+02 -1.0 1.13e+04 - 1.47e-01 1.91e-02f 1
12 3.8298382e+06 1.30e+02 1.01e+03 -1.0 1.29e+04 - 2.05e-01 8.72e-01f 1
13 3.8233514e+06 1.28e+02 1.45e+03 -1.0 1.31e+04 - 2.12e-01 1.75e-02f 1
14 3.5859321e+06 5.53e+01 5.45e+03 -1.0 1.54e+04 - 9.29e-02 5.69e-01f 1
15 2.8923519e+06 3.90e-01 2.82e+04 -1.0 3.93e+04 - 3.93e-02 9.93e-01f 1
16 1.9700086e+06 2.63e-01 9.18e+05 -1.0 8.34e+04 - 2.17e-02 3.26e-01f 1
17 1.6544604e+06 2.31e-01 2.42e+05 -1.0 7.15e+04 - 2.71e-01 1.24e-01f 1
18 1.6386488e+06 2.29e-01 2.28e+06 -1.0 6.66e+04 - 6.91e-01 8.54e-03f 1
19 1.2877017e+06 1.85e-01 3.22e+06 -1.0 8.57e+04 - 7.13e-01 1.92e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.2296541e+06 1.78e-01 3.19e+06 -1.0 1.83e+05 - 7.70e-02 3.64e-02f 1
21 1.2267047e+06 1.77e-01 3.18e+06 -1.0 1.84e+05 - 8.59e-04 2.56e-03f 1
22 1.1941658e+06 1.75e-01 3.32e+06 -1.0 1.39e+06 - 1.03e-01 1.27e-02f 1
23 1.1827196e+06 1.74e-01 3.28e+06 -1.0 3.21e+05 - 1.17e-03 8.09e-03f 1
24 1.0238866e+06 1.64e-01 3.06e+06 -1.0 1.36e+06 - 3.80e-02 5.65e-02f 1
25 1.0219790e+06 1.64e-01 3.22e+06 -1.0 8.78e+05 - 8.33e-02 8.56e-04f 1
26 8.3950101e+05 1.38e-01 2.59e+06 -1.0 4.39e+05 - 9.33e-02 1.58e-01f 1
27 6.1923247e+05 1.11e-01 2.09e+06 -1.0 5.17e+05 - 1.93e-01 1.94e-01f 1
28 5.9428891e+05 1.07e-01 1.94e+06 -1.0 3.47e+05 - 1.41e-03 3.68e-02f 1
29 5.6660335e+05 1.05e-01 2.22e+06 -1.0 3.40e+05 - 1.88e-01 2.36e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 5.6472798e+05 1.04e-01 2.24e+06 -1.0 3.20e+05 - 1.33e-02 2.38e-03f 1
31 1.6665147e+05 4.99e-02 2.05e+05 -1.0 3.81e+05 - 2.89e-02 5.22e-01f 1
32 1.5760485e+05 4.77e-02 2.21e+06 -1.0 1.59e+04 - 9.73e-01 4.41e-02f 1
33 1.8827592e+04 1.15e-02 2.33e+05 -1.0 5.79e+04 - 2.19e-01 7.58e-01f 1
34 -2.4851353e+04 1.78e-04 3.41e+05 -1.0 3.48e+04 - 3.65e-01 9.85e-01f 1
35 -2.5279473e+04 1.16e-10 9.41e+04 -1.0 7.01e+03 - 7.60e-01 1.00e+00f 1
36 -2.5265207e+04 3.49e-10 3.03e+04 -1.0 2.81e+04 - 6.79e-01 1.00e+00f 1
37 -2.5251846e+04 1.16e-10 1.30e+04 -1.0 1.02e+05 - 5.72e-01 1.00e+00f 1
38 -2.5237737e+04 1.16e-10 3.69e+03 -1.0 1.29e+05 - 7.16e-01 1.00e+00f 1
39 -2.5213031e+04 1.16e-10 8.76e+01 -1.0 2.42e+05 - 9.76e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -2.5681094e+04 1.16e-10 1.60e+06 -2.5 1.82e+05 - 7.55e-01 9.20e-01f 1
41 -2.5741907e+04 1.16e-10 8.52e+05 -2.5 1.84e+05 - 6.42e-01 1.00e+00f 1
42 -2.5753518e+04 1.16e-10 2.83e-08 -2.5 1.24e+05 - 1.00e+00 1.00e+00f 1
43 -2.5771081e+04 1.16e-10 3.31e+03 -5.7 9.35e+04 - 8.33e-01 8.45e-01f 1
44 -2.5773992e+04 1.16e-10 4.15e+03 -5.7 1.69e+04 - 9.86e-01 8.90e-01f 1
45 -2.5774198e+04 5.82e-11 1.63e+03 -5.7 1.40e+03 - 1.00e+00 6.60e-01f 1
46 -2.5774290e+04 1.16e-10 1.62e+02 -5.7 4.70e+02 - 9.15e-01 1.00e+00f 1
47 -2.5774288e+04 1.16e-10 1.85e-11 -5.7 1.73e+00 - 1.00e+00 1.00e+00f 1
48 -2.5774300e+04 1.16e-10 9.38e-13 -7.0 4.12e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 48
(scaled) (unscaled)
Objective...............: -2.5774299709928715e+02 -2.5774299709928713e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2583877605386285e-07 1.2583877605386284e-05
Overall NLP error.......: 1.2583877605386285e-07 1.2583877605386284e-05
Number of objective function evaluations = 49
Number of objective gradient evaluations = 49
Number of equality constraint evaluations = 49
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 49
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 48
Total CPU secs in IPOPT (w/o function evaluations) = 0.034
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 68400.44
Variable costs: 48349.81
Number on/offs: 3
Sum on/off ramps: 0.00
Sum nominal ramps: 27.43
Simulating time_step 2020-07-10 21:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.3224958e+04 1.15e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.3266309e+04 1.15e+05 9.90e+01 -1.0 2.70e+04 - 2.02e-04 1.94e-04h 1
2 -2.0726127e+04 1.15e+05 1.00e+02 -1.0 2.66e+04 - 1.94e-04 8.73e-04h 1
3 -1.4172378e+04 1.14e+05 1.00e+02 -1.0 1.85e+04 - 8.40e-04 1.75e-03h 1
4 1.1135336e+04 1.14e+05 1.01e+02 -1.0 3.42e+03 - 1.68e-03 5.91e-03h 1
5 7.9407390e+04 1.12e+05 1.00e+02 -1.0 2.36e+03 - 9.56e-03 1.58e-02h 1
6 2.6930823e+05 1.07e+05 9.86e+01 -1.0 2.39e+03 - 3.06e-02 4.45e-02h 1
7 6.9622802e+05 9.58e+04 8.26e+01 -1.0 2.47e+03 - 3.60e-01 1.05e-01h 1
8 3.4661289e+06 2.18e+04 6.23e+01 -1.0 3.85e+03 - 3.38e-01 7.73e-01h 1
9 3.8094839e+06 1.03e+04 5.23e+01 -1.0 5.75e+03 - 2.42e-01 5.26e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.8100457e+06 1.03e+04 3.89e+01 -1.0 7.39e+03 - 3.54e-01 3.68e-03h 1
11 3.8650794e+06 1.03e+02 9.25e+01 -1.0 1.11e+04 - 1.62e-01 9.90e-01h 1
12 3.8255375e+06 9.09e+01 2.65e+03 -1.0 1.11e+04 - 3.59e-01 1.14e-01f 1
13 3.8107313e+06 8.75e+01 3.26e+03 -1.0 1.50e+04 - 9.29e-02 3.71e-02f 1
14 3.4835633e+06 2.99e+01 7.30e+03 -1.0 1.78e+04 - 5.19e-02 6.58e-01f 1
15 3.2477260e+06 2.37e+01 1.28e+04 -1.0 5.16e+04 - 1.44e-02 2.08e-01f 1
16 2.0081889e+06 1.46e+01 2.48e+04 -1.0 8.79e+04 - 3.34e-02 3.85e-01f 1
17 1.9892269e+06 1.45e+01 1.36e+04 -1.0 6.54e+04 - 4.97e-01 7.99e-03f 1
18 1.4925713e+06 1.12e+01 2.88e+04 -1.0 6.91e+04 - 4.61e-01 2.27e-01f 1
19 1.4674437e+06 1.10e+01 1.05e+05 -1.0 5.36e+04 - 7.70e-01 1.44e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.4461514e+06 1.08e+01 1.05e+05 -1.0 1.53e+05 - 3.35e-02 1.64e-02f 1
21 1.1646606e+06 8.61e+00 6.19e+04 -1.0 1.54e+05 - 3.71e-04 2.06e-01f 1
22 1.1635863e+06 8.60e+00 7.22e+04 -1.0 3.60e+05 - 8.06e-02 7.60e-04f 1
23 1.0323290e+06 7.73e+00 5.19e+04 -1.0 1.67e+05 - 9.33e-04 1.01e-01f 1
24 9.5088724e+05 7.49e+00 5.38e+04 -1.0 1.46e+06 - 5.49e-02 3.07e-02f 1
25 9.4973447e+05 7.49e+00 9.14e+04 -1.0 6.02e+05 - 2.55e-01 7.23e-04f 1
26 8.2567449e+05 6.40e+00 1.04e+05 -1.0 3.02e+05 - 3.18e-01 1.45e-01f 1
27 6.0203340e+05 4.93e+00 4.10e+04 -1.0 6.17e+05 - 2.92e-03 2.30e-01f 1
28 5.9736263e+05 4.91e+00 1.54e+05 -1.0 3.98e+05 - 5.17e-01 3.95e-03f 1
29 5.7501345e+05 4.74e+00 1.45e+05 -1.0 2.84e+05 - 1.38e-02 3.39e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 1.7184165e+04 7.16e-01 1.25e+05 -1.0 2.92e+05 - 2.01e-01 8.49e-01f 1
31 5.6381115e+03 5.51e-01 8.42e+05 -1.0 2.93e+04 - 9.41e-01 2.30e-01f 1
32 -2.5287228e+04 1.26e-02 4.96e+05 -1.0 1.83e+04 - 6.18e-01 9.77e-01f 1
33 -2.5656548e+04 2.33e-10 2.10e+06 -1.0 9.98e+03 - 6.87e-01 1.00e+00f 1
34 -2.5639703e+04 1.16e-10 1.13e+06 -1.0 3.37e+04 - 6.02e-01 1.00e+00f 1
35 -2.5627314e+04 1.16e-10 4.44e+05 -1.0 7.27e+04 - 6.07e-01 1.00e+00f 1
36 -2.5612907e+04 2.33e-10 9.10e+04 -1.0 1.40e+05 - 7.95e-01 1.00e+00f 1
37 -2.5585967e+04 1.16e-10 1.48e+04 -1.0 2.62e+05 - 8.38e-01 1.00e+00f 1
38 -2.5573379e+04 1.75e-10 1.00e-06 -1.0 1.57e+05 - 1.00e+00 1.00e+00f 1
39 -2.6084189e+04 2.33e-10 2.58e+06 -5.7 1.72e+05 - 7.07e-01 9.65e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -2.6128275e+04 1.16e-10 1.11e+06 -5.7 3.37e+05 - 5.98e-01 8.03e-01f 1
41 -2.6145702e+04 1.16e-10 4.45e+05 -5.7 2.00e+05 - 6.08e-01 7.53e-01f 1
42 -2.6150955e+04 1.16e-10 9.20e+04 -5.7 9.98e+04 - 7.93e-01 7.82e-01f 1
43 -2.6152141e+04 1.16e-10 4.57e+03 -5.7 3.56e+04 - 9.38e-01 6.37e-01f 1
44 -2.6152771e+04 1.16e-10 2.99e+02 -5.7 1.24e+04 - 9.48e-01 9.95e-01f 1
45 -2.6152770e+04 1.16e-10 1.92e+02 -5.7 4.26e+01 - 3.72e-01 1.00e+00f 1
46 -2.6152770e+04 1.16e-10 1.85e-11 -5.7 8.18e+00 - 1.00e+00 1.00e+00h 1
47 -2.6152782e+04 1.16e-10 9.24e-13 -7.0 4.12e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 47
(scaled) (unscaled)
Objective...............: -2.6152781530665050e+02 -2.6152781530665048e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2652993049053692e-07 1.2652993049053692e-05
Overall NLP error.......: 1.2652993049053692e-07 1.2652993049053692e-05
Number of objective function evaluations = 48
Number of objective gradient evaluations = 48
Number of equality constraint evaluations = 48
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 48
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 47
Total CPU secs in IPOPT (w/o function evaluations) = 0.029
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 62776.44
Variable costs: 45043.33
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 117.45
Simulating time_step 2020-07-10 22:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.3553040e+04 6.25e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.3594427e+04 6.25e+03 9.90e+01 -1.0 2.70e+04 - 2.02e-04 1.94e-04h 1
2 -2.0900085e+04 6.24e+03 1.00e+02 -1.0 2.66e+04 - 1.94e-04 8.73e-04h 1
3 -1.3671159e+04 6.23e+03 1.00e+02 -1.0 1.85e+04 - 8.40e-04 1.75e-03h 1
4 1.4111241e+04 6.20e+03 1.01e+02 -1.0 3.42e+03 - 1.68e-03 5.91e-03h 1
5 9.2078793e+04 6.09e+03 1.00e+02 -1.0 2.36e+03 - 9.56e-03 1.65e-02h 1
6 2.9075463e+05 5.83e+03 9.83e+01 -1.0 2.39e+03 - 3.14e-02 4.27e-02h 1
7 7.8867863e+05 5.18e+03 8.21e+01 -1.0 2.47e+03 - 3.55e-01 1.12e-01h 1
8 3.6359601e+06 1.39e+03 5.85e+01 -1.0 3.83e+03 - 3.46e-01 7.31e-01h 1
9 4.0994333e+06 6.49e+02 4.99e+01 -1.0 5.79e+03 - 2.50e-01 5.34e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 4.1002193e+06 6.47e+02 3.80e+01 -1.0 7.51e+03 - 3.34e-01 3.60e-03h 1
11 4.1996895e+06 6.46e+00 7.98e+01 -1.0 1.10e+04 - 1.64e-01 9.90e-01h 1
12 4.1375012e+06 5.60e+00 2.15e+03 -1.0 1.19e+04 - 3.64e-01 1.34e-01f 1
13 4.1160919e+06 5.41e+00 2.76e+03 -1.0 2.63e+04 - 9.40e-02 3.25e-02f 1
14 3.5641483e+06 1.70e+00 7.55e+03 -1.0 3.15e+04 - 5.28e-02 6.85e-01f 1
15 3.2621968e+06 1.36e+00 1.20e+04 -1.0 5.17e+04 - 1.48e-02 2.03e-01f 1
16 3.1083759e+06 1.30e+00 1.20e+04 -1.0 8.79e+04 - 3.25e-02 4.33e-02f 1
17 3.1063038e+06 1.30e+00 7.54e+03 -1.0 8.82e+04 - 2.89e-01 5.66e-04f 1
18 1.8817259e+06 8.71e-01 5.67e+03 -1.0 9.30e+04 - 1.84e-01 3.29e-01f 1
19 1.8584325e+06 8.63e-01 2.89e+04 -1.0 6.59e+04 - 4.95e-01 9.89e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.4555679e+06 6.99e-01 6.11e+04 -1.0 6.61e+04 - 7.19e-01 1.90e-01f 1
21 1.4501986e+06 6.97e-01 8.40e+04 -1.0 1.30e+05 - 2.67e-01 3.24e-03f 1
22 1.0476821e+06 4.78e-01 3.06e+04 -1.0 1.56e+05 - 3.65e-03 3.13e-01f 1
23 1.0190198e+06 4.72e-01 2.89e+04 -1.0 1.28e+06 - 2.33e-03 1.26e-02f 1
24 1.0180032e+06 4.72e-01 4.55e+04 -1.0 3.13e+05 - 1.30e-01 8.55e-04f 1
25 9.2510171e+05 4.29e-01 2.98e+04 -1.0 1.55e+05 - 1.55e-03 9.14e-02f 1
26 8.7236628e+05 4.18e-01 3.27e+04 -1.0 1.27e+06 - 5.20e-02 2.60e-02f 1
27 8.7153680e+05 4.17e-01 7.75e+04 -1.0 3.19e+05 - 3.10e-01 9.24e-04f 1
28 6.7919976e+05 2.84e-01 7.19e+03 -1.0 2.96e+05 - 4.16e-03 3.19e-01f 1
29 3.5922072e+05 2.02e-01 4.34e+04 -1.0 3.30e+05 - 5.94e-02 2.89e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 3.5663039e+05 2.01e-01 4.95e+04 -1.0 2.85e+05 - 3.19e-01 3.35e-03f 1
31 2.8261201e+05 1.68e-01 5.17e+03 -1.0 2.25e+05 - 6.43e-03 1.66e-01f 1
32 2.5398576e+04 6.04e-02 1.11e+05 -1.0 2.38e+05 - 9.65e-01 6.40e-01f 1
33 3.2515210e+03 3.57e-02 1.28e+05 -1.0 3.41e+05 - 4.79e-01 4.09e-01f 1
34 -1.7023604e+03 2.99e-02 3.41e+05 -1.0 2.13e+04 - 3.39e-01 1.63e-01f 1
35 -2.6862416e+04 1.60e-04 4.73e+05 -1.0 1.23e+04 - 6.71e-01 9.95e-01f 1
36 -2.6995049e+04 2.33e-10 3.77e+06 -1.0 2.70e+04 - 4.84e-01 1.00e+00f 1
37 -2.6983414e+04 1.16e-10 1.52e+06 -1.0 4.81e+04 - 6.17e-01 1.00e+00f 1
38 -2.6976857e+04 2.33e-10 4.45e+05 -1.0 1.15e+05 - 7.07e-01 1.00e+00f 1
39 -2.6962685e+04 1.16e-10 6.81e+04 -1.0 1.59e+05 - 8.47e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -2.6941255e+04 1.16e-10 1.00e-06 -1.0 3.62e+05 - 1.00e+00 1.00e+00f 1
41 -2.7454781e+04 1.75e-10 2.36e+06 -5.7 1.39e+05 - 7.28e-01 9.63e-01f 1
42 -2.7496155e+04 1.16e-10 1.15e+06 -5.7 3.60e+05 - 5.64e-01 8.89e-01f 1
43 -2.7509424e+04 2.33e-10 4.22e+05 -5.7 2.00e+05 - 6.41e-01 9.05e-01f 1
44 -2.7512515e+04 1.16e-10 7.58e+04 -5.7 8.11e+04 - 8.18e-01 6.01e-01f 1
45 -2.7514578e+04 5.82e-11 6.25e+03 -5.7 3.52e+04 - 9.19e-01 9.66e-01f 1
46 -2.7514603e+04 1.16e-10 1.85e-11 -5.7 7.71e+02 - 1.00e+00 1.00e+00f 1
47 -2.7514614e+04 1.16e-10 9.24e-13 -7.0 4.98e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 47
(scaled) (unscaled)
Objective...............: -2.7514613829920171e+02 -2.7514613829920170e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2601120180840352e-07 1.2601120180840352e-05
Overall NLP error.......: 1.2601120180840352e-07 1.2601120180840352e-05
Number of objective function evaluations = 48
Number of objective gradient evaluations = 48
Number of equality constraint evaluations = 48
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 48
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 47
Total CPU secs in IPOPT (w/o function evaluations) = 0.058
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 62776.44
Variable costs: 35693.78
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 351.37
Simulating time_step 2020-07-10 23:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.4864472e+04 6.25e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.4905865e+04 6.25e+03 9.90e+01 -1.0 2.70e+04 - 2.02e-04 1.94e-04h 1
2 -2.2211533e+04 6.24e+03 1.00e+02 -1.0 2.66e+04 - 1.94e-04 8.73e-04h 1
3 -1.4982655e+04 6.23e+03 1.00e+02 -1.0 1.85e+04 - 8.40e-04 1.75e-03h 1
4 1.2799461e+04 6.20e+03 1.01e+02 -1.0 3.42e+03 - 1.68e-03 5.91e-03h 1
5 9.0641058e+04 6.09e+03 1.00e+02 -1.0 2.36e+03 - 9.56e-03 1.65e-02h 1
6 2.8963635e+05 5.83e+03 9.83e+01 -1.0 2.39e+03 - 3.14e-02 4.27e-02h 1
7 7.8517701e+05 5.18e+03 8.21e+01 -1.0 2.47e+03 - 3.56e-01 1.11e-01h 1
8 3.6456557e+06 1.38e+03 5.88e+01 -1.0 3.83e+03 - 3.45e-01 7.34e-01h 1
9 4.1034660e+06 6.42e+02 5.01e+01 -1.0 5.78e+03 - 2.50e-01 5.34e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 4.1042345e+06 6.40e+02 3.81e+01 -1.0 7.50e+03 - 3.35e-01 3.61e-03h 1
11 4.1978978e+06 6.39e+00 8.07e+01 -1.0 1.10e+04 - 1.64e-01 9.90e-01h 1
12 4.1362193e+06 5.54e+00 2.18e+03 -1.0 1.19e+04 - 3.64e-01 1.33e-01f 1
13 4.1146634e+06 5.36e+00 2.80e+03 -1.0 2.63e+04 - 9.40e-02 3.27e-02f 1
14 3.5640188e+06 1.70e+00 7.54e+03 -1.0 3.15e+04 - 5.28e-02 6.84e-01f 1
15 3.2615791e+06 1.35e+00 1.21e+04 -1.0 5.16e+04 - 1.48e-02 2.04e-01f 1
16 3.1043653e+06 1.29e+00 1.21e+04 -1.0 8.79e+04 - 3.25e-02 4.42e-02f 1
17 3.1022634e+06 1.29e+00 7.51e+03 -1.0 8.82e+04 - 2.94e-01 5.74e-04f 1
18 1.8799095e+06 8.67e-01 5.49e+03 -1.0 9.30e+04 - 1.85e-01 3.28e-01f 1
19 1.8565384e+06 8.58e-01 2.92e+04 -1.0 6.59e+04 - 4.96e-01 9.93e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.4535269e+06 6.95e-01 6.49e+04 -1.0 6.61e+04 - 7.64e-01 1.90e-01f 1
21 1.4480394e+06 6.93e-01 7.50e+04 -1.0 1.45e+05 - 1.21e-01 3.29e-03f 1
22 1.2539328e+06 5.90e-01 5.08e+04 -1.0 1.55e+05 - 1.39e-03 1.49e-01f 1
23 1.2233394e+06 5.83e-01 6.28e+04 -1.0 1.29e+06 - 1.34e-01 1.21e-02f 1
24 1.2132419e+06 5.78e-01 6.17e+04 -1.0 1.74e+05 - 1.58e-03 7.69e-03f 1
25 1.1461005e+06 5.64e-01 5.77e+04 -1.0 1.34e+06 - 2.06e-03 2.52e-02f 1
26 1.1021559e+06 5.54e-01 6.40e+04 -1.0 1.33e+06 - 8.44e-02 1.69e-02f 1
27 1.0691818e+06 5.47e-01 6.88e+04 -1.0 1.22e+06 - 6.45e-02 1.34e-02f 1
28 1.0645433e+06 5.44e-01 1.31e+05 -1.0 1.79e+05 - 5.64e-01 4.49e-03f 1
29 6.8187352e+05 4.18e-01 7.91e+04 -1.0 8.48e+05 - 4.11e-02 2.32e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 6.7790631e+05 4.16e-01 8.20e+04 -1.0 4.07e+05 - 2.76e-02 4.84e-03f 1
31 6.7684141e+05 4.15e-01 8.17e+04 -1.0 1.95e+05 - 7.49e-04 1.64e-03f 1
32 6.3718036e+04 9.81e-02 2.99e+04 -1.0 3.15e+05 - 8.37e-01 7.64e-01f 1
33 -1.5659558e+04 1.53e-02 2.51e+05 -1.0 4.90e+04 - 4.02e-01 8.44e-01f 1
34 -2.7636340e+04 6.06e-04 8.05e+05 -1.0 6.54e+04 - 6.70e-01 9.60e-01f 1
35 -2.8221457e+04 3.56e-04 3.42e+05 -1.0 1.43e+05 - 4.32e-01 4.13e-01f 1
36 -2.8210159e+04 2.33e-10 2.45e+06 -1.0 2.13e+04 - 4.37e-01 1.00e+00f 1
37 -2.8362719e+04 1.16e-10 8.38e+05 -1.0 3.33e+04 - 6.51e-01 5.81e-01f 1
38 -2.8339381e+04 2.33e-10 4.78e+05 -1.0 3.61e+04 - 4.93e-01 1.00e+00f 1
39 -2.8335949e+04 1.16e-10 1.44e+05 -1.0 6.51e+04 - 7.00e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -2.8324745e+04 1.16e-10 3.87e+04 -1.0 1.72e+05 - 7.31e-01 1.00e+00f 1
41 -2.8313413e+04 1.16e-10 1.00e-06 -1.0 1.55e+05 - 1.00e+00 1.00e+00f 1
42 -2.8833007e+04 1.16e-10 1.62e+06 -5.7 1.26e+05 - 7.99e-01 9.61e-01f 1
43 -2.8856343e+04 2.33e-10 9.03e+05 -5.7 3.57e+05 - 4.60e-01 5.39e-01f 1
44 -2.8868948e+04 2.33e-10 3.59e+05 -5.7 2.02e+05 - 6.01e-01 5.94e-01f 1
45 -2.8879053e+04 1.16e-10 1.24e+05 -5.7 1.53e+05 - 7.07e-01 9.67e-01f 1
46 -2.8879803e+04 1.16e-10 1.63e+04 -5.7 2.96e+04 - 8.69e-01 9.13e-01f 1
47 -2.8879864e+04 2.33e-10 1.85e-11 -5.7 2.42e+03 - 1.00e+00 1.00e+00f 1
48 -2.8879875e+04 1.16e-10 9.24e-13 -7.0 3.64e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 48
(scaled) (unscaled)
Objective...............: -2.8879874619828064e+02 -2.8879874619828064e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 3.2463425700943716e-07 3.2463425700943718e-05
Overall NLP error.......: 3.2463425700943716e-07 3.2463425700943718e-05
Number of objective function evaluations = 49
Number of objective gradient evaluations = 49
Number of equality constraint evaluations = 49
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 49
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 48
Total CPU secs in IPOPT (w/o function evaluations) = 0.033
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 65504.44
Variable costs: 32056.36
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 143.91
Simulating time_step 2020-07-11 00:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.6179333e+04 6.25e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.6221096e+04 6.25e+03 9.90e+01 -1.0 2.70e+04 - 2.02e-04 1.94e-04h 1
2 -2.3430423e+04 6.24e+03 1.00e+02 -1.0 2.66e+04 - 1.94e-04 8.73e-04h 1
3 -1.5615866e+04 6.23e+03 1.00e+02 -1.0 1.85e+04 - 8.24e-04 1.75e-03h 1
4 1.4968943e+04 6.20e+03 1.01e+02 -1.0 3.57e+03 - 1.68e-03 5.90e-03h 1
5 1.0053380e+05 6.09e+03 1.00e+02 -1.0 2.36e+03 - 9.49e-03 1.65e-02h 1
6 3.1764659e+05 5.84e+03 9.84e+01 -1.0 2.39e+03 - 3.11e-02 4.24e-02h 1
7 8.6014367e+05 5.19e+03 8.22e+01 -1.0 2.47e+03 - 3.69e-01 1.11e-01h 1
8 1.4032755e+06 4.53e+03 7.18e+01 -1.0 3.91e+03 - 3.50e-01 1.26e-01h 1
9 3.2215698e+06 2.28e+03 3.62e+01 -1.0 6.65e+03 - 3.19e-01 4.96e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.3467551e+06 2.11e+03 3.34e+01 -1.0 9.81e+03 - 2.10e-01 7.75e-02h 1
11 3.3694765e+06 2.07e+03 3.28e+01 -1.0 1.24e+04 - 2.01e-01 1.62e-02h 1
12 4.6227136e+06 2.07e+01 5.91e+01 -1.0 1.55e+04 - 1.64e-01 9.90e-01h 1
13 4.5778789e+06 1.91e+01 6.53e+02 -1.0 1.90e+04 - 3.01e-01 7.68e-02f 1
14 4.5431261e+06 1.83e+01 6.30e+02 -1.0 3.12e+04 - 4.41e-02 4.27e-02f 1
15 3.9002736e+06 5.83e+00 7.02e+03 -1.0 3.42e+04 - 2.99e-02 6.81e-01f 1
16 3.6388716e+06 5.12e+00 7.54e+03 -1.0 5.32e+04 - 1.48e-02 1.22e-01f 1
17 3.5033719e+06 4.93e+00 7.26e+03 -1.0 8.70e+04 - 5.27e-02 3.70e-02f 1
18 3.5013815e+06 4.93e+00 7.26e+03 -1.0 8.74e+04 - 3.12e-01 5.41e-04f 1
19 2.2846910e+06 3.35e+00 4.94e+03 -1.0 9.22e+04 - 2.76e-01 3.19e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 2.2574707e+06 3.32e+00 1.30e+04 -1.0 7.46e+04 - 6.93e-01 1.11e-02f 1
21 1.7800253e+06 2.71e+00 1.71e+04 -1.0 3.24e+05 - 5.28e-01 1.84e-01f 1
22 1.7717784e+06 2.70e+00 2.03e+04 -1.0 7.51e+05 - 1.48e-01 3.26e-03f 1
23 1.2997749e+06 2.08e+00 1.05e+04 -1.0 6.54e+05 - 1.76e-03 2.28e-01f 1
24 1.2670232e+06 2.06e+00 1.04e+04 -1.0 1.29e+06 - 1.16e-02 1.16e-02f 1
25 1.2648384e+06 2.05e+00 1.61e+04 -1.0 3.28e+05 - 1.91e-01 1.33e-03f 1
26 1.0686194e+06 1.79e+00 1.01e+04 -1.0 2.60e+05 - 2.39e-03 1.31e-01f 1
27 9.9413379e+05 1.73e+00 8.97e+03 -1.0 1.11e+06 - 8.84e-03 3.13e-02f 1
28 9.9305649e+05 1.73e+00 1.60e+04 -1.0 4.88e+05 - 1.96e-01 6.90e-04f 1
29 8.8041951e+05 1.50e+00 1.87e+04 -1.0 2.50e+05 - 2.66e-01 1.32e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 6.0373780e+05 1.02e+00 1.50e+03 -1.0 4.19e+05 - 2.87e-03 3.22e-01f 1
31 5.6183345e+05 9.80e-01 2.12e+04 -1.0 3.55e+05 - 3.94e-01 3.70e-02f 1
32 5.6044839e+05 9.78e-01 2.15e+04 -1.0 2.89e+05 - 7.73e-03 1.88e-03f 1
33 5.0104871e+04 2.72e-01 3.92e+04 -1.0 3.70e+05 - 4.57e-03 7.22e-01f 1
34 4.7981470e+04 2.68e-01 1.53e+05 -1.0 5.71e+04 - 8.76e-01 1.48e-02f 1
35 -2.6078357e+04 1.09e-02 1.67e+04 -1.0 3.14e+04 - 8.56e-01 9.59e-01f 1
36 -2.8302993e+04 4.99e-03 1.46e+05 -1.0 1.52e+05 - 5.04e-01 5.44e-01f 1
37 -2.9501089e+04 1.16e-10 1.63e+06 -1.0 2.17e+04 - 6.23e-01 1.00e+00f 1
38 -2.9589896e+04 1.16e-10 6.40e+05 -1.0 4.54e+04 - 7.16e-01 7.66e-01f 1
39 -2.9572404e+04 1.16e-10 7.60e+05 -1.0 1.32e+05 - 4.75e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -2.9566321e+04 2.33e-10 1.00e-06 -1.0 1.43e+05 - 1.00e+00 1.00e+00f 1
41 -3.0142162e+04 1.16e-10 1.47e+06 -5.7 1.00e+05 - 8.16e-01 9.63e-01f 1
42 -3.0157221e+04 1.16e-10 4.93e+05 -5.7 2.39e+05 - 6.21e-01 4.50e-01f 1
43 -3.0170997e+04 1.16e-10 1.34e+05 -5.7 1.41e+05 - 7.63e-01 8.48e-01f 1
44 -3.0174161e+04 1.16e-10 1.86e+04 -5.7 9.11e+04 - 8.74e-01 9.27e-01f 1
45 -3.0174376e+04 1.16e-10 2.50e+03 -5.7 7.46e+03 - 8.73e-01 9.30e-01f 1
46 -3.0174391e+04 2.33e-10 1.85e-11 -5.7 5.11e+02 - 1.00e+00 1.00e+00f 1
47 -3.0174401e+04 1.16e-10 4.79e-01 -7.0 3.72e+01 - 9.97e-01 1.00e+00f 1
48 -3.0174401e+04 1.16e-10 9.24e-13 -7.0 9.21e-01 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 48
(scaled) (unscaled)
Objective...............: -3.0174400679693770e+02 -3.0174400679693768e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.7119428578022848e-07 1.7119428578022850e-05
Overall NLP error.......: 1.7119428578022848e-07 1.7119428578022850e-05
Number of objective function evaluations = 49
Number of objective gradient evaluations = 49
Number of equality constraint evaluations = 49
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 49
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 48
Total CPU secs in IPOPT (w/o function evaluations) = 0.032
Total CPU secs in NLP function evaluations = 0.002
EXIT: Optimal Solution Found.
Fixed costs: 57898.87
Variable costs: 27481.10
Number on/offs: 1
Sum on/off ramps: 0.00
Sum nominal ramps: 298.20
Simulating time_step 2020-07-11 01:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.7424758e+04 6.25e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.7466867e+04 6.25e+03 9.90e+01 -1.0 2.70e+04 - 2.02e-04 1.94e-04h 1
2 -2.4541069e+04 6.24e+03 1.00e+02 -1.0 2.66e+04 - 1.94e-04 8.46e-04h 1
3 -1.6529893e+04 6.23e+03 1.00e+02 -1.0 1.87e+04 - 8.16e-04 1.72e-03h 1
4 1.4153430e+04 6.20e+03 1.01e+02 -1.0 3.62e+03 - 1.65e-03 5.90e-03h 1
5 9.9587405e+04 6.09e+03 1.00e+02 -1.0 2.36e+03 - 9.47e-03 1.64e-02h 1
6 3.1639283e+05 5.84e+03 9.84e+01 -1.0 2.39e+03 - 3.09e-02 4.22e-02h 1
7 8.5920445e+05 5.19e+03 8.23e+01 -1.0 2.47e+03 - 3.64e-01 1.10e-01h 1
8 1.3836868e+06 4.56e+03 7.23e+01 -1.0 3.88e+03 - 3.45e-01 1.21e-01h 1
9 3.2052741e+06 2.34e+03 3.71e+01 -1.0 5.90e+03 - 3.25e-01 4.86e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.3600207e+06 2.14e+03 3.38e+01 -1.0 8.57e+03 - 2.09e-01 8.85e-02h 1
11 3.3799766e+06 2.11e+03 3.34e+01 -1.0 1.06e+04 - 2.06e-01 1.31e-02h 1
12 4.7834810e+06 2.11e+01 5.89e+01 -1.0 1.31e+04 - 1.62e-01 9.90e-01h 1
13 4.7433316e+06 1.93e+01 6.34e+02 -1.0 1.65e+04 - 3.04e-01 8.28e-02f 1
14 4.7113481e+06 1.86e+01 6.15e+02 -1.0 3.14e+04 - 4.21e-02 4.00e-02f 1
15 4.0267339e+06 5.79e+00 7.14e+03 -1.0 3.43e+04 - 2.96e-02 6.88e-01f 1
16 3.7307970e+06 5.11e+00 7.61e+03 -1.0 5.33e+04 - 1.49e-02 1.17e-01f 1
17 3.5788075e+06 4.92e+00 7.33e+03 -1.0 8.72e+04 - 5.08e-02 3.73e-02f 1
18 3.5765858e+06 4.92e+00 7.33e+03 -1.0 8.75e+04 - 3.11e-01 5.40e-04f 1
19 2.2198565e+06 3.39e+00 5.05e+03 -1.0 9.24e+04 - 2.75e-01 3.10e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 2.2065656e+06 3.38e+00 9.17e+03 -1.0 6.71e+04 - 4.78e-01 4.33e-03f 1
21 2.1564679e+06 3.30e+00 2.20e+04 -1.0 7.41e+04 - 7.32e-01 2.23e-02f 1
22 1.6439799e+06 2.69e+00 1.67e+04 -1.0 4.73e+05 - 1.20e-01 1.87e-01f 1
23 1.6358694e+06 2.68e+00 1.66e+04 -1.0 5.60e+05 - 1.40e-03 3.52e-03f 1
24 1.6044113e+06 2.65e+00 2.14e+04 -1.0 1.30e+06 - 2.25e-01 9.35e-03f 1
25 1.5648738e+06 2.61e+00 2.08e+04 -1.0 6.41e+05 - 2.91e-03 1.55e-02f 1
26 1.5164057e+06 2.57e+00 2.01e+04 -1.0 1.09e+06 - 4.54e-04 1.48e-02f 1
27 1.4291910e+06 2.50e+00 2.13e+04 -1.0 1.15e+06 - 9.65e-02 2.66e-02f 1
28 1.3317063e+06 2.43e+00 2.11e+04 -1.0 1.06e+06 - 4.96e-02 3.15e-02f 1
29 1.3273697e+06 2.42e+00 3.32e+04 -1.0 5.24e+05 - 4.78e-01 2.25e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 7.0552218e+05 1.64e+00 1.91e+04 -1.0 5.80e+05 - 1.88e-01 3.21e-01f 1
31 6.8520986e+05 1.60e+00 2.03e+04 -1.0 3.26e+05 - 7.06e-02 2.56e-02f 1
32 6.8452203e+05 1.60e+00 2.03e+04 -1.0 1.17e+05 - 9.75e-04 1.16e-03f 1
33 1.7520456e+05 6.73e-01 1.11e+04 -1.0 3.24e+05 - 6.46e-01 5.79e-01f 1
34 3.4327864e+04 2.29e-01 1.39e+04 -1.0 9.87e+04 - 4.66e-01 6.61e-01f 1
35 2.3853585e+04 1.95e-01 1.79e+05 -1.0 7.26e+04 - 8.76e-01 1.49e-01f 1
36 -2.9684240e+04 1.75e-02 2.18e+04 -1.0 9.63e+04 - 9.29e-01 9.10e-01f 1
37 -3.0688721e+04 1.39e-02 1.33e+06 -1.0 1.01e+05 - 7.37e-01 2.06e-01f 1
38 -3.4635242e+04 4.18e-06 1.54e+06 -1.0 1.69e+05 - 3.41e-01 1.00e+00f 1
39 -3.4624321e+04 2.33e-10 9.37e+04 -1.0 1.95e+05 - 9.86e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -3.4623311e+04 1.16e-10 1.00e-06 -1.0 7.19e+04 - 1.00e+00 1.00e+00f 1
41 -3.5097522e+04 1.16e-10 1.57e+06 -5.7 7.65e+04 - 7.95e-01 9.52e-01f 1
42 -3.5128651e+04 1.16e-10 6.97e+05 -5.7 4.15e+05 - 5.98e-01 7.35e-01f 1
43 -3.5139109e+04 1.16e-10 2.98e+05 -5.7 1.51e+05 - 6.36e-01 9.81e-01f 1
44 -3.5140720e+04 1.16e-10 4.45e+04 -5.7 7.12e+04 - 8.51e-01 9.06e-01f 1
45 -3.5140902e+04 1.16e-10 1.52e+01 -5.7 7.64e+03 - 1.00e+00 9.90e-01f 1
46 -3.5140902e+04 1.16e-10 1.85e-11 -5.7 3.29e+01 - 1.00e+00 1.00e+00f 1
47 -3.5140911e+04 1.16e-10 9.38e-13 -7.0 4.13e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 47
(scaled) (unscaled)
Objective...............: -3.5140911444255653e+02 -3.5140911444255653e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2652016124809698e-07 1.2652016124809697e-05
Overall NLP error.......: 1.2652016124809698e-07 1.2652016124809697e-05
Number of objective function evaluations = 48
Number of objective gradient evaluations = 48
Number of equality constraint evaluations = 48
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 48
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 47
Total CPU secs in IPOPT (w/o function evaluations) = 0.037
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 57058.87
Variable costs: 24220.08
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 149.70
Simulating time_step 2020-07-11 02:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.2340593e+04 2.91e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.2410675e+04 2.91e+05 9.90e+01 -1.0 2.70e+04 - 3.41e-04 3.20e-04h 1
2 -2.9131427e+04 2.91e+05 9.99e+01 -1.0 2.49e+04 - 3.59e-04 1.22e-03h 1
3 -1.2343886e+04 2.89e+05 1.01e+02 -1.0 1.12e+04 - 9.41e-04 4.66e-03h 1
4 1.2279349e+04 2.87e+05 1.01e+02 -1.0 2.50e+03 - 4.83e-03 6.39e-03h 1
5 5.1417123e+04 2.85e+05 9.92e+01 -1.0 4.79e+03 - 1.46e-02 1.02e-02h 1
6 5.4445133e+04 2.84e+05 3.45e+02 -1.0 1.45e+05 - 8.58e-02 8.16e-04h 1
7 7.6420713e+05 2.27e+05 3.00e+02 -1.0 3.03e+04 - 3.03e-02 2.02e-01h 1
8 9.0578155e+05 2.15e+05 2.38e+02 -1.0 2.46e+04 - 2.24e-01 5.05e-02h 1
9 2.4903366e+06 8.61e+04 1.41e+02 -1.0 2.34e+04 - 4.05e-01 6.01e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.5931295e+06 7.65e+04 9.71e+01 -1.0 9.57e+03 - 2.52e-01 1.11e-01h 1
11 2.7841927e+06 5.68e+04 7.93e+01 -1.0 8.67e+03 - 2.13e-01 2.58e-01h 1
12 2.7869244e+06 5.64e+04 3.95e+01 -1.0 9.57e+03 - 3.03e-01 6.16e-03h 1
13 3.1003944e+06 1.45e+03 7.77e+01 -1.0 1.33e+04 - 1.71e-01 9.74e-01h 1
14 3.0923640e+06 1.43e+03 5.10e+02 -1.0 1.80e+04 - 2.94e-01 1.85e-02f 1
15 2.6900436e+06 5.99e+02 1.80e+03 -1.0 3.23e+04 - 2.94e-02 5.81e-01f 1
16 2.3283438e+06 4.08e+02 4.87e+03 -1.0 4.81e+04 - 3.03e-02 3.19e-01f 1
17 2.3191448e+06 4.07e+02 4.84e+03 -1.0 8.62e+04 - 2.43e-02 3.50e-03f 1
18 2.3098005e+06 4.05e+02 4.82e+03 -1.0 8.96e+04 - 3.23e-02 3.79e-03f 1
19 1.3607389e+06 2.53e+02 3.01e+03 -1.0 9.11e+04 - 1.88e-01 3.76e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.3524950e+06 2.52e+02 3.00e+03 -1.0 6.34e+04 - 1.51e-01 4.40e-03f 1
21 1.3462468e+06 2.51e+02 2.98e+03 -1.0 6.38e+04 - 1.95e-03 4.44e-03f 1
22 1.2379701e+06 2.37e+02 2.82e+03 -1.0 6.72e+04 - 4.19e-03 5.51e-02f 1
23 1.2245672e+06 2.35e+02 5.65e+03 -1.0 6.41e+04 - 5.72e-01 9.31e-03f 1
24 1.0237136e+06 2.04e+02 4.21e+03 -1.0 6.59e+04 - 7.23e-02 1.30e-01f 1
25 1.0211972e+06 2.04e+02 1.50e+04 -1.0 7.23e+04 - 7.61e-01 2.04e-03f 1
26 5.4075817e+05 1.40e+02 6.63e+03 -1.0 5.48e+05 - 5.19e-02 3.11e-01f 1
27 5.3364850e+05 1.40e+02 6.50e+03 -1.0 5.01e+05 - 6.57e-04 4.95e-03f 1
28 5.3130289e+05 1.39e+02 7.91e+03 -1.0 1.32e+06 - 6.89e-02 1.01e-03f 1
29 4.9550148e+05 1.37e+02 7.37e+03 -1.0 8.21e+05 - 7.94e-04 1.94e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 4.8440633e+05 1.36e+02 8.28e+03 -1.0 1.49e+06 - 4.85e-02 4.23e-03f 1
31 4.3076991e+05 1.33e+02 7.78e+03 -1.0 1.53e+06 - 5.78e-03 2.08e-02f 1
32 4.2968641e+05 1.33e+02 1.25e+04 -1.0 4.30e+05 - 2.19e-01 9.12e-04f 1
33 2.4049837e+05 9.97e+01 1.53e+04 -1.0 3.57e+05 - 5.23e-01 2.51e-01f 1
34 4.6117117e+04 8.20e+01 9.82e+03 -1.0 8.52e+05 - 8.35e-02 1.78e-01f 1
35 4.4052573e+04 8.17e+01 2.76e+04 -1.0 4.14e+05 - 5.10e-01 3.66e-03f 1
36 3.9607110e+04 7.77e+01 5.78e+04 -1.0 3.53e+04 - 9.43e-01 4.95e-02f 1
37 -2.4334344e+03 3.56e+01 4.01e+04 -1.0 1.74e+05 - 9.08e-01 5.41e-01f 1
38 -1.2066893e+04 2.62e+01 7.63e+04 -1.0 2.85e+05 - 8.51e-01 2.65e-01f 1
39 -1.6812734e+04 2.13e+01 8.79e+04 -1.0 2.68e+05 - 4.27e-01 1.87e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -3.6049674e+04 1.34e+00 4.53e+04 -1.0 2.39e+05 - 5.50e-01 9.37e-01f 1
41 -3.7348985e+04 1.16e-10 1.00e-06 -1.0 1.13e+05 - 1.00e+00 1.00e+00f 1
42 -3.7754705e+04 1.16e-10 1.88e+05 -3.8 5.73e+04 - 8.51e-01 9.44e-01f 1
43 -3.7789238e+04 2.33e-10 1.20e+05 -3.8 3.18e+05 - 6.02e-01 1.00e+00f 1
44 -3.7791943e+04 1.16e-10 3.63e+04 -3.8 6.92e+04 - 6.97e-01 1.00e+00f 1
45 -3.7792018e+04 2.33e-10 1.50e-09 -3.8 3.86e+03 - 1.00e+00 1.00e+00f 1
46 -3.7792666e+04 2.33e-10 1.87e+03 -5.7 3.38e+03 - 1.00e+00 8.74e-01f 1
47 -3.7792748e+04 2.33e-10 2.92e+02 -5.7 4.20e+02 - 8.94e-01 1.00e+00f 1
48 -3.7792748e+04 1.16e-10 1.85e-11 -5.7 5.94e-01 - 1.00e+00 1.00e+00f 1
49 -3.7792756e+04 1.16e-10 9.24e-13 -7.0 4.12e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 49
(scaled) (unscaled)
Objective...............: -3.7792755951055346e+02 -3.7792755951055347e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2393884912086111e-07 1.2393884912086111e-05
Overall NLP error.......: 1.2393884912086111e-07 1.2393884912086111e-05
Number of objective function evaluations = 50
Number of objective gradient evaluations = 50
Number of equality constraint evaluations = 50
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 50
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 49
Total CPU secs in IPOPT (w/o function evaluations) = 0.035
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 58734.87
Variable costs: 18679.96
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 370.54
Simulating time_step 2020-07-11 03:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.4991134e+04 2.85e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.5074108e+04 2.85e+05 9.90e+01 -1.0 2.70e+04 - 4.12e-04 3.82e-04h 1
2 -3.2374518e+04 2.84e+05 9.99e+01 -1.0 2.36e+04 - 3.89e-04 1.38e-03h 1
3 -2.2726882e+04 2.83e+05 1.00e+02 -1.0 8.82e+03 - 1.06e-03 3.18e-03h 1
4 -2.5455638e+03 2.82e+05 1.00e+02 -1.0 6.29e+03 - 3.77e-03 6.14e-03h 1
5 6.7597712e+04 2.76e+05 9.97e+01 -1.0 3.04e+03 - 1.38e-02 2.11e-02h 1
6 2.9402599e+05 2.57e+05 9.11e+01 -1.0 2.75e+03 - 7.81e-02 6.94e-02h 1
7 7.3350402e+05 2.19e+05 7.63e+01 -1.0 2.61e+03 - 1.69e-01 1.45e-01h 1
8 9.6272539e+05 2.00e+05 6.95e+01 -1.0 3.14e+03 - 6.34e-01 8.86e-02h 1
9 1.5632474e+06 1.43e+05 4.98e+01 -1.0 8.67e+03 - 1.07e-01 2.83e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.5754861e+06 1.42e+05 4.94e+01 -1.0 9.91e+03 - 4.80e-01 8.80e-03h 1
11 1.8464188e+06 1.03e+05 3.59e+01 -1.0 2.00e+04 - 1.22e-01 2.73e-01h 1
12 1.8473466e+06 1.03e+05 3.58e+01 -1.0 2.21e+04 - 1.64e-01 2.46e-03h 1
13 1.9706852e+06 5.26e+04 5.45e+01 -1.0 3.25e+04 - 1.69e-02 4.90e-01h 1
14 1.9528281e+06 5.12e+04 5.37e+01 -1.0 4.66e+04 - 1.86e-02 2.56e-02f 1
15 1.9233384e+06 5.01e+04 5.39e+01 -1.0 8.17e+04 - 4.90e-03 2.13e-02f 1
16 1.8022327e+06 4.60e+04 5.37e+01 -1.0 8.91e+04 - 3.34e-02 8.15e-02f 1
17 1.6951432e+06 4.29e+04 4.56e+01 -1.0 8.56e+04 - 2.00e-01 6.82e-02f 1
18 1.4376733e+06 3.70e+04 3.92e+01 -1.0 8.35e+04 - 2.07e-01 1.38e-01f 1
19 1.4348330e+06 3.69e+04 3.92e+01 -1.0 7.47e+04 - 3.99e-01 1.63e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.1378102e+06 2.98e+04 6.82e+01 -1.0 8.56e+04 - 7.26e-01 1.94e-01f 1
21 1.1307560e+06 2.97e+04 9.65e+01 -1.0 6.82e+05 - 3.01e-01 3.30e-03f 1
22 1.0062140e+06 2.80e+04 1.03e+02 -1.0 9.60e+05 - 1.77e-01 5.62e-02f 1
23 9.8149746e+05 2.76e+04 9.98e+01 -1.0 7.50e+05 - 2.17e-03 1.50e-02f 1
24 9.4149851e+05 2.72e+04 9.71e+01 -1.0 1.24e+06 - 4.40e-04 1.35e-02f 1
25 9.4002865e+05 2.72e+04 1.34e+02 -1.0 7.08e+05 - 3.51e-01 7.54e-04f 1
26 5.2576311e+05 2.15e+04 9.30e+01 -1.0 8.93e+05 - 8.59e-02 2.09e-01f 1
27 2.2046523e+05 1.63e+04 1.03e+02 -1.0 4.60e+05 - 4.90e-01 2.41e-01f 1
28 1.7558331e+05 1.56e+04 1.23e+02 -1.0 7.34e+05 - 1.81e-01 4.32e-02f 1
29 1.1367796e+05 1.43e+04 1.75e+02 -1.0 5.05e+05 - 4.27e-01 8.44e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 1.1236610e+05 1.42e+04 3.44e+02 -1.0 9.87e+04 - 8.57e-01 5.18e-03f 1
31 -1.6839223e+03 3.53e+03 7.59e+01 -1.0 4.87e+04 - 7.04e-01 7.52e-01f 1
32 -3.6737577e+04 8.63e+01 4.73e+02 -1.0 6.73e+04 - 3.87e-01 9.76e-01f 1
33 -3.7190456e+04 4.45e+01 1.45e+04 -1.0 7.92e+04 - 9.32e-01 4.84e-01f 1
34 -3.7233016e+04 2.76e+01 3.09e+04 -1.0 1.24e+05 - 7.28e-01 3.81e-01f 1
35 -3.7296016e+04 1.38e+01 3.48e+04 -1.0 1.68e+05 - 6.91e-01 5.00e-01f 2
36 -3.7354943e+04 2.33e-10 1.00e-06 -1.0 1.24e+05 - 1.00e+00 1.00e+00h 1
37 -3.7778537e+04 1.16e-10 1.45e+04 -3.8 1.44e+04 - 9.03e-01 9.46e-01f 1
38 -3.7806710e+04 2.33e-10 1.71e+04 -3.8 2.64e+05 - 4.72e-01 1.00e+00f 1
39 -3.7807939e+04 2.33e-10 3.27e+01 -3.8 4.41e+04 - 9.99e-01 9.52e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -3.7807938e+04 1.16e-10 1.50e-09 -3.8 1.11e+03 - 1.00e+00 1.00e+00f 1
41 -3.7808584e+04 1.16e-10 1.86e+03 -5.7 3.30e+03 - 1.00e+00 8.75e-01f 1
42 -3.7808661e+04 2.33e-10 2.92e+02 -5.7 4.16e+02 - 8.94e-01 1.00e+00f 1
43 -3.7808662e+04 1.16e-10 1.85e-11 -5.7 1.42e-01 - 1.00e+00 1.00e+00f 1
44 -3.7808670e+04 1.16e-10 9.24e-13 -7.0 4.12e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 44
(scaled) (unscaled)
Objective...............: -3.7808669603156494e+02 -3.7808669603156493e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2396779820076721e-07 1.2396779820076721e-05
Overall NLP error.......: 1.2396779820076721e-07 1.2396779820076721e-05
Number of objective function evaluations = 46
Number of objective gradient evaluations = 45
Number of equality constraint evaluations = 46
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 45
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 44
Total CPU secs in IPOPT (w/o function evaluations) = 0.034
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 59494.87
Variable costs: 16604.22
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 86.32
Simulating time_step 2020-07-11 04:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.4957948e+04 6.25e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.5041522e+04 6.25e+03 9.90e+01 -1.0 2.70e+04 - 4.12e-04 3.82e-04h 1
2 -3.1673264e+04 6.24e+03 9.99e+01 -1.0 2.36e+04 - 3.89e-04 1.38e-03h 1
3 -1.1300375e+04 6.20e+03 1.01e+02 -1.0 8.82e+03 - 1.06e-03 5.84e-03h 1
4 4.3636446e+04 6.11e+03 1.02e+02 -1.0 2.41e+03 - 6.95e-03 1.48e-02h 1
5 1.5365020e+05 5.93e+03 9.96e+01 -1.0 2.38e+03 - 2.43e-02 3.00e-02h 1
6 5.5403897e+05 5.26e+03 8.33e+01 -1.0 2.44e+03 - 3.50e-01 1.13e-01h 1
7 9.1900032e+05 4.64e+03 7.36e+01 -1.0 3.75e+03 - 2.87e-01 1.17e-01h 1
8 1.8352202e+06 3.08e+03 4.87e+01 -1.0 5.25e+03 - 4.01e-01 3.37e-01h 1
9 2.0902209e+06 2.59e+03 4.11e+01 -1.0 8.64e+03 - 2.93e-01 1.56e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.1019682e+06 2.57e+03 4.07e+01 -1.0 1.19e+04 - 2.81e-01 9.44e-03h 1
11 2.5224266e+06 1.56e+03 2.47e+01 -1.0 1.60e+04 - 2.60e-01 3.94e-01h 1
12 2.5397840e+06 8.84e+02 3.17e+01 -1.0 2.87e+04 - 7.27e-02 4.33e-01h 1
13 2.5278860e+06 8.72e+02 3.00e+01 -1.0 3.96e+04 - 3.61e-02 1.36e-02f 1
14 1.8301051e+06 4.68e+02 1.01e+03 -1.0 5.34e+04 - 2.02e-03 4.64e-01f 1
15 1.8199824e+06 4.65e+02 9.79e+02 -1.0 7.17e+04 - 2.63e-01 4.84e-03f 1
16 1.7968575e+06 4.60e+02 9.69e+02 -1.0 7.47e+04 - 2.84e-01 1.11e-02f 1
17 1.2159901e+06 3.42e+02 7.19e+02 -1.0 7.58e+04 - 2.91e-01 2.58e-01f 1
18 1.2096872e+06 3.41e+02 7.17e+02 -1.0 5.69e+04 - 8.15e-01 3.61e-03f 1
19 1.1524615e+06 3.29e+02 6.93e+02 -1.0 4.46e+05 - 1.59e-01 3.25e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.1004579e+06 3.19e+02 6.72e+02 -1.0 6.04e+05 - 1.92e-03 3.12e-02f 1
21 1.0595605e+06 3.15e+02 6.63e+02 -1.0 1.28e+06 - 1.13e-03 1.33e-02f 1
22 1.0579891e+06 3.15e+02 6.62e+02 -1.0 6.17e+05 - 2.98e-01 7.74e-04f 1
23 5.6953576e+05 2.55e+02 5.37e+02 -1.0 9.95e+05 - 1.08e-01 1.90e-01f 1
24 1.7516844e+05 1.93e+02 4.06e+02 -1.0 5.24e+05 - 4.87e-01 2.44e-01f 1
25 1.0092691e+05 1.78e+02 3.75e+02 -1.0 7.38e+05 - 1.60e-01 7.70e-02f 1
26 4.7857542e+04 1.64e+02 3.45e+02 -1.0 5.16e+05 - 4.24e-01 7.88e-02f 1
27 4.7024481e+04 1.63e+02 6.31e+02 -1.0 1.06e+05 - 8.50e-01 4.18e-03f 1
28 2.1639163e+04 1.16e+02 6.84e+02 -1.0 1.70e+05 - 9.11e-01 2.92e-01f 1
29 -2.7672758e+03 6.91e+01 6.92e+02 -1.0 1.43e+05 - 9.27e-01 4.02e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -8.5154265e+03 5.86e+01 1.29e+03 -1.0 3.04e+05 - 9.31e-01 1.52e-01f 1
31 -1.9989347e+04 3.63e+01 1.46e+03 -1.0 1.35e+04 - 1.00e+00 3.80e-01f 1
32 -3.6789530e+04 3.65e+00 3.20e+02 -1.0 6.75e+03 - 1.00e+00 9.00e-01f 1
33 -3.7841653e+04 1.61e+00 7.66e+03 -1.0 3.05e+03 - 1.00e+00 5.60e-01f 1
34 -3.8369746e+04 5.84e-01 1.68e+04 -1.0 5.83e+02 - 1.00e+00 6.36e-01f 1
35 -3.8478192e+04 3.77e-01 7.87e+04 -1.0 5.41e+02 - 1.00e+00 3.55e-01f 2
36 -3.8677352e+04 2.33e-10 1.00e-06 -1.0 1.65e+02 - 1.00e+00 1.00e+00h 1
37 -3.9153032e+04 2.33e-10 1.22e+04 -3.8 1.53e+04 - 9.94e-01 9.55e-01f 1
38 -3.9171732e+04 1.16e-10 4.64e+02 -3.8 3.21e+02 - 1.00e+00 9.67e-01f 1
39 -3.9172074e+04 1.16e-10 5.69e+03 -3.8 1.03e+01 - 1.01e-02 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -3.9172078e+04 1.16e-10 1.50e-09 -3.8 5.39e-02 - 1.00e+00 1.00e+00f 1
41 -3.9172665e+04 1.16e-10 1.86e+03 -5.7 2.17e+01 - 1.00e+00 8.75e-01f 1
42 -3.9172731e+04 1.16e-10 3.12e+02 -5.7 2.73e+00 - 8.94e-01 1.00e+00f 1
43 -3.9172731e+04 2.33e-10 1.85e-11 -5.7 1.26e-01 - 1.00e+00 1.00e+00f 1
44 -3.9172738e+04 1.16e-10 9.24e-13 -7.0 2.57e-01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 44
(scaled) (unscaled)
Objective...............: -3.9172738381776770e+02 -3.9172738381776770e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.3193296207417938e-07 1.3193296207417937e-05
Overall NLP error.......: 1.3193296207417938e-07 1.3193296207417937e-05
Number of objective function evaluations = 46
Number of objective gradient evaluations = 45
Number of equality constraint evaluations = 46
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 45
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 44
Total CPU secs in IPOPT (w/o function evaluations) = 0.030
Total CPU secs in NLP function evaluations = 0.002
EXIT: Optimal Solution Found.
Fixed costs: 57642.87
Variable costs: 14703.09
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 186.40
Simulating time_step 2020-07-11 05:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.6271620e+04 6.25e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.6360908e+04 6.25e+03 9.90e+01 -1.0 2.60e+04 - 4.43e-04 4.08e-04h 1
2 -3.2808262e+04 6.24e+03 9.99e+01 -1.0 2.15e+04 - 4.52e-04 1.46e-03h 1
3 -1.2433594e+04 6.20e+03 1.01e+02 -1.0 7.17e+03 - 1.13e-03 5.87e-03h 1
4 4.1880921e+04 6.11e+03 1.00e+02 -1.0 2.37e+03 - 1.09e-02 1.51e-02h 1
5 2.0988863e+05 5.82e+03 9.23e+01 -1.0 2.39e+03 - 9.52e-02 4.71e-02h 1
6 7.7898196e+05 4.84e+03 8.57e+01 -1.0 2.64e+03 - 8.97e-02 1.68e-01h 1
7 9.5843944e+05 4.53e+03 7.19e+01 -1.0 2.90e+03 - 3.44e-01 6.34e-02h 1
8 2.3885334e+06 2.04e+03 3.24e+01 -1.0 4.42e+03 - 4.61e-01 5.50e-01h 1
9 2.4938873e+06 1.82e+03 3.01e+01 -1.0 8.07e+03 - 3.47e-01 1.08e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.5363786e+06 1.71e+03 2.95e+01 -1.0 1.20e+04 - 2.07e-01 6.12e-02h 1
11 2.5522794e+06 1.66e+03 2.98e+01 -1.0 1.47e+04 - 2.66e-01 2.84e-02h 1
12 2.7456675e+06 5.06e+02 4.51e+01 -1.0 1.98e+04 - 6.11e-02 6.96e-01h 1
13 2.7342514e+06 4.97e+02 3.78e+01 -1.0 3.33e+04 - 1.13e-01 1.65e-02f 1
14 2.4690630e+06 3.75e+02 1.38e+02 -1.0 3.92e+04 - 5.08e-03 2.47e-01f 1
15 1.7132929e+06 2.46e+02 8.36e+02 -1.0 7.80e+04 - 1.90e-02 3.42e-01f 1
16 1.7051935e+06 2.45e+02 8.27e+02 -1.0 6.94e+04 - 3.12e-01 3.73e-03f 1
17 1.6409483e+06 2.38e+02 8.03e+02 -1.0 7.23e+04 - 3.21e-01 2.99e-02f 1
18 1.3905891e+06 2.12e+02 7.13e+02 -1.0 7.17e+04 - 3.59e-01 1.11e-01f 1
19 1.3859110e+06 2.11e+02 7.12e+02 -1.0 6.15e+04 - 7.95e-01 2.61e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.0546786e+06 1.87e+02 6.31e+02 -1.0 6.17e+05 - 3.88e-02 1.14e-01f 1
21 1.0442142e+06 1.86e+02 6.28e+02 -1.0 6.65e+05 - 4.63e-04 4.53e-03f 1
22 1.0311670e+06 1.85e+02 6.26e+02 -1.0 1.32e+06 - 3.02e-01 4.00e-03f 1
23 9.3160467e+05 1.79e+02 6.03e+02 -1.0 9.56e+05 - 1.54e-02 3.63e-02f 1
24 8.7864460e+05 1.75e+02 5.89e+02 -1.0 8.80e+05 - 2.73e-01 2.26e-02f 1
25 3.0368442e+05 1.23e+02 4.16e+02 -1.0 6.52e+05 - 1.29e-01 2.93e-01f 1
26 3.9718943e+04 8.34e+01 2.81e+02 -1.0 3.44e+05 - 4.73e-01 3.25e-01f 1
27 3.1423289e+04 8.15e+01 6.97e+02 -1.0 2.58e+05 - 6.24e-01 2.30e-02f 1
28 3.0493959e+04 8.05e+01 1.41e+03 -1.0 4.84e+04 - 9.56e-01 1.20e-02f 1
29 -3.9580086e+04 1.20e+00 1.91e+02 -1.0 3.04e+05 - 7.13e-01 9.85e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -4.0966938e+04 5.78e-03 1.06e+03 -1.0 5.37e+04 - 9.75e-01 9.95e-01f 1
31 -4.0988322e+04 2.58e-03 2.31e+06 -1.0 1.82e+05 - 1.00e+00 5.54e-01f 1
32 -4.1003812e+04 1.29e-03 2.84e+06 -1.0 2.98e+04 - 1.00e+00 5.00e-01f 2
33 -4.1018824e+04 1.16e-10 1.00e-06 -1.0 4.37e+03 - 1.00e+00 1.00e+00h 1
34 -4.1337924e+04 2.33e-10 1.07e+06 -5.7 1.64e+04 - 8.18e-01 9.27e-01f 1
35 -4.1385159e+04 2.33e-10 1.20e+06 -5.7 2.60e+05 - 2.56e-01 8.21e-01f 1
36 -4.1390283e+04 2.33e-10 1.02e+04 -5.7 2.93e+04 - 9.86e-01 7.78e-01f 1
37 -4.1391199e+04 1.16e-10 2.24e+03 -5.7 6.87e+02 - 1.00e+00 9.21e-01f 1
38 -4.1391253e+04 1.16e-10 2.55e+02 -5.7 3.38e+01 - 8.73e-01 9.36e-01f 1
39 -4.1391257e+04 2.33e-10 1.85e-11 -5.7 2.17e+00 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -4.1391264e+04 1.16e-10 9.24e-13 -7.0 2.71e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 40
(scaled) (unscaled)
Objective...............: -4.1391264356614164e+02 -4.1391264356614163e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 3.2040756562801045e-07 3.2040756562801046e-05
Overall NLP error.......: 3.2040756562801045e-07 3.2040756562801046e-05
Number of objective function evaluations = 42
Number of objective gradient evaluations = 41
Number of equality constraint evaluations = 42
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 41
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 40
Total CPU secs in IPOPT (w/o function evaluations) = 0.030
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 58806.87
Variable costs: 11030.21
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 179.54
Simulating time_step 2020-07-11 06:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.8489875e+04 6.25e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.8578616e+04 6.25e+03 9.90e+01 -1.0 2.60e+04 - 4.43e-04 4.08e-04h 1
2 -3.5692248e+04 6.24e+03 9.98e+01 -1.0 2.15e+04 - 4.73e-04 1.46e-03h 1
3 -2.4852963e+04 6.21e+03 1.00e+02 -1.0 6.06e+03 - 1.13e-03 3.74e-03h 1
4 -5.7790089e+03 6.18e+03 9.99e+01 -1.0 5.30e+03 - 4.98e-03 6.36e-03h 1
5 6.6097059e+04 6.03e+03 9.94e+01 -1.0 2.27e+03 - 1.43e-02 2.37e-02h 1
6 2.9135176e+05 5.57e+03 8.84e+01 -1.0 2.33e+03 - 9.40e-02 7.59e-02h 1
7 6.6900976e+05 4.80e+03 7.61e+01 -1.0 2.57e+03 - 1.82e-01 1.38e-01h 1
8 9.0789715e+05 4.32e+03 6.84e+01 -1.0 3.17e+03 - 3.17e-01 1.01e-01h 1
9 1.9625876e+06 2.11e+03 3.35e+01 -1.0 4.70e+03 - 4.34e-01 5.10e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.0532266e+06 1.88e+03 2.98e+01 -1.0 8.54e+03 - 2.03e-01 1.10e-01h 1
11 2.0881980e+06 1.77e+03 2.89e+01 -1.0 1.08e+04 - 3.23e-01 5.59e-02h 1
12 2.1146580e+06 1.67e+03 2.80e+01 -1.0 1.60e+04 - 1.79e-01 6.10e-02h 1
13 2.1358808e+06 1.52e+03 2.57e+01 -1.0 1.91e+04 - 1.74e-01 8.99e-02h 1
14 2.1362279e+06 1.51e+03 2.57e+01 -1.0 2.47e+04 - 6.19e-02 4.82e-03h 1
15 2.1021096e+06 1.51e+01 8.11e+01 -1.0 2.86e+04 - 4.54e-02 9.90e-01f 1
16 1.9398774e+06 1.37e+01 3.65e+02 -1.0 5.26e+04 - 1.47e-02 9.42e-02f 1
17 1.5686812e+06 1.17e+01 9.15e+02 -1.0 8.54e+04 - 1.49e-02 1.47e-01f 1
18 1.5647419e+06 1.16e+01 6.80e+02 -1.0 7.99e+04 - 2.99e-01 1.62e-03f 1
19 1.4821503e+06 1.12e+01 1.92e+03 -1.0 8.17e+04 - 2.70e-01 3.36e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.4708327e+06 1.12e+01 3.79e+03 -1.0 7.29e+04 - 3.45e-01 6.48e-03f 1
21 9.8085981e+05 8.13e+00 5.84e+03 -1.0 7.37e+04 - 8.24e-01 2.73e-01f 1
22 9.6872789e+05 8.09e+00 8.00e+03 -1.0 6.85e+05 - 2.89e-01 4.31e-03f 1
23 8.5201482e+05 7.76e+00 8.49e+03 -1.0 1.20e+06 - 1.48e-01 4.13e-02f 1
24 8.4798109e+04 5.32e+00 5.11e+03 -1.0 9.91e+05 - 2.26e-01 3.14e-01f 1
25 3.3324746e+04 3.88e+00 1.12e+04 -1.0 6.80e+04 - 9.06e-01 2.70e-01f 1
26 -2.9526091e+04 3.89e-01 2.37e+03 -1.0 6.80e+03 - 9.78e-01 9.00e-01f 1
27 -3.6198694e+04 2.33e-10 6.55e+03 -1.0 4.38e+04 - 9.58e-01 1.00e+00f 1
28 -3.6185609e+04 1.16e-10 1.08e+05 -1.0 2.55e+05 - 1.00e+00 9.89e-01f 1
29 -3.6162071e+04 2.33e-10 1.00e-06 -1.0 2.13e+05 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -3.6518984e+04 1.16e-10 3.87e+06 -5.7 1.45e+05 - 5.93e-01 9.81e-01f 1
31 -3.6592166e+04 1.16e-10 3.12e+06 -5.7 5.41e+05 - 2.30e-01 9.49e-01f 1
32 -3.6604081e+04 1.16e-10 2.95e+05 -5.7 2.20e+05 - 9.05e-01 6.48e-01f 1
33 -3.6609210e+04 1.16e-10 2.61e+04 -5.7 1.48e+05 - 9.08e-01 6.48e-01f 1
34 -3.6610134e+04 2.33e-10 5.62e+02 -5.7 1.52e+04 - 9.84e-01 7.43e-01f 1
35 -3.6610272e+04 1.16e-10 2.28e+01 -5.7 3.48e+03 - 9.92e-01 9.67e-01f 1
36 -3.6610275e+04 1.16e-10 1.85e-11 -5.7 1.37e+02 - 1.00e+00 1.00e+00f 1
37 -3.6610283e+04 5.82e-11 9.13e-13 -7.0 2.64e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 37
(scaled) (unscaled)
Objective...............: -3.6610282714214793e+02 -3.6610282714214794e+04
Dual infeasibility......: 9.1304741545172874e-13 9.1304741545172874e-11
Constraint violation....: 5.8207660913467407e-11 5.8207660913467407e-11
Complementarity.........: 1.2652815313213204e-07 1.2652815313213203e-05
Overall NLP error.......: 1.2652815313213204e-07 1.2652815313213203e-05
Number of objective function evaluations = 38
Number of objective gradient evaluations = 38
Number of equality constraint evaluations = 38
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 38
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 37
Total CPU secs in IPOPT (w/o function evaluations) = 0.025
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 58590.87
Variable costs: 3141.05
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 409.53
Simulating time_step 2020-07-11 07:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.3759293e+04 6.25e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.3848579e+04 6.25e+03 9.90e+01 -1.0 2.60e+04 - 4.43e-04 4.08e-04h 1
2 -3.0722672e+04 6.24e+03 9.98e+01 -1.0 2.16e+04 - 4.73e-04 1.46e-03h 1
3 -7.8165087e+03 6.19e+03 1.01e+02 -1.0 6.54e+03 - 1.11e-03 7.03e-03h 1
4 4.6365203e+04 6.09e+03 1.01e+02 -1.0 2.36e+03 - 9.12e-03 1.61e-02h 1
5 2.7893928e+05 5.67e+03 8.99e+01 -1.0 2.39e+03 - 3.33e-01 6.99e-02h 1
6 7.1721384e+05 4.86e+03 7.70e+01 -1.0 3.58e+03 - 1.02e-01 1.43e-01h 1
7 1.0022839e+06 4.33e+03 6.86e+01 -1.0 3.98e+03 - 5.18e-01 1.08e-01h 1
8 2.1364216e+06 2.12e+03 3.37e+01 -1.0 8.20e+03 - 2.35e-01 5.10e-01h 1
9 2.2634680e+06 1.83e+03 2.90e+01 -1.0 1.04e+04 - 3.76e-01 1.40e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.6601067e+06 4.55e+02 2.81e+01 -1.0 1.56e+04 - 1.72e-01 7.51e-01h 1
11 2.6532195e+06 4.48e+02 2.29e+01 -1.0 2.65e+04 - 1.79e-01 1.61e-02f 1
12 2.1634845e+06 1.73e+02 8.21e+01 -1.0 3.63e+04 - 1.39e-02 6.14e-01f 1
13 1.8972055e+06 1.48e+02 4.44e+02 -1.0 5.34e+04 - 1.24e-02 1.41e-01f 1
14 1.8936178e+06 1.48e+02 4.31e+02 -1.0 8.49e+04 - 7.26e-02 1.55e-03f 1
15 1.6586284e+06 1.31e+02 3.83e+02 -1.0 8.72e+04 - 1.97e-01 1.12e-01f 1
16 1.6556498e+06 1.31e+02 3.82e+02 -1.0 6.57e+04 - 3.39e-01 1.49e-03f 1
17 1.3029278e+06 1.00e+02 2.92e+02 -1.0 6.93e+04 - 3.33e-01 2.35e-01f 1
18 1.2991793e+06 1.00e+02 6.40e+02 -1.0 4.98e+04 - 8.11e-01 3.31e-03f 1
19 1.2298283e+06 9.46e+01 6.09e+02 -1.0 5.13e+05 - 6.10e-02 5.44e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 4.7096747e+05 6.66e+01 2.41e+02 -1.0 1.32e+06 - 1.11e-02 2.96e-01f 1
21 4.5503501e+05 6.58e+01 2.41e+02 -1.0 7.47e+05 - 1.51e-02 1.21e-02f 1
22 4.1219074e+05 6.35e+01 5.13e+02 -1.0 7.07e+05 - 3.32e-01 3.58e-02f 1
23 3.9971318e+05 6.26e+01 5.19e+02 -1.0 3.92e+05 - 2.61e-02 1.32e-02f 1
24 1.3263586e+05 4.52e+01 4.28e+02 -1.0 4.45e+05 - 3.32e-01 2.78e-01f 1
25 2.2654153e+04 4.08e+01 4.38e+02 -1.0 9.70e+05 - 1.33e-01 9.66e-02f 1
26 2.1421953e+04 4.07e+01 1.37e+03 -1.0 2.81e+05 - 6.15e-01 3.35e-03f 1
27 -2.4538393e+03 2.34e+01 1.58e+03 -1.0 5.87e+03 - 9.40e-01 4.25e-01f 1
28 -3.3662567e+04 2.28e-01 4.74e+01 -1.0 9.93e+03 - 9.67e-01 9.90e-01f 1
29 -3.4053330e+04 2.33e-10 6.58e+03 -1.0 1.27e+05 - 9.75e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -3.3972923e+04 1.16e-10 8.68e+05 -1.0 6.76e+05 - 9.11e-01 1.00e+00f 1
31 -3.3968447e+04 1.16e-10 1.00e-06 -1.0 6.07e+04 - 1.00e+00 1.00e+00f 1
32 -3.4344894e+04 2.33e-10 3.44e+06 -5.7 2.50e+05 - 6.45e-01 9.89e-01f 1
33 -3.4392582e+04 1.16e-10 1.67e+06 -5.7 5.35e+05 - 5.21e-01 6.80e-01f 1
34 -3.4414780e+04 1.16e-10 5.47e+05 -5.7 3.71e+05 - 6.72e-01 6.81e-01f 1
35 -3.4420624e+04 1.16e-10 7.63e+04 -5.7 1.64e+05 - 8.57e-01 6.78e-01f 1
36 -3.4421250e+04 1.16e-10 7.54e+03 -5.7 2.07e+04 - 8.91e-01 6.81e-01f 1
37 -3.4421496e+04 1.16e-10 3.37e+02 -5.7 7.80e+03 - 9.58e-01 9.78e-01f 1
38 -3.4421498e+04 1.16e-10 1.85e-11 -5.7 6.32e+01 - 1.00e+00 1.00e+00f 1
39 -3.4421505e+04 2.33e-10 9.24e-13 -7.0 2.46e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 39
(scaled) (unscaled)
Objective...............: -3.4421505405571202e+02 -3.4421505405571203e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 1.2639928832417780e-07 1.2639928832417781e-05
Overall NLP error.......: 1.2639928832417780e-07 1.2639928832417781e-05
Number of objective function evaluations = 40
Number of objective gradient evaluations = 40
Number of equality constraint evaluations = 40
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 40
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 39
Total CPU secs in IPOPT (w/o function evaluations) = 0.024
Total CPU secs in NLP function evaluations = 0.002
EXIT: Optimal Solution Found.
Fixed costs: 51898.87
Variable costs: 702.22
Renewables curtailment reported at t=1 - total= 130.94
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 145.83
Simulating time_step 2020-07-11 08:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.1570516e+04 2.43e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.1659843e+04 2.43e+05 9.90e+01 -1.0 2.60e+04 - 4.43e-04 4.08e-04h 1
2 -2.8786977e+04 2.42e+05 9.98e+01 -1.0 2.15e+04 - 4.74e-04 1.46e-03h 1
3 -1.3845984e+04 2.41e+05 1.01e+02 -1.0 4.00e+03 - 1.13e-03 5.21e-03h 1
4 2.9676041e+04 2.38e+05 1.01e+02 -1.0 2.22e+03 - 7.28e-03 1.47e-02h 1
5 4.8567420e+04 2.36e+05 9.63e+01 -1.0 6.68e+03 - 2.13e-01 6.47e-03h 1
6 5.3484341e+04 2.36e+05 9.61e+01 -1.0 5.04e+04 - 3.20e-02 1.81e-03h 1
7 5.9391118e+04 2.35e+05 9.59e+01 -1.0 2.03e+05 - 1.97e-03 2.05e-03h 1
8 2.3101425e+05 2.22e+05 2.09e+02 -1.0 7.02e+04 - 1.05e-04 5.67e-02h 1
9 4.8985482e+05 2.02e+05 1.69e+02 -1.0 3.29e+04 - 2.34e-01 8.95e-02h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 8.9682538e+05 1.71e+05 1.42e+02 -1.0 2.15e+04 - 1.58e-01 1.53e-01h 1
11 1.5894212e+06 1.19e+05 1.02e+02 -1.0 1.81e+04 - 2.68e-01 3.07e-01h 1
12 2.1433493e+06 7.49e+04 8.75e+01 -1.0 1.23e+04 - 4.49e-02 3.69e-01h 1
13 2.2314993e+06 6.75e+04 6.29e+01 -1.0 7.60e+03 - 3.35e-01 9.76e-02h 1
14 2.9599547e+06 6.75e+02 7.43e+01 -1.0 9.87e+03 - 2.50e-01 9.90e-01h 1
15 2.6810569e+06 6.51e+00 2.22e+03 -1.0 1.14e+04 - 3.72e-01 9.90e-01f 1
16 2.1149249e+06 1.63e+00 2.21e+05 -1.0 3.04e+04 - 1.37e-01 7.50e-01f 1
17 2.1040886e+06 1.61e+00 2.10e+05 -1.0 5.09e+04 - 1.41e-02 6.89e-03f 1
18 2.1032310e+06 1.61e+00 2.06e+05 -1.0 7.48e+04 - 3.34e-03 4.35e-04f 1
19 1.7323752e+06 1.33e+00 1.84e+05 -1.0 9.18e+04 - 1.66e-01 1.77e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.7275640e+06 1.33e+00 8.58e+04 -1.0 7.50e+04 - 1.82e-01 2.17e-03f 1
21 1.6836218e+06 1.29e+00 4.17e+05 -1.0 7.24e+04 - 2.55e-01 2.75e-02f 1
22 1.1767416e+06 8.99e-01 2.89e+05 -1.0 7.48e+04 - 3.02e-01 3.03e-01f 1
23 1.1712714e+06 8.95e-01 1.80e+06 -1.0 5.22e+04 - 8.28e-01 4.43e-03f 1
24 1.0995470e+06 8.71e-01 1.85e+06 -1.0 1.04e+06 - 9.38e-02 2.67e-02f 1
25 7.0201797e+05 7.88e-01 1.61e+06 -1.0 1.35e+06 - 5.23e-02 9.52e-02f 1
26 6.9783997e+05 7.87e-01 1.90e+06 -1.0 1.22e+06 - 1.77e-01 1.04e-03f 1
27 4.2731890e+05 7.02e-01 1.80e+06 -1.0 1.08e+06 - 1.76e-01 1.07e-01f 1
28 2.7851218e+04 5.04e-01 1.53e+06 -1.0 6.11e+05 - 4.30e-01 2.83e-01f 1
29 -1.4234071e+03 2.74e-01 1.72e+06 -1.0 6.39e+03 - 9.39e-01 4.56e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -3.0146776e+04 2.13e-03 1.04e+04 -1.0 4.60e+03 - 9.79e-01 9.92e-01f 1
31 -3.0341318e+04 1.16e-10 1.50e+05 -1.0 8.33e+04 - 9.28e-01 1.00e+00f 1
32 -3.0279410e+04 2.33e-10 9.61e+04 -1.0 6.21e+05 - 4.29e-01 1.00e+00f 1
33 -3.0257906e+04 2.33e-10 1.00e-06 -1.0 2.02e+05 - 1.00e+00 1.00e+00f 1
34 -3.0637803e+04 1.16e-10 3.45e+06 -5.7 2.88e+05 - 6.45e-01 9.90e-01f 1
35 -3.0685503e+04 1.16e-10 7.51e+05 -5.7 4.70e+05 - 7.81e-01 7.29e-01f 1
36 -3.0704402e+04 1.16e-10 2.50e+05 -5.7 3.62e+05 - 6.66e-01 6.40e-01f 1
37 -3.0708955e+04 1.16e-10 6.59e+04 -5.7 9.82e+04 - 7.33e-01 6.36e-01f 1
38 -3.0710134e+04 1.16e-10 8.53e+02 -5.7 3.23e+04 - 9.92e-01 6.86e-01f 1
39 -3.0710565e+04 1.16e-10 3.79e+01 -5.7 8.56e+03 - 1.00e+00 9.80e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -3.0710570e+04 1.16e-10 1.85e-11 -5.7 1.52e+02 - 1.00e+00 1.00e+00f 1
41 -3.0710578e+04 1.16e-10 9.24e-13 -7.0 2.37e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 41
(scaled) (unscaled)
Objective...............: -3.0710577572164658e+02 -3.0710577572164657e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2649154779684060e-07 1.2649154779684060e-05
Overall NLP error.......: 1.2649154779684060e-07 1.2649154779684060e-05
Number of objective function evaluations = 42
Number of objective gradient evaluations = 42
Number of equality constraint evaluations = 42
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 42
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 41
Total CPU secs in IPOPT (w/o function evaluations) = 0.030
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 51898.87
Variable costs: 791.62
Renewables curtailment reported at t=1 - total= 81.67
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 5.00
Simulating time_step 2020-07-11 09:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.7909988e+04 2.15e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.7999350e+04 2.15e+05 9.90e+01 -1.0 2.60e+04 - 4.43e-04 4.08e-04h 1
2 -2.5553564e+04 2.15e+05 9.98e+01 -1.0 2.15e+04 - 4.87e-04 1.46e-03h 1
3 -1.7032330e+04 2.14e+05 1.00e+02 -1.0 5.46e+03 - 1.13e-03 3.33e-03h 1
4 6.9546874e+03 2.12e+05 1.01e+02 -1.0 2.22e+03 - 3.90e-03 8.98e-03h 1
5 4.9559546e+04 2.09e+05 9.89e+01 -1.0 3.90e+03 - 1.63e-02 1.58e-02h 1
6 5.6346938e+04 2.08e+05 9.90e+01 -1.0 5.28e+04 - 7.21e-04 2.42e-03h 1
7 3.5624824e+05 1.86e+05 8.57e+01 -1.0 4.84e+04 - 1.80e-01 1.06e-01h 1
8 3.8088815e+05 1.84e+05 9.07e+01 -1.0 1.92e+04 - 2.74e-02 9.67e-03h 1
9 6.4586724e+05 1.65e+05 8.50e+01 -1.0 1.88e+04 - 1.38e-03 1.04e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 7.9043136e+05 1.55e+05 7.12e+01 -1.0 1.69e+04 - 2.04e-01 6.29e-02h 1
11 2.2790810e+06 4.73e+04 6.47e+01 -1.0 1.57e+04 - 3.11e-01 6.94e-01h 1
12 2.3396297e+06 4.24e+04 3.88e+01 -1.0 5.42e+03 - 3.53e-01 1.03e-01h 1
13 2.8048634e+06 4.24e+02 6.72e+01 -1.0 8.26e+03 - 3.26e-01 9.90e-01h 1
14 2.6260257e+06 4.02e+00 3.25e+03 -1.0 1.11e+04 - 3.51e-01 9.91e-01f 1
15 2.3040174e+06 1.16e-10 3.95e+05 -1.0 1.25e+04 - 2.22e-01 1.00e+00f 1
16 1.4026840e+06 1.16e-10 8.37e+06 -1.0 4.45e+04 - 3.21e-02 8.73e-01f 1
17 1.3867434e+06 1.16e-10 8.11e+06 -1.0 8.24e+04 - 2.80e-02 9.12e-03f 1
18 1.3862681e+06 1.75e-10 6.33e+06 -1.0 8.87e+04 - 1.92e-01 3.39e-04f 1
19 1.3334309e+06 1.16e-10 6.07e+06 -1.0 9.31e+04 - 4.15e-02 5.16e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.2379898e+06 1.16e-10 3.03e+06 -1.0 8.99e+04 - 4.38e-01 9.65e-02f 1
21 1.2368871e+06 2.33e-10 1.36e+06 -1.0 4.20e+04 - 4.12e-01 2.07e-03f 1
22 1.0823928e+06 2.33e-10 5.56e+05 -1.0 3.52e+04 - 7.66e-01 1.00e+00f 1
23 4.9320073e+05 1.16e-10 5.13e+05 -1.0 9.92e+05 - 7.82e-02 2.73e-01f 1
24 4.7964543e+05 1.75e-10 3.66e+05 -1.0 9.72e+05 - 2.86e-01 6.62e-03f 1
25 3.6953144e+05 1.16e-10 2.30e+05 -1.0 7.39e+05 - 3.71e-01 8.42e-02f 1
26 3.6823164e+05 1.16e-10 1.01e+05 -1.0 3.49e+05 - 5.59e-01 2.24e-03f 1
27 2.0854925e+05 2.33e-10 7.44e+04 -1.0 5.38e+05 - 2.67e-01 2.66e-01f 1
28 2.0581525e+05 2.33e-10 5.86e+04 -1.0 1.07e+06 - 2.12e-01 2.31e-03f 1
29 1.2804270e+05 1.16e-10 4.94e+04 -1.0 1.17e+06 - 1.57e-01 6.01e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 1.2623571e+05 1.16e-10 2.69e+04 -1.0 4.77e+05 - 4.56e-01 3.40e-03f 1
31 -6.0271813e+03 2.33e-10 1.40e+04 -1.0 2.14e+05 - 4.78e-01 5.48e-01f 1
32 -2.4576876e+04 1.16e-10 7.48e+03 -1.0 2.13e+04 - 4.67e-01 7.43e-01f 1
33 -2.8295785e+04 2.33e-10 2.58e+03 -1.0 4.15e+03 - 6.54e-01 9.39e-01f 1
34 -2.8335982e+04 1.16e-10 1.61e+03 -1.0 7.77e+03 - 5.91e-01 1.00e+00f 1
35 -2.8661767e+04 1.16e-10 9.38e+05 -1.7 3.47e+03 - 8.83e-01 1.00e+00f 1
36 -2.8660013e+04 2.33e-10 3.42e+05 -1.7 2.33e+04 - 6.36e-01 1.00e+00f 1
37 -2.8656100e+04 1.16e-10 8.32e+04 -1.7 4.06e+04 - 7.56e-01 1.00e+00f 1
38 -2.8646577e+04 1.16e-10 1.84e+03 -1.7 9.36e+04 - 9.78e-01 1.00e+00f 1
39 -2.8632531e+04 2.33e-10 2.00e-07 -1.7 1.23e+05 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -2.8733641e+04 1.16e-10 1.79e+05 -5.7 3.11e+05 - 7.97e-01 8.86e-01f 1
41 -2.8744172e+04 1.16e-10 3.08e+03 -5.7 1.09e+05 - 8.43e-01 7.06e-01f 1
42 -2.8748011e+04 2.33e-10 1.04e+04 -5.7 3.95e+04 - 8.00e-01 9.64e-01f 1
43 -2.8748189e+04 1.16e-10 1.47e+03 -5.7 4.65e+03 - 8.69e-01 9.15e-01f 1
44 -2.8748204e+04 2.33e-10 1.85e-11 -5.7 3.94e+02 - 1.00e+00 1.00e+00f 1
45 -2.8748213e+04 1.16e-10 9.38e-13 -7.0 3.48e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 45
(scaled) (unscaled)
Objective...............: -2.8748212861974577e+02 -2.8748212861974574e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 3.2337589396370780e-12 1.1641532182693481e-10
Complementarity.........: 3.2482927499609528e-07 3.2482927499609530e-05
Overall NLP error.......: 3.2482927499609528e-07 3.2482927499609530e-05
Number of objective function evaluations = 46
Number of objective gradient evaluations = 46
Number of equality constraint evaluations = 46
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 46
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 45
Total CPU secs in IPOPT (w/o function evaluations) = 0.035
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 51898.87
Variable costs: 847.01
Renewables curtailment reported at t=1 - total= 58.65
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 3.00
Simulating time_step 2020-07-11 10:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.5998298e+04 2.15e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.6087314e+04 2.15e+05 9.90e+01 -1.0 2.60e+04 - 4.43e-04 4.08e-04h 1
2 -2.3169588e+04 2.15e+05 9.98e+01 -1.0 2.15e+04 - 4.82e-04 1.46e-03h 1
3 -1.3316393e+04 2.14e+05 1.00e+02 -1.0 5.47e+03 - 1.13e-03 3.31e-03h 1
4 2.9743824e+04 2.11e+05 1.01e+02 -1.0 2.35e+03 - 3.89e-03 1.40e-02h 1
5 7.1897968e+04 2.08e+05 9.84e+01 -1.0 5.49e+03 - 2.20e-02 1.37e-02h 1
6 8.3343248e+04 2.07e+05 1.51e+02 -1.0 5.31e+04 - 1.96e-01 3.96e-03h 1
7 4.1972614e+05 1.83e+05 1.14e+02 -1.0 3.24e+04 - 4.38e-02 1.18e-01h 1
8 6.6037604e+05 1.65e+05 1.25e+02 -1.0 1.86e+04 - 3.06e-01 9.56e-02h 1
9 1.1556676e+06 1.29e+05 7.08e+01 -1.0 1.80e+04 - 4.05e-01 2.22e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.6589351e+06 8.92e+04 5.51e+01 -1.0 1.51e+04 - 2.65e-01 3.07e-01h 1
11 2.0103379e+06 5.89e+04 3.74e+01 -1.0 1.51e+04 - 3.31e-01 3.40e-01h 1
12 2.5084808e+06 5.88e+02 6.52e+01 -1.0 2.55e+04 - 2.57e-01 9.90e-01h 1
13 2.0308205e+06 5.67e+00 3.44e+03 -1.0 3.66e+04 - 4.97e-02 9.90e-01f 1
14 1.2185569e+06 1.16e-10 3.12e+05 -1.0 3.71e+04 - 1.48e-01 1.00e+00f 1
15 9.6159901e+05 1.16e-10 1.73e+06 -1.0 5.06e+04 - 1.33e-02 1.61e-01f 1
16 9.5701257e+05 1.75e-10 2.25e+06 -1.0 4.19e+04 - 4.09e-01 3.65e-03f 1
17 9.4537070e+05 2.33e-10 2.22e+06 -1.0 6.55e+04 - 7.10e-03 9.25e-03f 1
18 9.4000981e+05 2.33e-10 2.19e+06 -1.0 5.36e+04 - 6.68e-04 4.17e-03f 1
19 8.9686917e+05 2.62e-10 4.40e+06 -1.0 5.90e+04 - 4.29e-01 3.26e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 8.9035237e+05 2.62e-10 4.48e+06 -1.0 7.07e+04 - 4.03e-02 6.82e-03f 1
21 8.1784404e+05 2.91e-10 6.16e+06 -1.0 7.33e+04 - 7.15e-01 7.55e-02f 1
22 8.0655799e+05 2.91e-10 6.44e+06 -1.0 2.98e+05 - 3.90e-01 9.34e-03f 1
23 4.5377263e+05 2.33e-10 4.95e+06 -1.0 5.19e+05 - 6.42e-03 2.13e-01f 1
24 4.5209585e+05 2.33e-10 4.95e+06 -1.0 5.76e+05 - 2.65e-03 9.43e-04f 1
25 2.0226212e+05 1.16e-10 3.97e+06 -1.0 4.41e+05 - 5.59e-01 2.34e-01f 1
26 1.8564624e+05 2.33e-10 4.00e+06 -1.0 1.90e+05 - 7.55e-01 3.68e-02f 1
27 -9.7204619e+03 1.16e-10 7.98e+05 -1.0 9.04e+04 - 1.22e-01 7.90e-01f 1
28 -2.0754781e+04 2.33e-10 1.93e+05 -1.0 5.08e+03 - 7.32e-01 7.57e-01f 1
29 -2.3378418e+04 2.33e-10 6.44e+03 -1.0 7.07e+03 - 3.62e-01 9.89e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -2.3346055e+04 2.33e-10 5.15e+03 -1.0 8.01e+03 - 4.21e-01 1.00e+00f 1
31 -2.3345194e+04 1.16e-10 8.90e+02 -1.0 1.04e+04 - 8.25e-01 1.00e+00f 1
32 -2.3724549e+04 1.16e-10 1.24e+06 -1.7 4.93e+03 - 8.46e-01 1.00e+00f 1
33 -2.3722663e+04 1.16e-10 5.33e+05 -1.7 3.19e+04 - 5.69e-01 1.00e+00f 1
34 -2.3719256e+04 1.16e-10 1.38e+05 -1.7 4.91e+04 - 7.41e-01 1.00e+00f 1
35 -2.3714893e+04 1.16e-10 2.87e+04 -1.7 1.58e+05 - 7.92e-01 1.00e+00f 1
36 -2.3707415e+04 1.16e-10 2.00e-07 -1.7 8.76e+04 - 1.00e+00 1.00e+00f 1
37 -2.3821452e+04 1.16e-10 1.09e+05 -5.7 3.27e+05 - 8.17e-01 8.71e-01f 1
38 -2.3834172e+04 1.16e-10 4.28e+04 -5.7 1.08e+05 - 8.75e-01 6.55e-01f 1
39 -2.3840263e+04 1.16e-10 1.13e+04 -5.7 5.63e+04 - 6.75e-01 9.60e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -2.3840445e+04 2.33e-10 1.62e+03 -5.7 5.08e+03 - 9.88e-01 5.74e-01f 1
41 -2.3840569e+04 1.16e-10 8.24e+01 -5.7 2.16e+03 - 9.49e-01 1.00e+00f 1
42 -2.3840568e+04 1.16e-10 1.85e-11 -5.7 1.85e-01 - 1.00e+00 1.00e+00h 1
43 -2.3840579e+04 1.16e-10 9.24e-13 -7.0 4.84e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 43
(scaled) (unscaled)
Objective...............: -2.3840579067741936e+02 -2.3840579067741935e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2625363851870778e-07 1.2625363851870778e-05
Overall NLP error.......: 1.2625363851870778e-07 1.2625363851870778e-05
Number of objective function evaluations = 44
Number of objective gradient evaluations = 44
Number of equality constraint evaluations = 44
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 44
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 43
Total CPU secs in IPOPT (w/o function evaluations) = 0.028
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 57378.87
Variable costs: 5870.66
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 284.14
Simulating time_step 2020-07-11 11:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.1141349e+04 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.1229458e+04 1.64e+05 9.90e+01 -1.0 2.67e+04 - 4.43e-04 4.08e-04h 1
2 -1.8801636e+04 1.64e+05 9.98e+01 -1.0 2.26e+04 - 4.87e-04 1.46e-03h 1
3 -1.0338636e+04 1.63e+05 1.00e+02 -1.0 5.58e+03 - 1.13e-03 3.33e-03h 1
4 2.6863668e+04 1.61e+05 1.01e+02 -1.0 3.56e+03 - 3.90e-03 1.40e-02h 1
5 2.2354859e+05 1.49e+05 1.04e+02 -1.0 3.26e+03 - 2.21e-02 7.35e-02h 1
6 3.4257551e+05 1.42e+05 8.57e+01 -1.0 2.71e+03 - 1.26e-01 4.83e-02h 1
7 6.4079222e+05 1.24e+05 7.48e+01 -1.0 2.82e+03 - 3.06e-01 1.27e-01h 1
8 1.1629082e+06 9.17e+04 5.54e+01 -1.0 4.04e+03 - 3.54e-01 2.59e-01h 1
9 1.6077410e+06 6.27e+04 3.79e+01 -1.0 6.19e+03 - 3.79e-01 3.16e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.9738144e+06 3.47e+04 3.88e+01 -1.0 9.74e+03 - 2.95e-01 4.47e-01h 1
11 2.1480951e+06 9.64e+03 3.12e+01 -1.0 1.30e+04 - 3.11e-01 7.22e-01h 1
12 2.1463605e+06 9.60e+03 2.56e+01 -1.0 1.57e+04 - 1.78e-01 4.98e-03f 1
13 1.6420981e+06 9.58e+01 1.64e+02 -1.0 1.94e+04 - 3.09e-02 9.90e-01f 1
14 1.5743628e+06 9.17e+01 6.48e+02 -1.0 5.46e+04 - 1.42e-02 4.30e-02f 1
15 1.3995226e+06 8.42e+01 1.51e+03 -1.0 8.74e+04 - 2.98e-02 8.12e-02f 1
16 1.3932154e+06 8.39e+01 4.89e+03 -1.0 5.55e+04 - 3.34e-01 4.30e-03f 1
17 9.0032587e+05 5.93e+01 3.36e+03 -1.0 7.13e+04 - 2.88e-01 2.93e-01f 1
18 8.9492575e+05 5.91e+01 2.71e+04 -1.0 5.19e+04 - 8.69e-01 4.07e-03f 1
19 8.5161504e+05 5.76e+01 2.80e+04 -1.0 5.62e+05 - 8.02e-02 2.52e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 5.4602662e+05 4.79e+01 1.86e+04 -1.0 6.06e+05 - 8.86e-04 1.68e-01f 1
21 5.4466009e+05 4.79e+01 2.46e+04 -1.0 7.62e+05 - 1.79e-01 6.19e-04f 1
22 8.7065541e+04 3.04e+01 1.61e+04 -1.0 5.44e+05 - 3.77e-01 3.64e-01f 1
23 3.8750865e+04 2.04e+01 3.05e+04 -1.0 5.76e+04 - 7.00e-01 3.30e-01f 1
24 -8.3477681e+03 4.03e+00 3.39e+04 -1.0 7.76e+03 - 2.96e-01 8.02e-01f 1
25 -1.6535136e+04 7.14e-01 3.65e+04 -1.0 3.02e+03 - 7.44e-01 8.23e-01f 1
26 -1.8308104e+04 1.16e-10 1.18e+06 -1.0 6.62e+03 - 3.39e-01 1.00e+00f 1
27 -1.8313087e+04 1.16e-10 2.70e+06 -1.0 7.32e+03 - 6.99e-01 1.00e+00f 1
28 -1.8307296e+04 1.16e-10 1.46e+06 -1.0 1.50e+04 - 4.60e-01 1.00e+00f 1
29 -1.8303934e+04 2.33e-10 3.22e+05 -1.0 2.01e+04 - 7.80e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -1.8294790e+04 1.16e-10 1.71e+05 -1.0 6.70e+04 - 4.68e-01 1.00e+00f 1
31 -1.8283814e+04 1.16e-10 4.57e+04 -1.0 8.97e+04 - 7.32e-01 1.00e+00f 1
32 -1.8254341e+04 1.16e-10 1.21e+04 -1.0 3.08e+05 - 7.35e-01 1.00e+00f 1
33 -1.8219656e+04 1.75e-10 1.02e+03 -1.0 2.72e+05 - 9.16e-01 1.00e+00f 1
34 -1.8689937e+04 1.16e-10 1.38e+05 -1.7 2.02e+05 - 9.83e-01 1.00e+00f 1
35 -1.8727417e+04 1.16e-10 2.00e-07 -1.7 3.09e+05 - 1.00e+00 1.00e+00f 1
36 -1.8849685e+04 1.16e-10 1.42e+05 -5.7 3.16e+05 - 7.69e-01 8.40e-01f 1
37 -1.8865190e+04 1.16e-10 1.27e+04 -5.7 9.79e+04 - 7.56e-01 6.08e-01f 1
38 -1.8871586e+04 1.16e-10 5.83e+03 -5.7 6.05e+04 - 5.68e-01 6.58e-01f 1
39 -1.8874949e+04 1.16e-10 3.63e+03 -5.7 4.01e+04 - 9.73e-01 8.85e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -1.8875224e+04 2.33e-10 1.64e+03 -5.7 4.65e+03 - 1.00e+00 6.68e-01f 1
41 -1.8875339e+04 1.16e-10 1.67e+02 -5.7 1.54e+03 - 9.13e-01 1.00e+00f 1
42 -1.8875337e+04 1.16e-10 1.85e-11 -5.7 9.99e-02 - 1.00e+00 1.00e+00f 1
43 -1.8875349e+04 1.16e-10 9.24e-13 -7.0 5.66e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 43
(scaled) (unscaled)
Objective...............: -1.8875349217192968e+02 -1.8875349217192968e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2579202915975551e-07 1.2579202915975551e-05
Overall NLP error.......: 1.2579202915975551e-07 1.2579202915975551e-05
Number of objective function evaluations = 44
Number of objective gradient evaluations = 44
Number of equality constraint evaluations = 44
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 44
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 43
Total CPU secs in IPOPT (w/o function evaluations) = 0.032
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 56954.87
Variable costs: 8476.51
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 229.17
Simulating time_step 2020-07-11 12:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -1.6226805e+04 2.91e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.6315602e+04 2.91e+05 9.90e+01 -1.0 2.60e+04 - 4.43e-04 4.08e-04h 1
2 -1.4219584e+04 2.91e+05 9.99e+01 -1.0 2.15e+04 - 4.65e-04 1.46e-03h 1
3 -7.4280964e+03 2.90e+05 1.00e+02 -1.0 5.50e+03 - 1.13e-03 3.28e-03h 1
4 2.2583138e+04 2.86e+05 1.01e+02 -1.0 4.51e+03 - 3.86e-03 1.38e-02h 1
5 3.2068510e+04 2.84e+05 9.76e+01 -1.0 2.24e+04 - 2.16e-02 4.30e-03h 1
6 3.8239555e+04 2.84e+05 3.24e+02 -1.0 2.05e+05 - 1.20e-01 2.90e-03h 1
7 4.1250763e+05 2.28e+05 2.83e+02 -1.0 2.95e+04 - 3.23e-02 1.97e-01h 1
8 4.9653321e+05 2.15e+05 2.26e+02 -1.0 2.47e+04 - 2.16e-01 5.50e-02h 1
9 8.6496740e+05 1.60e+05 1.79e+02 -1.0 2.37e+04 - 2.07e-01 2.58e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.8815424e+06 1.60e+03 1.32e+02 -1.0 1.79e+04 - 3.65e-01 9.90e-01h 1
11 1.8708447e+06 1.46e+03 3.02e+02 -1.0 1.31e+04 - 2.56e-01 8.43e-02f 1
12 1.7549325e+06 3.60e+02 6.70e+02 -1.0 9.79e+03 - 3.80e-01 7.54e-01f 1
13 1.5179347e+06 3.31e+00 6.38e+03 -1.0 1.56e+04 - 2.02e-01 9.91e-01f 1
14 1.2370469e+06 1.93e-01 5.96e+05 -1.0 1.92e+04 - 2.05e-01 9.42e-01f 1
15 7.2736653e+05 3.17e-02 4.74e+06 -1.0 4.30e+04 - 5.11e-02 8.35e-01f 1
16 7.1574200e+05 3.15e-02 4.61e+06 -1.0 7.99e+04 - 1.89e-02 8.66e-03f 1
17 7.1541042e+05 3.15e-02 2.25e+06 -1.0 8.73e+04 - 2.80e-01 2.94e-04f 1
18 6.3168997e+05 2.89e-02 2.56e+06 -1.0 8.08e+04 - 4.15e-03 8.26e-02f 1
19 6.2005782e+05 2.84e-02 2.55e+06 -1.0 6.21e+04 - 1.02e-02 1.44e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 4.9253233e+05 2.37e-02 5.86e+05 -1.0 6.16e+04 - 5.98e-01 1.68e-01f 1
21 4.9085602e+05 2.36e-02 1.23e+06 -1.0 8.18e+04 - 2.24e-01 2.30e-03f 1
22 2.7930961e+05 9.05e-03 7.12e+05 -1.0 1.04e+05 - 7.20e-01 6.16e-01f 1
23 2.7665207e+05 9.03e-03 8.12e+05 -1.0 4.39e+05 - 1.30e-01 3.12e-03f 1
24 7.2418372e+03 5.23e-03 5.57e+05 -1.0 4.54e+05 - 5.44e-01 4.21e-01f 1
25 -1.9132739e+03 3.30e-03 4.54e+05 -1.0 5.66e+03 - 6.74e-01 3.69e-01f 1
26 -1.1557611e+04 5.17e-04 9.45e+03 -1.0 1.27e+03 - 3.05e-01 8.43e-01f 1
27 -1.2301575e+04 2.91e-04 7.32e+03 -1.0 1.73e+03 - 2.82e-01 4.38e-01f 1
28 -1.3383937e+04 5.82e-11 3.39e+04 -1.0 2.29e+03 - 4.18e-01 1.00e+00f 1
29 -1.3366002e+04 1.16e-10 1.18e+04 -1.0 3.50e+03 - 6.51e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -1.3359997e+04 1.16e-10 4.44e+03 -1.0 7.87e+03 - 6.25e-01 1.00e+00f 1
31 -1.3356603e+04 1.16e-10 1.26e+03 -1.0 1.47e+04 - 7.16e-01 1.00e+00f 1
32 -1.3839506e+04 1.16e-10 1.73e+06 -1.7 8.01e+03 - 7.83e-01 1.00e+00f 1
33 -1.3837670e+04 2.33e-10 2.40e+05 -1.7 3.21e+04 - 8.61e-01 1.00e+00f 1
34 -1.3832972e+04 1.16e-10 1.41e+05 -1.7 2.07e+05 - 4.12e-01 1.00e+00f 1
35 -1.3823275e+04 1.16e-10 2.00e-07 -1.7 1.09e+05 - 1.00e+00 1.00e+00f 1
36 -1.3956693e+04 2.33e-10 1.46e+05 -5.7 2.93e+05 - 7.90e-01 8.63e-01f 1
37 -1.3968325e+04 1.16e-10 2.29e+04 -5.7 9.03e+04 - 7.26e-01 4.96e-01f 1
38 -1.3977271e+04 1.16e-10 1.72e+04 -5.7 6.72e+04 - 5.21e-01 7.25e-01f 1
39 -1.3980676e+04 1.16e-10 9.42e+01 -5.7 2.98e+04 - 9.60e-01 9.39e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -1.3980843e+04 5.82e-11 2.49e+02 -5.7 1.87e+03 - 8.72e-01 9.29e-01f 1
41 -1.3980848e+04 1.16e-10 1.85e-11 -5.7 1.32e+02 - 1.00e+00 1.00e+00f 1
42 -1.3980862e+04 1.16e-10 9.24e-13 -7.0 6.24e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 42
(scaled) (unscaled)
Objective...............: -1.3980861515394159e+02 -1.3980861515394159e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 3.2386309747235142e-07 3.2386309747235142e-05
Overall NLP error.......: 3.2386309747235142e-07 3.2386309747235142e-05
Number of objective function evaluations = 43
Number of objective gradient evaluations = 43
Number of equality constraint evaluations = 43
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 43
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 42
Total CPU secs in IPOPT (w/o function evaluations) = 0.039
Total CPU secs in NLP function evaluations = 0.003
EXIT: Optimal Solution Found.
Fixed costs: 59754.87
Variable costs: 13407.67
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 249.60
Simulating time_step 2020-07-11 13:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -1.1381705e+04 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.1469106e+04 1.64e+05 9.90e+01 -1.0 2.60e+04 - 4.43e-04 4.08e-04h 1
2 -1.0104721e+04 1.64e+05 9.98e+01 -1.0 2.15e+04 - 4.87e-04 1.46e-03h 1
3 -4.8330422e+03 1.63e+05 1.00e+02 -1.0 5.46e+03 - 1.13e-03 3.33e-03h 1
4 1.2140140e+04 1.61e+05 1.01e+02 -1.0 2.22e+03 - 3.90e-03 1.00e-02h 1
5 7.0948377e+04 1.56e+05 1.01e+02 -1.0 2.24e+03 - 1.75e-02 3.39e-02h 1
6 1.9570416e+05 1.44e+05 9.14e+01 -1.0 2.29e+03 - 8.32e-02 7.42e-02h 1
7 4.0532870e+05 1.25e+05 7.54e+01 -1.0 2.52e+03 - 2.40e-01 1.36e-01h 1
8 6.0157587e+05 1.06e+05 6.43e+01 -1.0 3.53e+03 - 3.05e-01 1.47e-01h 1
9 1.6941179e+06 1.06e+03 4.59e+01 -1.0 4.93e+03 - 5.03e-01 9.90e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.5711035e+06 1.71e+02 7.87e+02 -1.0 9.55e+03 - 3.29e-01 8.39e-01f 1
11 1.3624472e+06 1.55e+00 7.30e+03 -1.0 1.28e+04 - 2.28e-01 9.91e-01f 1
12 1.0971861e+06 1.16e-10 7.53e+05 -1.0 1.63e+04 - 2.13e-01 1.00e+00f 1
13 6.0578291e+05 1.16e-10 8.13e+06 -1.0 4.17e+04 - 5.25e-02 8.73e-01f 1
14 5.9442663e+05 1.75e-10 7.97e+06 -1.0 7.81e+04 - 1.85e-02 8.82e-03f 1
15 5.9411012e+05 2.33e-10 4.22e+06 -1.0 8.74e+04 - 4.12e-01 2.88e-04f 1
16 5.1451742e+05 2.33e-10 4.16e+06 -1.0 7.87e+04 - 2.91e-02 8.60e-02f 1
17 5.0957380e+05 2.33e-10 3.34e+05 -1.0 4.25e+04 - 8.69e-01 2.39e-02f 1
18 2.4706025e+05 2.33e-10 2.48e+05 -1.0 3.65e+05 - 2.95e-01 2.83e-01f 1
19 2.4439935e+05 2.33e-10 2.48e+05 -1.0 3.83e+05 - 5.36e-03 3.17e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 2.5743813e+04 2.33e-10 2.64e+05 -1.0 3.80e+05 - 5.90e-01 3.67e-01f 1
21 9.4100599e+03 5.82e-11 1.89e+05 -1.0 3.69e+03 - 6.77e-01 4.51e-01f 1
22 -5.8332890e+03 1.16e-10 4.84e+03 -1.0 1.37e+03 - 3.63e-01 8.60e-01f 1
23 -6.5984230e+03 1.16e-10 4.80e+03 -1.0 1.08e+03 - 2.82e-01 3.19e-01f 1
24 -8.3547087e+03 1.16e-10 1.82e+04 -1.0 2.23e+03 - 3.71e-01 1.00e+00f 1
25 -8.3321262e+03 2.33e-10 8.62e+03 -1.0 2.17e+03 - 5.25e-01 1.00e+00f 1
26 -8.3288268e+03 1.16e-10 5.37e+02 -1.0 4.54e+03 - 9.38e-01 1.00e+00f 1
27 -8.8655167e+03 1.16e-10 3.31e+06 -1.7 1.29e+04 - 5.86e-01 1.00e+00f 1
28 -8.8630222e+03 1.16e-10 1.07e+06 -1.7 2.76e+04 - 6.76e-01 1.00e+00f 1
29 -8.8583720e+03 1.16e-10 4.78e+05 -1.7 6.43e+04 - 5.54e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -8.8516914e+03 2.33e-10 5.84e+04 -1.7 7.96e+04 - 8.78e-01 1.00e+00f 1
31 -8.8349803e+03 2.33e-10 1.24e+04 -1.7 2.10e+05 - 7.88e-01 1.00e+00f 1
32 -8.8317856e+03 2.33e-10 2.00e-07 -1.7 3.07e+04 - 1.00e+00 1.00e+00f 1
33 -8.9772464e+03 5.82e-11 1.52e+05 -5.7 3.58e+05 - 7.25e-01 8.01e-01f 1
34 -8.9984290e+03 1.16e-10 5.83e+04 -5.7 1.21e+05 - 7.63e-01 5.26e-01f 1
35 -9.0105485e+03 1.16e-10 1.21e+04 -5.7 8.52e+04 - 5.63e-01 6.34e-01f 1
36 -9.0167505e+03 1.16e-10 9.95e+03 -5.7 5.44e+04 - 9.71e-01 8.32e-01f 1
37 -9.0177646e+03 1.16e-10 2.04e+03 -5.7 9.22e+03 - 1.00e+00 8.25e-01f 1
38 -9.0179353e+03 1.16e-10 3.15e+02 -5.7 1.61e+03 - 8.85e-01 9.87e-01f 1
39 -9.0179309e+03 1.16e-10 1.85e-11 -5.7 2.10e+01 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -9.0179460e+03 1.16e-10 9.38e-13 -7.0 6.71e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 40
(scaled) (unscaled)
Objective...............: -9.0179459914081477e+01 -9.0179459914081472e+03
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 3.1540423243057663e-07 3.1540423243057659e-05
Overall NLP error.......: 3.1540423243057663e-07 3.1540423243057659e-05
Number of objective function evaluations = 41
Number of objective gradient evaluations = 41
Number of equality constraint evaluations = 41
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 41
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 40
Total CPU secs in IPOPT (w/o function evaluations) = 0.029
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 60294.87
Variable costs: 18957.18
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 258.69
Simulating time_step 2020-07-11 14:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -6.4694765e+03 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -6.5561954e+03 1.64e+05 9.90e+01 -1.0 2.60e+04 - 4.43e-04 4.08e-04h 1
2 -5.5323424e+03 1.64e+05 9.98e+01 -1.0 2.15e+04 - 4.87e-04 1.46e-03h 1
3 -1.8199785e+03 1.63e+05 1.00e+02 -1.0 5.46e+03 - 1.13e-03 3.33e-03h 1
4 6.0568105e+03 1.62e+05 1.00e+02 -1.0 5.20e+03 - 3.90e-03 6.44e-03h 1
5 3.4295406e+04 1.58e+05 1.00e+02 -1.0 4.58e+03 - 1.03e-02 2.22e-02h 1
6 1.1864383e+05 1.48e+05 9.24e+01 -1.0 2.98e+03 - 7.23e-02 6.57e-02h 1
7 3.0942415e+05 1.24e+05 8.60e+01 -1.0 2.65e+03 - 1.14e-01 1.60e-01h 1
8 7.9828692e+05 6.24e+04 6.77e+01 -1.0 2.95e+03 - 3.45e-01 4.98e-01h 1
9 1.1069009e+06 1.63e+04 4.49e+01 -1.0 4.46e+03 - 4.80e-01 7.39e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.1015641e+06 1.50e+04 6.27e+01 -1.0 8.24e+03 - 1.75e-01 8.00e-02f 1
11 1.1014191e+06 1.49e+04 4.81e+01 -1.0 9.80e+03 - 3.84e-01 3.51e-03f 1
12 9.9547116e+05 1.49e+02 2.12e+02 -1.0 1.52e+04 - 1.77e-01 9.90e-01f 1
13 8.3749498e+05 6.06e+01 4.82e+03 -1.0 1.38e+04 - 1.58e-01 5.93e-01f 1
14 3.3551655e+05 4.44e-01 2.51e+04 -1.0 3.53e+04 - 6.34e-02 9.93e-01f 1
15 1.9785047e+05 3.94e-01 2.86e+05 -1.0 7.12e+04 - 1.31e-02 1.11e-01f 1
16 1.9516404e+05 3.93e-01 1.25e+06 -1.0 4.28e+04 - 5.28e-01 3.69e-03f 1
17 1.8348370e+05 3.86e-01 2.42e+06 -1.0 5.19e+04 - 4.99e-01 1.84e-02f 1
18 1.7662128e+05 3.73e-01 3.89e+06 -1.0 9.67e+04 - 7.59e-01 3.35e-02f 1
19 8.0308015e+04 2.86e-01 2.64e+06 -1.0 2.81e+05 - 3.15e-02 2.33e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 7.9472435e+04 2.85e-01 2.63e+06 -1.0 3.12e+05 - 6.39e-04 1.39e-03f 1
21 5.0546572e+03 1.16e-10 4.05e+05 -1.0 7.60e+03 - 7.98e-01 1.00e+00f 1
22 1.0290464e+03 2.33e-10 1.60e+06 -1.0 2.95e+03 - 2.93e-01 6.69e-01f 1
23 6.2179795e+02 1.16e-10 1.37e+06 -1.0 1.05e+03 - 2.27e-01 3.45e-01f 1
24 -1.7085986e+02 1.16e-10 1.29e+06 -1.0 1.27e+03 - 3.67e-01 9.14e-01f 1
25 -2.0658017e+02 8.73e-11 3.30e+05 -1.0 1.83e+03 - 7.56e-01 1.00e+00f 1
26 -1.9961667e+02 8.73e-11 2.01e+05 -1.0 6.36e+03 - 3.91e-01 1.00e+00f 1
27 -1.9705002e+02 5.82e-11 4.16e+04 -1.0 8.69e+03 - 7.93e-01 1.00e+00f 1
28 -1.8928418e+02 1.16e-10 2.71e+04 -1.0 3.53e+04 - 3.48e-01 1.00e+00f 1
29 -1.8337474e+02 1.16e-10 4.06e+03 -1.0 4.78e+04 - 8.50e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -1.6396799e+02 5.82e-11 2.43e+03 -1.0 1.78e+05 - 4.01e-01 1.00e+00f 1
31 -1.3586539e+02 1.16e-10 1.55e+02 -1.0 2.53e+05 - 9.36e-01 1.00e+00f 1
32 -8.7822718e+02 5.82e-11 2.08e+06 -2.5 1.62e+05 - 7.86e-01 1.00e+00f 1
33 -9.1251855e+02 1.16e-10 3.25e+05 -2.5 3.72e+05 - 8.43e-01 7.92e-01f 1
34 -9.2527346e+02 1.16e-10 3.17e+00 -2.5 1.74e+05 - 1.00e+00 8.41e-01f 1
35 -9.2672799e+02 5.82e-11 2.83e-08 -2.5 3.58e+04 - 1.00e+00 1.00e+00f 1
36 -9.4908298e+02 1.16e-10 1.34e+04 -5.7 7.90e+04 - 7.15e-01 7.63e-01f 1
37 -9.5581382e+02 1.16e-10 4.30e+03 -5.7 3.81e+04 - 9.79e-01 9.11e-01f 1
38 -9.5637544e+02 1.16e-10 6.14e+02 -5.7 3.49e+03 - 1.00e+00 8.98e-01f 1
39 -9.5640119e+02 5.82e-11 1.85e-11 -5.7 3.56e+02 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -9.5641835e+02 1.16e-10 9.38e-13 -7.0 7.08e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 40
(scaled) (unscaled)
Objective...............: -9.5641834903014598e+00 -9.5641834903014592e+02
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 3.7622542061400369e-07 3.7622542061400371e-05
Overall NLP error.......: 3.7622542061400369e-07 3.7622542061400371e-05
Number of objective function evaluations = 41
Number of objective gradient evaluations = 41
Number of equality constraint evaluations = 41
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 41
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 40
Total CPU secs in IPOPT (w/o function evaluations) = 0.031
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 56966.87
Variable costs: 39260.33
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 844.03
Simulating time_step 2020-07-11 15:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 1.5426635e+03 1.02e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.3793404e+03 1.02e+05 9.91e+01 -1.0 2.60e+04 - 9.00e-04 7.68e-04f 1
2 2.8797230e+03 1.01e+05 9.99e+01 -1.0 6.49e+03 - 4.91e-04 2.68e-03h 1
3 6.2546755e+03 1.01e+05 1.00e+02 -1.0 4.01e+03 - 2.67e-03 4.80e-03h 1
4 2.0141841e+04 9.90e+04 1.01e+02 -1.0 3.09e+03 - 6.95e-03 1.76e-02h 1
5 7.3668672e+04 9.27e+04 9.70e+01 -1.0 2.24e+03 - 4.96e-02 6.42e-02h 1
6 1.5208089e+05 8.31e+04 8.21e+01 -1.0 2.38e+03 - 1.30e-01 1.03e-01h 1
7 5.3661118e+05 3.52e+04 7.58e+01 -1.0 2.80e+03 - 3.23e-01 5.76e-01h 1
8 6.7085023e+05 1.24e+04 4.39e+01 -1.0 4.20e+03 - 4.91e-01 6.47e-01h 1
9 6.5664765e+05 1.04e+04 3.65e+01 -1.0 8.34e+03 - 1.66e-01 1.63e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 6.5639924e+05 1.04e+04 5.08e+01 -1.0 9.50e+03 - 4.32e-01 2.68e-03f 1
11 5.2840387e+05 1.04e+02 1.36e+02 -1.0 1.59e+04 - 1.82e-01 9.90e-01f 1
12 4.4981086e+05 5.80e+01 3.09e+03 -1.0 1.41e+04 - 1.29e-01 4.40e-01f 1
13 2.8031192e+05 4.80e-01 1.66e+04 -1.0 1.25e+04 - 4.52e-02 9.92e-01f 1
14 1.1470121e+05 3.90e-01 3.09e+05 -1.0 8.01e+04 - 1.84e-02 1.88e-01f 1
15 1.1305148e+05 3.89e-01 3.15e+05 -1.0 7.51e+04 - 3.04e-01 2.00e-03f 1
16 1.1045367e+05 3.76e-01 2.03e+06 -1.0 6.13e+03 - 9.28e-01 3.35e-02f 1
17 6.7049220e+03 6.67e-03 2.97e+05 -1.0 8.28e+03 - 7.75e-01 9.82e-01f 1
18 5.3329117e+03 1.73e-03 2.87e+06 -1.0 5.39e+02 - 2.69e-01 7.41e-01f 1
19 5.2356241e+03 1.20e-03 2.36e+06 -1.0 7.94e+02 - 2.26e-01 3.05e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 4.8149845e+03 5.82e-11 2.29e+06 -1.0 1.15e+03 - 3.67e-01 1.00e+00f 1
21 4.8095922e+03 5.82e-11 1.40e+06 -1.0 1.14e+03 - 3.99e-01 1.00e+00f 1
22 4.8132200e+03 1.16e-10 2.10e+05 -1.0 1.94e+03 - 8.50e-01 1.00e+00f 1
23 4.8131525e+03 1.16e-10 1.15e+05 -1.0 1.30e+04 - 4.54e-01 1.00e+00f 1
24 4.8204368e+03 5.82e-11 4.71e+04 -1.0 2.23e+04 - 5.90e-01 1.00e+00f 1
25 4.8269327e+03 1.16e-10 1.72e+04 -1.0 4.96e+04 - 6.35e-01 1.00e+00f 1
26 4.8377110e+03 5.82e-11 4.61e+03 -1.0 9.56e+04 - 7.32e-01 1.00e+00f 1
27 4.8720110e+03 7.28e-11 1.94e+03 -1.0 2.97e+05 - 5.80e-01 1.00e+00f 1
28 4.2235367e+03 5.82e-11 2.00e-07 -1.7 1.12e+04 - 1.00e+00 1.00e+00f 1
29 4.0388200e+03 5.82e-11 7.58e+05 -5.7 3.13e+05 - 5.01e-01 8.79e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 4.0248266e+03 1.16e-10 3.04e+05 -5.7 1.39e+05 - 5.59e-01 4.32e-01f 1
31 4.0136165e+03 5.82e-11 1.64e+04 -5.7 1.14e+05 - 8.83e-01 5.05e-01f 1
32 4.0048090e+03 1.16e-10 1.48e+04 -5.7 7.46e+04 - 5.25e-01 8.59e-01f 1
33 4.0033080e+03 5.82e-11 7.93e+02 -5.7 1.71e+04 - 1.00e+00 9.17e-01f 1
34 4.0032291e+03 5.82e-11 1.85e-11 -5.7 1.42e+03 - 1.00e+00 1.00e+00f 1
35 4.0032100e+03 5.82e-11 9.38e-13 -7.0 7.39e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 35
(scaled) (unscaled)
Objective...............: 4.0032100366806667e+01 4.0032100366806667e+03
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 1.6168794698185390e-12 5.8207660913467407e-11
Complementarity.........: 4.0870853408980623e-07 4.0870853408980623e-05
Overall NLP error.......: 4.0870853408980623e-07 4.0870853408980623e-05
Number of objective function evaluations = 36
Number of objective gradient evaluations = 36
Number of equality constraint evaluations = 36
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 36
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 35
Total CPU secs in IPOPT (w/o function evaluations) = 0.062
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 93995.12
Variable costs: 35779.55
Number on/offs: 1
Sum on/off ramps: 170.00
Sum nominal ramps: 128.62
Simulating time_step 2020-07-11 16:00
Creating and solving SCED to determine UC initial conditions for date: 2020-07-12 hour: 0
Using persistent forecast error model when projecting demand and renewables in SCED
Extracting scenario to simulate
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 6.4516080e+03 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 6.2929884e+03 1.64e+05 9.91e+01 -1.0 2.53e+04 - 8.71e-04 7.47e-04f 1
2 7.7620286e+03 1.63e+05 9.99e+01 -1.0 6.54e+03 - 4.74e-04 2.63e-03h 1
3 1.6642498e+04 1.61e+05 1.02e+02 -1.0 3.64e+03 - 2.63e-03 1.29e-02h 1
4 7.2921088e+04 1.50e+05 1.05e+02 -1.0 1.34e+03 - 1.84e-02 6.98e-02h 1
5 1.0159409e+05 1.44e+05 8.74e+01 -1.0 2.09e+03 - 1.11e-01 4.04e-02h 1
6 5.6583653e+05 4.75e+04 1.08e+02 -1.0 2.66e+03 - 2.12e-01 6.70e-01h 1
7 6.4138926e+05 2.85e+04 4.56e+01 -1.0 3.39e+03 - 5.40e-01 4.00e-01h 1
8 6.8090129e+05 2.85e+02 4.66e+02 -1.0 7.29e+03 - 1.29e-01 9.90e-01h 1
9 5.7532450e+05 2.68e+00 2.21e+03 -1.0 7.89e+03 - 6.07e-01 9.91e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.8009060e+05 5.82e-11 5.15e+05 -1.0 1.54e+04 - 1.05e-01 1.00e+00f 1
11 2.4828636e+05 5.82e-11 9.36e+06 -1.0 9.53e+03 - 5.78e-02 1.00e+00f 1
12 8.7058494e+04 5.82e-11 9.18e+06 -1.0 7.89e+04 - 1.90e-02 1.90e-01f 1
13 8.5452625e+04 1.16e-10 6.39e+06 -1.0 7.51e+04 - 3.05e-01 2.00e-03f 1
14 8.3600226e+04 5.82e-11 3.41e+05 -1.0 4.31e+03 - 9.47e-01 3.41e-02f 1
15 1.1021049e+04 5.82e-11 9.70e+04 -1.0 5.78e+03 - 7.15e-01 9.87e-01f 1
16 1.0318944e+04 5.82e-11 6.69e+04 -1.0 2.25e+03 - 3.10e-01 6.38e-01f 1
17 1.0205046e+04 5.82e-11 5.17e+04 -1.0 2.23e+03 - 2.27e-01 3.72e-01f 1
18 9.8757503e+03 5.82e-11 3.31e+04 -1.0 2.42e+03 - 3.60e-01 1.00e+00f 1
19 9.8490476e+03 5.82e-11 9.85e+03 -1.0 2.64e+03 - 7.03e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 9.8471665e+03 5.82e-11 5.36e+03 -1.0 5.07e+03 - 4.56e-01 1.00e+00f 1
21 9.8533907e+03 5.82e-11 1.21e+03 -1.0 8.31e+03 - 7.74e-01 1.00e+00f 1
22 9.1538767e+03 5.82e-11 2.10e+06 -1.7 7.07e+03 - 7.37e-01 1.00e+00f 1
23 9.1576104e+03 5.82e-11 3.26e+05 -1.7 2.43e+04 - 8.45e-01 1.00e+00f 1
24 9.1673315e+03 5.82e-11 2.10e+05 -1.7 1.05e+05 - 3.57e-01 1.00e+00f 1
25 9.1773468e+03 5.82e-11 5.79e+04 -1.7 7.91e+04 - 7.24e-01 1.00e+00f 1
26 9.1933911e+03 5.82e-11 2.00e-07 -1.7 1.46e+05 - 1.00e+00 1.00e+00f 1
27 8.9956198e+03 5.82e-11 9.45e+05 -5.7 1.45e+05 - 5.27e-01 9.99e-01f 1
28 8.9850975e+03 5.82e-11 2.17e+05 -5.7 1.72e+05 - 7.70e-01 5.50e-01f 1
29 8.9759279e+03 5.82e-11 9.35e+04 -5.7 1.06e+05 - 5.70e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 8.9751893e+03 5.82e-11 2.45e+03 -5.7 1.38e+04 - 9.74e-01 9.79e-01f 1
31 8.9751684e+03 5.82e-11 1.85e-11 -5.7 6.14e+02 - 1.00e+00 1.00e+00f 1
32 8.9751493e+03 5.82e-11 9.38e-13 -7.0 7.69e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 32
(scaled) (unscaled)
Objective...............: 8.9751493191720016e+01 8.9751493191720019e+03
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 5.8207660913467407e-11
Complementarity.........: 1.2652992181878229e-07 1.2652992181878228e-05
Overall NLP error.......: 1.2652992181878229e-07 1.2652992181878228e-05
Number of objective function evaluations = 33
Number of objective gradient evaluations = 33
Number of equality constraint evaluations = 33
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 33
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 32
Total CPU secs in IPOPT (w/o function evaluations) = 0.039
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 1.1372859e+04 1.51e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.1143087e+04 1.51e+05 9.91e+01 -1.0 6.66e+03 - 1.35e-03 1.07e-03f 1
2 1.1576877e+04 1.51e+05 9.95e+01 -1.0 5.53e+03 - 1.44e-03 3.66e-03h 1
3 1.5083404e+04 1.48e+05 9.70e+01 -1.0 1.32e+03 - 7.52e-01 1.49e-02h 1
4 2.8841592e+05 1.48e+03 3.33e+02 -1.0 5.25e+03 - 1.99e-02 9.90e-01h 1
5 2.6096695e+05 1.03e+02 6.22e+02 -1.0 3.30e+03 - 3.21e-01 9.31e-01f 1
6 2.2930552e+05 8.78e-01 9.78e+03 -1.0 3.26e+03 - 3.27e-01 9.91e-01f 1
7 2.0255343e+05 5.82e-11 1.25e+06 -1.0 2.58e+03 - 1.49e-01 1.00e+00f 1
8 1.5332539e+05 5.82e-11 9.37e+06 -1.0 3.51e+03 - 4.16e-02 1.00e+00f 1
9 2.2707795e+04 1.16e-10 8.98e+06 -1.0 8.71e+04 - 4.17e-02 1.48e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.1401013e+04 5.82e-11 1.96e+05 -1.0 7.64e+04 - 9.78e-01 1.69e-03f 1
11 1.9619836e+04 5.82e-11 5.75e+04 -1.0 1.02e+03 - 7.06e-01 1.75e-01f 1
12 1.3022725e+04 5.82e-11 5.18e+04 -1.0 1.60e+03 - 9.87e-02 7.68e-01f 1
13 1.2163242e+04 5.82e-11 2.26e+04 -1.0 5.06e+02 - 5.63e-01 4.64e-01f 1
14 1.1101557e+04 5.82e-11 1.74e+04 -1.0 2.37e+03 - 2.31e-01 1.00e+00f 1
15 1.1070424e+04 5.82e-11 5.75e+03 -1.0 2.71e+03 - 6.70e-01 1.00e+00f 1
16 1.1069873e+04 5.82e-11 2.51e+03 -1.0 8.12e+03 - 5.63e-01 1.00e+00f 1
17 1.1075318e+04 8.73e-11 9.34e+02 -1.0 1.80e+04 - 6.28e-01 1.00e+00f 1
18 1.0375084e+04 5.82e-11 1.06e+06 -1.7 8.86e+03 - 8.67e-01 1.00e+00f 1
19 1.0381324e+04 5.82e-11 3.63e+05 -1.7 5.50e+04 - 6.57e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.0392374e+04 5.82e-11 8.51e+04 -1.7 9.44e+04 - 7.66e-01 1.00e+00f 1
21 1.0412447e+04 5.82e-11 1.52e+04 -1.7 1.79e+05 - 8.21e-01 1.00e+00f 1
22 1.0415611e+04 5.82e-11 2.00e-07 -1.7 5.60e+04 - 1.00e+00 1.00e+00f 1
23 1.0224931e+04 5.82e-11 8.08e+05 -5.7 8.79e+04 - 5.95e-01 9.99e-01f 1
24 1.0206474e+04 5.82e-11 3.43e+05 -5.7 2.04e+05 - 5.76e-01 6.88e-01f 1
25 1.0197647e+04 5.82e-11 2.50e+05 -5.7 9.19e+04 - 2.73e-01 1.00e+00f 1
26 1.0196440e+04 5.82e-11 4.53e+03 -5.7 2.49e+04 - 9.82e-01 1.00e+00f 1
27 1.0196429e+04 5.82e-11 1.85e-11 -5.7 2.19e+02 - 1.00e+00 1.00e+00f 1
28 1.0196410e+04 5.82e-11 9.38e-13 -7.0 7.82e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 28
(scaled) (unscaled)
Objective...............: 1.0196409881356604e+02 1.0196409881356603e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 5.8207660913467407e-11
Complementarity.........: 1.2653017759630835e-07 1.2653017759630835e-05
Overall NLP error.......: 1.2653017759630835e-07 1.2653017759630835e-05
Number of objective function evaluations = 29
Number of objective gradient evaluations = 29
Number of equality constraint evaluations = 29
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 29
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 28
Total CPU secs in IPOPT (w/o function evaluations) = 0.026
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 1.2593830e+04 5.00e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.2232432e+04 4.99e+03 9.92e+01 -1.0 6.66e+03 - 2.47e-03 1.68e-03f 1
2 1.2524589e+04 4.92e+03 9.92e+01 -1.0 1.37e+03 - 3.14e-03 1.39e-02h 1
3 4.2533268e+04 4.02e+03 7.95e+01 -1.0 1.32e+03 - 8.46e-01 1.84e-01h 1
4 8.6780028e+04 1.40e+03 2.73e+01 -1.0 6.41e+03 - 3.06e-01 6.52e-01h 1
5 7.2708511e+04 1.40e+01 9.00e+00 -1.0 6.14e+03 - 8.99e-01 9.90e-01f 1
6 1.3911587e+04 1.35e-01 3.95e+02 -1.0 6.04e+03 - 8.80e-01 9.90e-01f 1
7 1.2695665e+04 2.44e-02 2.05e+05 -1.0 4.76e+02 - 2.45e-01 8.19e-01f 1
8 1.2680758e+04 1.76e-02 2.25e+05 -1.0 8.94e+02 - 2.34e-01 2.80e-01f 1
9 1.2396100e+04 1.64e-04 1.32e+06 -1.0 1.05e+03 - 3.63e-01 9.91e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.2381282e+04 5.82e-11 8.03e+06 -1.0 8.85e+02 - 5.22e-02 1.00e+00f 1
11 1.2365151e+04 5.82e-11 1.84e+06 -1.0 9.84e+02 - 7.78e-01 1.00e+00f 1
12 1.2320614e+04 5.82e-11 8.71e+05 -1.0 4.79e+03 - 5.28e-01 1.00e+00f 1
13 1.2348052e+04 5.82e-11 3.49e+05 -1.0 9.67e+03 - 6.00e-01 1.00e+00f 1
14 1.2345900e+04 5.82e-11 1.39e+05 -1.0 2.35e+04 - 6.02e-01 1.00e+00f 1
15 1.2355958e+04 5.82e-11 5.68e+04 -1.0 5.35e+04 - 5.91e-01 1.00e+00f 1
16 1.2366890e+04 5.82e-11 1.70e+04 -1.0 9.65e+04 - 7.01e-01 1.00e+00f 1
17 1.2378974e+04 5.82e-11 5.44e+03 -1.0 1.73e+05 - 6.79e-01 5.15e-01f 1
18 1.2387953e+04 5.82e-11 7.90e-01 -1.0 8.46e+04 - 1.00e+00 7.83e-01f 1
19 1.1437620e+04 5.82e-11 9.37e+05 -5.7 9.06e+03 - 9.05e-01 9.98e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.1416954e+04 5.82e-11 9.09e+05 -5.7 2.09e+05 - 3.99e-02 5.75e-01f 1
21 1.1400905e+04 5.82e-11 5.00e+04 -5.7 1.38e+05 - 9.44e-01 8.71e-01f 1
22 1.1397625e+04 5.82e-11 6.56e+03 -5.7 2.53e+04 - 8.71e-01 9.99e-01f 1
23 1.1397624e+04 5.82e-11 1.85e-11 -5.7 3.32e+01 - 1.00e+00 1.00e+00f 1
24 1.1397603e+04 5.82e-11 9.38e-13 -7.0 8.53e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 24
(scaled) (unscaled)
Objective...............: 1.1397603367955345e+02 1.1397603367955346e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 8.0843973490926950e-13 5.8207660913467407e-11
Complementarity.........: 1.2661749934702213e-07 1.2661749934702213e-05
Overall NLP error.......: 1.2661749934702213e-07 1.2661749934702213e-05
Number of objective function evaluations = 25
Number of objective gradient evaluations = 25
Number of equality constraint evaluations = 25
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 25
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 24
Total CPU secs in IPOPT (w/o function evaluations) = 0.018
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 1.3794734e+04 5.00e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.3433337e+04 4.99e+03 9.92e+01 -1.0 6.66e+03 - 2.47e-03 1.68e-03f 1
2 1.3725502e+04 4.92e+03 9.92e+01 -1.0 1.37e+03 - 3.14e-03 1.39e-02h 1
3 4.3734106e+04 4.02e+03 7.95e+01 -1.0 1.32e+03 - 8.46e-01 1.84e-01h 1
4 8.7982007e+04 1.40e+03 2.73e+01 -1.0 6.41e+03 - 3.06e-01 6.52e-01h 1
5 7.3980349e+04 1.40e+01 9.00e+00 -1.0 6.14e+03 - 8.99e-01 9.90e-01f 1
6 1.5187644e+04 1.35e-01 3.95e+02 -1.0 6.04e+03 - 8.80e-01 9.90e-01f 1
7 1.3983251e+04 2.44e-02 2.05e+05 -1.0 4.75e+02 - 2.46e-01 8.19e-01f 1
8 1.3969211e+04 1.76e-02 2.25e+05 -1.0 8.92e+02 - 2.34e-01 2.80e-01f 1
9 1.3686905e+04 1.50e-04 1.33e+06 -1.0 1.05e+03 - 3.63e-01 9.91e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.3668184e+04 5.82e-11 8.05e+06 -1.0 8.91e+02 - 5.21e-02 1.00e+00f 1
11 1.3645748e+04 5.82e-11 1.95e+06 -1.0 9.98e+02 - 7.66e-01 1.00e+00f 1
12 1.3587581e+04 5.82e-11 8.90e+05 -1.0 4.66e+03 - 5.43e-01 1.00e+00f 1
13 1.3620332e+04 5.82e-11 3.68e+05 -1.0 9.69e+03 - 5.87e-01 1.00e+00f 1
14 1.3616526e+04 5.82e-11 1.41e+05 -1.0 2.29e+04 - 6.16e-01 1.00e+00f 1
15 1.3627429e+04 5.82e-11 5.98e+04 -1.0 5.36e+04 - 5.76e-01 1.00e+00f 1
16 1.3634367e+04 5.82e-11 1.44e+04 -1.0 8.20e+04 - 7.59e-01 6.96e-01f 1
17 1.3639301e+04 5.82e-11 4.89e+00 -1.0 6.68e+04 - 1.00e+00 4.65e-01f 1
18 1.2620643e+04 5.82e-11 4.94e+05 -3.8 2.56e+03 - 9.49e-01 9.99e-01f 1
19 1.2601594e+04 5.82e-11 3.33e+05 -3.8 1.24e+05 - 3.43e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.2600898e+04 5.82e-11 1.50e-09 -3.8 5.49e+03 - 1.00e+00 1.00e+00f 1
21 1.2598852e+04 5.82e-11 1.70e+02 -5.7 7.15e+03 - 9.64e-01 9.52e-01f 1
22 1.2598821e+04 5.82e-11 1.85e-11 -5.7 3.85e+02 - 1.00e+00 1.00e+00f 1
23 1.2598797e+04 5.82e-11 9.38e-13 -7.0 8.28e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 23
(scaled) (unscaled)
Objective...............: 1.2598797028437768e+02 1.2598797028437768e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 5.8207660913467407e-11
Complementarity.........: 3.8302652126068481e-07 3.8302652126068478e-05
Overall NLP error.......: 3.8302652126068481e-07 3.8302652126068478e-05
Number of objective function evaluations = 24
Number of objective gradient evaluations = 24
Number of equality constraint evaluations = 24
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 24
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 23
Total CPU secs in IPOPT (w/o function evaluations) = 0.032
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 1.4995638e+04 5.00e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.4634242e+04 4.99e+03 9.92e+01 -1.0 6.66e+03 - 2.47e-03 1.68e-03f 1
2 1.4927637e+04 4.92e+03 9.92e+01 -1.0 1.37e+03 - 3.14e-03 1.40e-02h 1
3 4.3942550e+04 4.05e+03 8.01e+01 -1.0 1.32e+03 - 8.47e-01 1.77e-01h 1
4 8.8856909e+04 1.41e+03 2.74e+01 -1.0 6.42e+03 - 2.96e-01 6.53e-01h 1
5 7.5585336e+04 1.41e+01 8.95e+00 -1.0 6.09e+03 - 9.00e-01 9.90e-01f 1
6 1.6487042e+04 1.36e-01 3.90e+02 -1.0 6.07e+03 - 8.81e-01 9.90e-01f 1
7 1.5329995e+04 2.94e-02 1.91e+05 -1.0 4.73e+02 - 2.46e-01 7.83e-01f 1
8 1.5324072e+04 2.24e-02 3.51e+05 -1.0 1.05e+03 - 5.84e-01 2.39e-01f 1
9 1.5262506e+04 1.35e-02 1.03e+06 -1.0 3.26e+02 - 8.89e-01 3.97e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.5298570e+04 3.97e-03 8.84e+05 -1.0 5.55e+02 - 9.91e-01 7.07e-01f 1
11 1.5347142e+04 5.82e-11 1.00e-06 -1.0 1.01e+02 - 1.00e+00 1.00e+00f 1
12 1.3809031e+04 5.82e-11 5.29e+04 -5.7 5.53e+02 - 9.99e-01 9.92e-01f 1
13 1.3801958e+04 5.82e-11 1.77e+04 -5.7 3.51e+00 - 9.58e-01 6.86e-01f 1
14 1.3800292e+04 5.82e-11 4.97e+03 -5.7 6.57e-01 - 9.79e-01 7.21e-01f 1
15 1.3799992e+04 5.82e-11 7.09e+02 -5.7 1.20e-01 - 1.00e+00 8.57e-01f 1
16 1.3799982e+04 5.82e-11 1.85e-11 -5.7 2.59e-01 - 1.00e+00 1.00e+00f 1
17 1.3799966e+04 5.82e-11 4.09e+00 -7.0 8.42e-02 - 9.81e-01 1.00e+00f 1
18 1.3799966e+04 5.82e-11 9.38e-13 -7.0 3.11e+00 - 1.00e+00 1.00e+00h 1
19 1.3799966e+04 5.82e-11 9.38e-13 -7.0 1.38e+00 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 19
(scaled) (unscaled)
Objective...............: 1.3799966137905250e+02 1.3799966137905249e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 5.8207660913467407e-11
Complementarity.........: 3.9679660396327961e-07 3.9679660396327959e-05
Overall NLP error.......: 3.9679660396327961e-07 3.9679660396327959e-05
Number of objective function evaluations = 20
Number of objective gradient evaluations = 20
Number of equality constraint evaluations = 20
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 20
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 19
Total CPU secs in IPOPT (w/o function evaluations) = 0.025
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 1.6196514e+04 5.00e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.3820699e+04 4.94e+03 1.50e+01 -1.0 9.00e-01 - 8.48e-01 1.10e-02f 1
2 1.3831536e+04 4.74e+03 5.22e+01 -1.0 6.85e+00 - 2.92e-02 4.22e-02h 1
3 1.4265607e+04 4.74e+01 2.71e+02 -1.0 2.47e+00 - 1.76e-01 9.90e-01h 1
4 1.4530066e+04 4.69e-01 2.06e+02 -1.0 2.71e+00 - 7.95e-01 9.90e-01h 1
5 1.4767793e+04 2.34e-01 4.70e+04 -1.0 4.03e+00 - 9.46e-01 5.00e-01f 2
6 1.5127849e+04 5.82e-11 2.07e+03 -1.0 7.45e+01 - 9.90e-01 1.00e+00f 1
7 1.5178476e+04 5.82e-11 6.45e+05 -1.0 1.56e+03 - 2.02e-01 2.69e-01f 1
8 1.5346815e+04 5.82e-11 4.86e+04 -1.0 2.89e+02 - 9.94e-01 1.00e+00f 1
9 1.5348487e+04 5.82e-11 1.00e-06 -1.0 1.03e+02 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.3804627e+04 5.82e-11 3.36e+04 -5.7 5.32e+02 - 1.00e+00 9.96e-01f 1
11 1.3800965e+04 5.82e-11 1.18e+04 -5.7 1.73e+00 - 9.55e-01 6.89e-01f 1
12 1.3800151e+04 5.82e-11 3.62e+03 -5.7 3.07e-01 - 9.83e-01 6.98e-01f 1
13 1.3799996e+04 5.82e-11 3.66e+02 -5.7 5.17e-02 - 1.00e+00 8.99e-01f 1
14 1.3799998e+04 5.82e-11 1.85e-11 -5.7 9.93e-02 - 1.00e+00 1.00e+00f 1
15 1.3799982e+04 5.82e-11 9.38e-13 -7.0 2.49e-02 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.3799982175273001e+02 1.3799982175273000e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 5.8207660913467407e-11
Complementarity.........: 3.1020309938574249e-07 3.1020309938574247e-05
Overall NLP error.......: 3.1020309938574249e-07 3.1020309938574247e-05
Number of objective function evaluations = 17
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.021
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 1.6196514e+04 5.00e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.3820699e+04 4.94e+03 1.50e+01 -1.0 9.00e-01 - 8.48e-01 1.10e-02f 1
2 1.3831536e+04 4.74e+03 5.22e+01 -1.0 6.85e+00 - 2.92e-02 4.22e-02h 1
3 1.4265687e+04 4.74e+01 2.71e+02 -1.0 2.47e+00 - 1.76e-01 9.90e-01h 1
4 1.4530251e+04 4.69e-01 2.06e+02 -1.0 2.71e+00 - 7.96e-01 9.90e-01h 1
5 1.4767935e+04 2.34e-01 4.70e+04 -1.0 4.03e+00 - 9.46e-01 5.00e-01f 2
6 1.5127812e+04 5.82e-11 2.06e+03 -1.0 7.43e+01 - 9.90e-01 1.00e+00f 1
7 1.5178440e+04 5.82e-11 6.36e+05 -1.0 1.56e+03 - 2.03e-01 2.69e-01f 1
8 1.5346791e+04 5.82e-11 4.86e+04 -1.0 2.90e+02 - 9.94e-01 1.00e+00f 1
9 1.5348487e+04 5.82e-11 1.00e-06 -1.0 1.03e+02 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.3804627e+04 5.82e-11 3.36e+04 -5.7 5.32e+02 - 1.00e+00 9.96e-01f 1
11 1.3800965e+04 5.82e-11 1.18e+04 -5.7 1.73e+00 - 9.55e-01 6.89e-01f 1
12 1.3800151e+04 5.82e-11 3.62e+03 -5.7 3.07e-01 - 9.83e-01 6.98e-01f 1
13 1.3799996e+04 5.82e-11 3.66e+02 -5.7 5.18e-02 - 1.00e+00 8.99e-01f 1
14 1.3799998e+04 5.82e-11 1.85e-11 -5.7 9.94e-02 - 1.00e+00 1.00e+00f 1
15 1.3799982e+04 5.82e-11 9.38e-13 -7.0 2.49e-02 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.3799982175290268e+02 1.3799982175290268e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 5.8207660913467407e-11
Complementarity.........: 3.1019865964772701e-07 3.1019865964772697e-05
Overall NLP error.......: 3.1019865964772701e-07 3.1019865964772697e-05
Number of objective function evaluations = 17
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.019
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 1.6196514e+04 5.00e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.3820699e+04 4.94e+03 1.50e+01 -1.0 9.00e-01 - 8.48e-01 1.10e-02f 1
2 1.3831536e+04 4.74e+03 5.22e+01 -1.0 6.85e+00 - 2.92e-02 4.22e-02h 1
3 1.4265687e+04 4.74e+01 2.71e+02 -1.0 2.47e+00 - 1.76e-01 9.90e-01h 1
4 1.4530251e+04 4.69e-01 2.06e+02 -1.0 2.71e+00 - 7.96e-01 9.90e-01h 1
5 1.4767935e+04 2.34e-01 4.70e+04 -1.0 4.03e+00 - 9.46e-01 5.00e-01f 2
6 1.5127812e+04 5.82e-11 2.06e+03 -1.0 7.43e+01 - 9.90e-01 1.00e+00f 1
7 1.5178440e+04 5.82e-11 6.36e+05 -1.0 1.56e+03 - 2.03e-01 2.69e-01f 1
8 1.5346791e+04 5.82e-11 4.86e+04 -1.0 2.90e+02 - 9.94e-01 1.00e+00f 1
9 1.5348487e+04 5.82e-11 1.00e-06 -1.0 1.03e+02 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.3804627e+04 5.82e-11 3.36e+04 -5.7 5.32e+02 - 1.00e+00 9.96e-01f 1
11 1.3800965e+04 5.82e-11 1.18e+04 -5.7 1.73e+00 - 9.55e-01 6.89e-01f 1
12 1.3800151e+04 5.82e-11 3.62e+03 -5.7 3.07e-01 - 9.83e-01 6.98e-01f 1
13 1.3799996e+04 5.82e-11 3.66e+02 -5.7 5.18e-02 - 1.00e+00 8.99e-01f 1
14 1.3799998e+04 5.82e-11 1.85e-11 -5.7 9.94e-02 - 1.00e+00 1.00e+00f 1
15 1.3799982e+04 5.82e-11 9.38e-13 -7.0 2.49e-02 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 15
(scaled) (unscaled)
Objective...............: 1.3799982175290646e+02 1.3799982175290645e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 5.8207660913467407e-11
Complementarity.........: 3.1019876185322737e-07 3.1019876185322737e-05
Overall NLP error.......: 3.1019876185322737e-07 3.1019876185322737e-05
Number of objective function evaluations = 17
Number of objective gradient evaluations = 16
Number of equality constraint evaluations = 17
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 16
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 15
Total CPU secs in IPOPT (w/o function evaluations) = 0.019
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 6903
Number of nonzeros in inequality constraint Jacobian.: 552
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 4317
variables with only lower bounds: 864
variables with lower and upper bounds: 3309
variables with only upper bounds: 144
Total number of equality constraints.................: 4029
Total number of inequality constraints...............: 288
inequality constraints with only lower bounds: 288
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -1.9030471e+06 3.11e+04 3.49e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.9030463e+06 3.10e+04 4.21e+00 -1.0 9.83e+04 - 3.62e-04 6.90e-05h 1
2 -1.9030433e+06 3.10e+04 1.10e+00 -1.0 9.98e+04 - 2.41e-05 1.94e-04h 1
3 -1.9030394e+06 3.10e+04 3.96e+01 -1.0 9.99e+04 - 1.77e-03 2.41e-04h 1
4 -1.9029981e+06 3.10e+04 1.32e+01 -1.0 1.00e+05 - 1.56e-04 2.61e-03h 1
5 -1.9029303e+06 3.08e+04 1.28e+01 -1.0 9.97e+04 - 4.31e-03 4.29e-03h 1
6 -1.9028998e+06 3.08e+04 2.38e+01 -1.0 9.93e+04 - 5.97e-04 1.87e-03h 1
7 -1.9028927e+06 3.08e+04 2.69e+01 -1.0 4.04e+05 - 1.62e-05 4.28e-04h 1
8 -1.9028875e+06 3.07e+04 2.91e+01 -1.0 4.75e+05 - 1.16e-04 4.18e-04h 1
9 -1.9028845e+06 3.07e+04 3.25e+01 -1.0 4.73e+05 - 2.88e-04 7.64e-04h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -1.9028961e+06 3.06e+04 4.47e+01 -1.0 4.67e+05 - 6.75e-04 2.48e-03f 1
11 -1.9029000e+06 3.06e+04 3.10e+01 -1.0 4.49e+05 - 3.33e-03 1.02e-03f 1
12 -1.9029003e+06 3.06e+04 8.68e+01 -1.0 4.24e+05 - 1.02e-02 1.09e-03h 1
13 -1.9028860e+06 3.05e+04 1.31e+02 -1.0 3.46e+05 - 9.04e-03 3.38e-03h 1
14 -1.9028401e+06 3.04e+04 1.25e+02 -1.0 4.70e+05 - 2.75e-03 3.52e-03h 1
15 -1.9028027e+06 3.03e+04 1.14e+02 -1.0 4.46e+05 - 2.14e-04 2.38e-03h 1
16 -1.9027909e+06 3.03e+04 1.79e+02 -1.0 4.33e+05 - 1.28e-02 6.29e-04h 1
17 -1.9025860e+06 3.00e+04 1.53e+02 -1.0 3.64e+05 - 2.21e-03 8.36e-03h 1
18 -1.9025408e+06 3.00e+04 1.54e+02 -1.0 2.73e+05 - 2.12e-03 1.53e-03h 1
19 -1.9025046e+06 2.99e+04 1.54e+02 -1.0 2.80e+05 - 1.17e-03 1.19e-03h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 -1.9024221e+06 2.99e+04 1.49e+02 -1.0 2.76e+05 - 1.23e-03 2.69e-03h 1
21 -1.9022753e+06 2.97e+04 1.36e+02 -1.0 2.60e+05 - 6.54e-04 5.09e-03h 1
22 -1.9021965e+06 2.96e+04 1.37e+02 -1.0 2.08e+05 - 3.30e-03 2.90e-03h 1
23 -1.9021191e+06 2.95e+04 1.38e+02 -1.0 1.94e+05 - 3.58e-03 2.71e-03h 1
24 -1.9019745e+06 2.94e+04 1.44e+02 -1.0 1.83e+05 - 7.37e-03 4.59e-03h 1
25 -1.9017248e+06 2.92e+04 1.33e+02 -1.0 1.64e+05 - 1.71e-03 6.97e-03h 1
26 -1.9015458e+06 2.91e+04 1.46e+02 -1.0 1.76e+05 - 1.25e-02 4.84e-03h 1
27 -1.9013451e+06 2.89e+04 1.52e+02 -1.0 1.84e+05 - 1.02e-02 5.17e-03h 1
28 -1.9010752e+06 2.87e+04 1.62e+02 -1.0 1.81e+05 - 1.53e-02 6.66e-03h 1
29 -1.9000690e+06 2.80e+04 2.14e+02 -1.0 1.75e+05 - 3.10e-02 2.42e-02h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -1.8995650e+06 2.77e+04 1.56e+02 -1.0 1.53e+05 - 5.20e-04 1.15e-02h 1
31 -1.8994177e+06 2.76e+04 1.56e+02 -1.0 1.48e+05 - 4.81e-03 3.36e-03h 1
32 -1.8990787e+06 2.74e+04 1.50e+02 -1.0 1.47e+05 - 1.94e-04 8.79e-03h 1
33 -1.8988950e+06 2.72e+04 1.50e+02 -1.0 1.48e+05 - 7.28e-03 5.02e-03h 1
34 -1.8988212e+06 2.72e+04 1.55e+02 -1.0 1.46e+05 - 1.13e-02 1.72e-03h 1
35 -1.8978854e+06 2.66e+04 1.50e+02 -1.0 1.40e+05 - 1.75e-02 2.16e-02h 1
36 -1.8963239e+06 2.56e+04 2.11e+02 -1.0 1.20e+05 - 5.06e-02 3.59e-02h 1
37 -1.8960630e+06 2.55e+04 5.17e+02 -1.0 8.26e+04 - 6.98e-02 5.81e-03h 1
38 -1.8932156e+06 2.39e+04 5.12e+02 -1.0 8.21e+04 - 7.79e-02 6.10e-02h 1
39 -1.8908526e+06 2.27e+04 4.64e+02 -1.0 7.71e+04 - 8.34e-02 5.22e-02h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -1.8878759e+06 2.11e+04 4.70e+02 -1.0 7.31e+04 - 3.66e-02 6.92e-02h 1
41 -1.8875627e+06 2.09e+04 4.35e+02 -1.0 6.80e+04 - 3.24e-02 7.78e-03h 1
42 -1.8814378e+06 1.77e+04 5.38e+02 -1.0 6.75e+04 - 2.13e-02 1.53e-01h 1
43 -1.8777077e+06 1.57e+04 6.17e+02 -1.0 6.36e+04 - 1.24e-02 1.13e-01h 1
44 -1.8775585e+06 1.57e+04 5.46e+02 -1.0 6.32e+04 - 5.22e-02 5.15e-03h 1
45 -1.8747440e+06 1.41e+04 6.17e+02 -1.0 6.61e+04 - 8.65e-03 9.85e-02h 1
46 -1.8740270e+06 1.37e+04 4.81e+02 -1.0 6.53e+04 - 1.12e-01 2.82e-02h 1
47 -1.8710394e+06 1.20e+04 4.96e+02 -1.0 7.14e+04 - 6.55e-02 1.23e-01h 1
48 -1.8702040e+06 1.15e+04 4.85e+02 -1.0 7.25e+04 - 3.26e-02 4.01e-02h 1
49 -1.8680446e+06 1.03e+04 5.54e+02 -1.0 7.33e+04 - 1.04e-02 1.10e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
50 -1.8671975e+06 9.76e+03 5.08e+02 -1.0 7.07e+04 - 6.47e-02 5.02e-02h 1
51 -1.8667728e+06 9.50e+03 5.02e+02 -1.0 7.23e+04 - 2.07e-02 2.72e-02h 1
52 -1.8665360e+06 9.35e+03 5.05e+02 -1.0 1.31e+05 - 6.25e-03 1.59e-02h 1
53 -1.8660820e+06 9.05e+03 5.12e+02 -1.0 1.14e+05 - 1.13e-02 3.13e-02h 1
54 -1.8660121e+06 9.00e+03 4.34e+02 -1.0 1.30e+05 - 7.24e-02 5.55e-03h 1
55 -1.8647796e+06 8.09e+03 4.43e+02 -1.0 1.35e+05 - 5.14e-02 1.02e-01h 1
56 -1.8645527e+06 7.90e+03 3.48e+02 -1.0 1.24e+05 - 1.06e-01 2.28e-02h 1
57 -1.8634629e+06 6.98e+03 2.63e+02 -1.0 1.23e+05 - 1.65e-01 1.17e-01h 1
58 -1.8633988e+06 6.92e+03 2.35e+02 -1.0 1.13e+05 - 4.09e-02 8.49e-03h 1
59 -1.8629284e+06 6.48e+03 2.08e+02 -1.0 1.13e+05 - 2.72e-01 6.32e-02h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
60 -1.8625065e+06 6.01e+03 2.02e+02 -1.0 1.10e+05 - 2.21e-01 7.36e-02h 1
61 -1.8621141e+06 5.45e+03 1.92e+02 -1.0 1.05e+05 - 3.64e-03 9.28e-02h 1
62 -1.8618804e+06 4.99e+03 2.18e+02 -1.0 1.17e+05 - 5.74e-04 8.38e-02h 1
63 -1.8616833e+06 4.55e+03 2.49e+02 -1.0 1.15e+05 - 4.68e-01 8.79e-02h 1
64 -1.8618585e+06 3.62e+03 1.90e+02 -1.0 1.05e+05 - 1.92e-01 2.05e-01f 1
65 -1.8619532e+06 3.50e+03 2.40e+02 -1.0 8.59e+04 - 1.44e-01 3.37e-02f 1
66 -1.8620591e+06 3.40e+03 2.23e+02 -1.0 8.46e+04 - 4.84e-03 2.79e-02f 1
67 -1.8622199e+06 3.27e+03 2.05e+02 -1.0 8.30e+04 - 1.88e-02 3.85e-02f 1
68 -1.8625956e+06 2.98e+03 1.83e+02 -1.0 8.12e+04 - 7.95e-02 8.71e-02f 1
69 -1.8631702e+06 2.67e+03 1.48e+02 -1.0 8.18e+04 - 1.42e-02 1.04e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
70 -1.8632210e+06 2.66e+03 1.29e+02 -1.0 8.27e+04 - 1.99e-02 6.41e-03f 1
71 -1.8632810e+06 2.63e+03 1.66e+02 -1.0 8.44e+04 - 9.38e-02 1.05e-02f 1
72 -1.8635694e+06 2.52e+03 1.71e+02 -1.0 9.31e+04 - 7.10e-02 4.23e-02f 1
73 -1.8640267e+06 2.36e+03 1.48e+02 -1.0 1.00e+05 - 3.10e-02 6.08e-02f 1
74 -1.8642946e+06 2.29e+03 1.39e+02 -1.0 1.03e+05 - 1.81e-02 2.94e-02f 1
75 -1.8643231e+06 2.29e+03 2.07e+02 -1.0 1.05e+05 - 1.72e-01 3.55e-03f 1
76 -1.8652910e+06 2.06e+03 2.78e+02 -1.0 1.27e+05 - 3.50e-01 9.81e-02f 1
77 -1.8663212e+06 1.93e+03 2.72e+02 -1.0 1.95e+05 - 9.94e-02 6.36e-02f 1
78 -1.8680825e+06 1.75e+03 2.41e+02 -1.0 2.11e+05 - 8.02e-02 9.48e-02f 1
79 -1.8701263e+06 1.57e+03 2.26e+02 -1.0 2.19e+05 - 1.30e-01 1.02e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
80 -1.8707767e+06 1.53e+03 2.11e+02 -1.0 2.30e+05 - 2.18e-03 2.85e-02f 1
81 -1.8710753e+06 1.51e+03 2.68e+02 -1.0 2.25e+05 - 2.10e-01 1.28e-02f 1
82 -1.8712483e+06 1.49e+03 2.68e+02 -1.0 1.97e+05 - 1.61e-02 8.30e-03f 1
83 -1.8714753e+06 1.48e+03 2.76e+02 -1.0 1.54e+05 - 5.46e-02 1.17e-02f 1
84 -1.8720867e+06 1.43e+03 2.64e+02 -1.0 1.65e+05 - 2.25e-02 3.34e-02f 1
85 -1.8727810e+06 1.37e+03 2.68e+02 -1.0 1.69e+05 - 9.71e-02 3.87e-02f 1
86 -1.8730109e+06 1.35e+03 2.68e+02 -1.0 1.90e+05 - 2.61e-02 1.20e-02f 1
87 -1.8734274e+06 1.33e+03 2.59e+02 -1.0 2.89e+05 - 1.51e-03 1.96e-02f 1
88 -1.8757071e+06 1.21e+03 2.21e+02 -1.0 5.56e+05 - 1.19e-02 8.60e-02f 1
89 -1.8763253e+06 1.19e+03 2.46e+02 -1.0 6.11e+05 - 1.64e-01 2.24e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
90 -1.8784016e+06 1.12e+03 2.22e+02 -1.0 8.98e+05 - 2.43e-03 5.70e-02f 1
91 -1.8785192e+06 1.12e+03 2.54e+02 -1.0 9.30e+05 - 1.79e-01 2.85e-03f 1
92 -1.8806744e+06 1.07e+03 2.38e+02 -1.0 1.25e+06 - 4.92e-03 4.19e-02f 1
93 -1.8835752e+06 1.01e+03 2.36e+02 -1.0 1.22e+06 - 1.32e-01 5.58e-02f 1
94 -1.8853102e+06 9.79e+02 2.28e+02 -1.0 1.19e+06 - 2.37e-02 3.06e-02f 1
95 -1.8853398e+06 9.78e+02 2.29e+02 -1.0 8.03e+05 - 5.14e-03 6.37e-04f 1
96 -1.8871804e+06 9.28e+02 2.12e+02 -1.0 8.02e+05 - 1.44e-02 5.12e-02f 1
97 -1.8872109e+06 9.27e+02 2.16e+02 -1.0 4.90e+05 - 3.36e-02 9.50e-04f 1
98 -1.8884596e+06 8.87e+02 2.02e+02 -1.0 5.08e+05 - 4.46e-03 4.33e-02f 1
99 -1.8894945e+06 8.55e+02 2.11e+02 -1.0 5.10e+05 - 1.64e-01 3.61e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
100 -1.8929843e+06 7.70e+02 1.81e+02 -1.0 6.04e+05 - 1.58e-02 9.93e-02f 1
101 -1.8930264e+06 7.69e+02 1.83e+02 -1.0 5.11e+05 - 2.15e-02 1.26e-03f 1
102 -1.8938671e+06 7.45e+02 1.78e+02 -1.0 4.24e+05 - 3.87e-02 3.07e-02f 1
103 -1.8940225e+06 7.41e+02 1.79e+02 -1.0 4.49e+05 - 1.73e-02 5.61e-03f 1
104 -1.8943888e+06 7.31e+02 1.78e+02 -1.0 4.57e+05 - 2.91e-02 1.45e-02f 1
105 -1.8950550e+06 7.13e+02 1.71e+02 -1.0 4.69e+05 - 2.93e-03 2.39e-02f 1
106 -1.8952487e+06 7.08e+02 1.79e+02 -1.0 4.66e+05 - 9.17e-02 7.01e-03f 1
107 -1.8962205e+06 6.84e+02 1.73e+02 -1.0 4.84e+05 - 3.78e-02 3.39e-02f 1
108 -1.8963094e+06 6.82e+02 1.77e+02 -1.0 4.16e+05 - 3.98e-02 3.45e-03f 1
109 -1.8990666e+06 6.12e+02 1.52e+02 -1.0 4.77e+05 - 3.12e-02 1.02e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
110 -1.8991626e+06 6.10e+02 1.60e+02 -1.0 7.59e+05 - 9.13e-02 3.41e-03f 1
111 -1.8995237e+06 6.03e+02 1.68e+02 -1.0 9.06e+05 - 4.69e-02 1.22e-02f 1
112 -1.9003436e+06 5.86e+02 1.54e+02 -1.0 9.89e+05 - 2.89e-03 2.85e-02f 1
113 -1.9039700e+06 5.13e+02 1.29e+02 -1.0 1.01e+06 - 5.92e-02 1.25e-01f 1
114 -1.9040202e+06 5.12e+02 1.29e+02 -1.0 1.09e+06 - 3.23e-03 1.58e-03f 1
115 -1.9043553e+06 5.06e+02 1.75e+02 -1.0 1.09e+06 - 1.41e-01 1.18e-02f 1
116 -1.9059800e+06 4.80e+02 1.44e+02 -1.0 1.20e+06 - 1.55e-02 5.09e-02f 1
117 -1.9060862e+06 4.79e+02 1.60e+02 -1.0 1.15e+06 - 2.81e-02 3.33e-03f 1
118 -1.9075096e+06 4.59e+02 1.32e+02 -1.0 1.15e+06 - 9.74e-03 4.18e-02f 1
119 -1.9075659e+06 4.58e+02 1.75e+02 -1.0 1.10e+06 - 6.54e-02 1.81e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
120 -1.9080781e+06 4.50e+02 2.10e+02 -1.0 1.08e+06 - 7.32e-02 1.69e-02f 1
121 -1.9087399e+06 4.40e+02 2.28e+02 -1.0 1.19e+06 - 5.36e-02 2.16e-02f 1
122 -1.9089953e+06 4.36e+02 2.24e+02 -1.0 1.07e+06 - 7.12e-03 9.54e-03f 1
123 -1.9106408e+06 4.12e+02 1.73e+02 -1.0 1.08e+06 - 2.27e-03 5.59e-02f 1
124 -1.9106842e+06 4.11e+02 2.37e+02 -1.0 1.08e+06 - 8.67e-02 1.63e-03f 1
125 -1.9110147e+06 4.06e+02 2.94e+02 -1.0 1.18e+06 - 9.32e-02 1.33e-02f 1
126 -1.9122759e+06 3.84e+02 3.22e+02 -1.0 1.28e+06 - 1.08e-01 5.22e-02f 1
127 -1.9123297e+06 3.83e+02 3.90e+02 -1.0 6.12e+05 - 8.84e-02 2.97e-03f 1
128 -1.9139307e+06 3.49e+02 3.04e+02 -1.0 6.32e+05 - 2.64e-02 8.94e-02f 1
129 -1.9139643e+06 3.48e+02 3.04e+02 -1.0 6.02e+05 - 1.90e-03 1.64e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
130 -1.9143097e+06 3.43e+02 2.91e+02 -1.0 7.39e+05 - 6.96e-03 1.61e-02f 1
131 -1.9143241e+06 3.42e+02 3.34e+02 -1.0 5.96e+05 - 4.88e-02 1.08e-03f 1
132 -1.9145398e+06 3.36e+02 3.39e+02 -1.0 6.40e+05 - 3.14e-02 1.82e-02f 1
133 -1.9148257e+06 3.28e+02 3.37e+02 -1.0 6.60e+05 - 3.22e-02 2.58e-02f 1
134 -1.9166487e+06 2.75e+02 1.59e+02 -1.0 6.90e+05 - 2.79e-02 1.59e-01f 1
135 -1.9179446e+06 2.45e+02 3.82e+02 -1.0 7.14e+05 - 3.24e-01 1.11e-01f 1
136 -1.9179911e+06 2.44e+02 6.07e+02 -1.0 9.24e+05 - 1.82e-01 3.13e-03f 1
137 -1.9181221e+06 2.38e+02 6.94e+02 -1.0 5.03e+05 - 1.04e-01 2.40e-02f 1
138 -1.9186074e+06 2.19e+02 5.44e+02 -1.0 5.25e+05 - 9.17e-03 8.10e-02f 1
139 -1.9193231e+06 1.96e+02 3.51e+02 -1.0 5.08e+05 - 1.14e-02 1.07e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
140 -1.9215209e+06 1.32e+02 2.18e+02 -1.0 6.35e+05 - 1.05e-01 3.26e-01f 1
141 -1.9225131e+06 1.07e+02 3.21e+02 -1.0 4.98e+05 - 9.05e-02 1.87e-01f 1
142 -1.9226499e+06 1.03e+02 1.46e+02 -1.0 4.83e+05 - 1.67e-01 3.40e-02f 1
143 -1.9229246e+06 9.65e+01 1.70e+02 -1.0 5.41e+05 - 1.31e-02 6.77e-02f 1
144 -1.9236179e+06 7.86e+01 3.15e+02 -1.0 5.12e+05 - 1.11e-01 1.85e-01f 1
145 -1.9242863e+06 6.28e+01 8.20e+02 -1.0 3.45e+05 - 5.73e-02 2.01e-01f 1
146 -1.9247929e+06 5.26e+01 1.28e+03 -1.0 8.10e+05 - 4.30e-02 1.63e-01f 1
147 -1.9252172e+06 4.45e+01 1.59e+03 -1.0 7.66e+05 - 6.77e-02 1.53e-01f 1
148 -1.9254054e+06 4.04e+01 4.18e+02 -1.0 2.23e+05 - 2.39e-01 9.25e-02f 1
149 -1.9255319e+06 3.77e+01 1.03e+03 -1.0 2.28e+05 - 2.51e-01 6.67e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
150 -1.9261060e+06 3.06e+01 3.81e+02 -1.0 8.91e+05 - 4.08e-02 1.89e-01f 1
151 -1.9262098e+06 2.84e+01 7.43e+02 -1.0 3.46e+05 - 3.19e-02 7.02e-02f 1
152 -1.9265706e+06 2.22e+01 4.50e+03 -1.0 6.23e+05 - 4.03e-03 2.21e-01f 1
153 -1.9265812e+06 2.20e+01 4.35e+03 -1.0 3.18e+05 - 1.26e-01 7.82e-03f 1
154 -1.9270707e+06 1.47e+01 4.83e+03 -1.0 3.98e+05 - 4.72e-02 3.30e-01f 1
155 -1.9273092e+06 1.18e+01 6.46e+03 -1.0 4.44e+05 - 7.32e-02 1.96e-01f 1
156 -1.9275940e+06 8.68e+00 7.84e+03 -1.0 4.05e+05 - 1.48e-01 2.67e-01f 1
157 -1.9277279e+06 7.42e+00 7.70e+03 -1.0 3.19e+05 - 1.17e-01 1.45e-01f 1
158 -1.9279944e+06 5.24e+00 1.16e+04 -1.0 3.55e+05 - 1.45e-01 2.94e-01f 1
159 -1.9281196e+06 4.42e+00 7.14e+03 -1.0 3.14e+05 - 2.02e-01 1.56e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
160 -1.9282868e+06 3.52e+00 1.84e+04 -1.0 3.97e+05 - 2.02e-02 2.04e-01f 1
161 -1.9286027e+06 2.00e+00 4.71e+04 -1.0 4.05e+05 - 1.17e-02 4.33e-01f 1
162 -1.9286178e+06 1.94e+00 8.63e+03 -1.0 3.48e+05 - 2.73e-01 2.92e-02f 1
163 -1.9289712e+06 7.75e-01 5.97e+04 -1.0 4.59e+05 - 2.40e-01 6.00e-01f 1
164 -1.9290507e+06 6.53e-01 3.94e+04 -1.0 4.86e+05 - 1.86e-01 1.58e-01f 1
165 -1.9290673e+06 6.14e-01 4.38e+04 -1.0 4.68e+05 - 2.41e-01 5.95e-02f 1
166 -1.9291499e+06 4.56e-01 5.98e+04 -1.0 5.01e+05 - 6.06e-02 2.58e-01f 1
167 -1.9291943e+06 3.32e-01 1.08e+05 -1.0 2.25e+05 - 1.68e-01 2.72e-01f 1
168 -1.9292324e+06 2.59e-01 2.29e+05 -1.0 2.75e+05 - 4.28e-02 2.19e-01f 1
169 -1.9292887e+06 1.71e-01 2.65e+05 -1.0 2.83e+05 - 2.28e-01 3.40e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
170 -1.9293128e+06 1.39e-01 2.25e+05 -1.0 3.54e+05 - 1.79e-01 1.85e-01f 1
171 -1.9293360e+06 1.06e-01 5.43e+05 -1.0 3.20e+05 - 1.34e-02 2.39e-01f 1
172 -1.9293483e+06 7.91e-02 8.89e+05 -1.0 1.85e+05 - 1.75e-02 2.54e-01f 1
173 -1.9293577e+06 5.64e-02 3.78e+05 -1.0 1.81e+05 - 6.86e-01 2.87e-01f 1
174 -1.9293743e+06 2.60e-02 7.07e+05 -1.0 2.10e+05 - 1.97e-01 5.40e-01f 1
175 -1.9293758e+06 2.11e-02 1.06e+06 -1.0 7.85e+04 - 5.62e-02 1.89e-01f 3
176 -1.9293812e+06 2.30e-03 2.35e+05 -1.0 5.86e+04 - 9.81e-01 8.91e-01h 1
177 -1.9293809e+06 1.15e-03 1.38e+06 -1.0 3.56e+04 - 1.00e+00 5.00e-01f 2
178 -1.9293810e+06 4.66e-10 1.00e-06 -1.0 9.78e+03 - 1.00e+00 1.00e+00h 1
179 -1.9294206e+06 3.49e-10 6.96e+04 -5.7 8.46e+04 - 6.34e-01 6.41e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
180 -1.9294400e+06 3.49e-10 6.22e+05 -5.7 9.70e+04 - 6.78e-01 8.45e-01f 1
181 -1.9294434e+06 3.49e-10 9.83e+04 -5.7 1.48e+04 - 8.94e-01 9.52e-01f 1
182 -1.9294436e+06 3.49e-10 1.02e+05 -5.7 1.22e+03 - 1.83e-01 9.96e-01f 1
183 -1.9294436e+06 3.49e-10 2.18e-11 -5.7 6.57e+00 - 1.00e+00 1.00e+00f 1
184 -1.9294436e+06 3.49e-10 9.65e+00 -7.0 2.46e+00 - 1.00e+00 9.45e-01f 1
185 -1.9294436e+06 4.66e-10 9.09e-13 -7.0 1.34e-01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 185
(scaled) (unscaled)
Objective...............: -1.9294436292570301e+06 -1.9294436292570301e+06
Dual infeasibility......: 9.0949470177292824e-13 9.0949470177292824e-13
Constraint violation....: 5.8207660913467407e-11 4.6566128730773926e-10
Complementarity.........: 4.5550859922290215e-07 4.5550859922290215e-07
Overall NLP error.......: 4.5550859922290215e-07 4.5550859922290215e-07
Number of objective function evaluations = 189
Number of objective gradient evaluations = 186
Number of equality constraint evaluations = 189
Number of inequality constraint evaluations = 189
Number of equality constraint Jacobian evaluations = 186
Number of inequality constraint Jacobian evaluations = 186
Number of Lagrangian Hessian evaluations = 185
Total CPU secs in IPOPT (w/o function evaluations) = 1.611
Total CPU secs in NLP function evaluations = 0.067
EXIT: Optimal Solution Found.
Pyomo model construction time: 10.06
Pyomo model solve time: 31.066909551620483
Deterministic RUC Cost: 3345121.82
Generator Commitments:
101_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
101_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
101_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
101_STEAM_4 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
102_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
102_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
102_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
102_STEAM_4 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
107_CC_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 | 0 0 0 0 0 0 0 0 0 0 0 0
113_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
113_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
113_CT_3 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
113_CT_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
115_STEAM_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
115_STEAM_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
115_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
116_STEAM_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
118_CC_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 | 0 0 0 0 0 0 0 0 0 0 0 0
123_STEAM_2 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
123_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
123_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
123_CT_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
123_CT_5 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
201_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
201_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
201_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
202_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
202_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
202_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
202_STEAM_4 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
207_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
207_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
213_CC_3 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
213_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
213_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
215_CT_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
215_CT_5 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
216_STEAM_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
218_CC_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
221_CC_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
223_STEAM_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
223_STEAM_2 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
223_STEAM_3 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
223_CT_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
223_CT_5 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
223_CT_6 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
301_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
301_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
301_CT_3 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
301_CT_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
302_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
302_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
302_CT_3 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
302_CT_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
307_CT_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
307_CT_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
313_CC_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_STEAM_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_STEAM_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_STEAM_3 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_STEAM_4 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_STEAM_5 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_CT_6 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_CT_7 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
315_CT_8 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
316_STEAM_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
318_CC_1 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
321_CC_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 | 0 0 0 0 0 0 0 0 0 0 0 0
322_CT_5 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
322_CT_6 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
323_CC_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
323_CC_2 : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
114_SYNC_COND_1: 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
121_NUCLEAR_1 : 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | 1 1 1 1 1 1 1 1 1 1 1 1
214_SYNC_COND_1: 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
314_SYNC_COND_1: 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0 0 0
Generator Dispatch Levels:
101_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
101_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
101_STEAM_3 : 76.00 76.00 76.00 76.00 76.00 76.00 45.30 45.30 45.30 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 | 76.00 76.00 76.00 76.00 76.00 56.00 60.70 57.30 55.30 45.30 60.70 76.00
101_STEAM_4 : 76.00 76.00 76.00 76.00 76.00 76.00 45.30 45.30 45.30 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 | 76.00 76.00 76.00 76.00 76.00 52.00 47.30 60.70 60.70 45.30 60.70 76.00
102_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
102_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
102_STEAM_3 : 76.00 76.00 76.00 60.70 60.70 45.30 30.00 32.97 30.00 41.72 45.30 60.70 60.70 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 | 76.00 60.70 60.70 45.30 45.30 40.00 38.67 40.00 40.00 30.00 30.00 45.30
102_STEAM_4 : 76.00 76.00 76.00 60.70 60.70 45.30 36.30 30.00 35.97 30.00 45.30 60.70 60.70 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 | 76.00 60.70 60.70 45.30 45.30 40.00 40.00 40.00 40.00 30.00 30.00 45.30
107_CC_1 : 231.70 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 182.36 231.70 231.70 293.30 355.00 355.00 355.00 338.28 231.70 170.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
115_STEAM_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
115_STEAM_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
115_STEAM_3 : 124.00 124.00 124.00 93.00 93.00 62.00 62.00 62.00 62.00 62.00 62.00 93.00 118.56 124.00 124.00 124.00 155.00 155.00 155.00 155.00 155.00 124.00 124.00 124.00 | 124.00 93.00 93.00 62.00 62.00 62.00 62.00 62.00 62.00 62.00 62.00 62.00
116_STEAM_1 : 139.76 124.00 124.00 124.00 93.00 62.00 62.00 62.00 62.00 62.00 93.00 93.00 124.00 124.00 124.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 124.00 | 124.00 124.00 93.00 93.00 62.00 62.00 62.00 62.00 62.00 62.00 62.00 93.00
118_CC_1 : 231.70 231.70 231.70 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 231.70 231.70 231.70 260.09 317.98 313.60 305.05 293.30 231.70 170.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
123_STEAM_2 : 124.00 124.00 93.00 93.00 93.00 62.00 62.00 62.00 62.00 62.00 93.00 93.00 93.00 124.00 124.00 124.00 124.00 125.00 125.00 124.00 124.00 124.00 124.00 124.00 | 124.00 93.00 93.00 93.00 62.00 62.00 62.00 62.00 62.00 62.00 70.48 93.00
123_STEAM_3 : 350.00 280.00 280.00 280.00 210.00 140.00 140.00 140.00 140.00 140.00 140.00 210.00 280.00 280.00 294.25 350.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 | 280.00 235.69 210.00 140.00 140.00 140.00 140.00 140.00 140.00 140.00 140.00 210.00
123_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
123_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
123_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
201_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
201_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
201_STEAM_3 : 60.70 45.30 45.30 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 45.30 45.30 45.30 76.00 76.00 76.00 76.00 76.00 76.00 76.00 76.00 51.45 | 45.30 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00
202_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 8.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
202_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
202_STEAM_3 : 60.70 60.70 60.70 60.70 30.61 30.00 30.00 30.00 30.00 30.00 30.00 45.30 60.70 60.70 60.70 60.70 72.46 69.36 60.70 75.27 76.00 60.70 60.70 60.70 | 60.70 60.70 45.30 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 40.00
202_STEAM_4 : 60.70 60.70 60.70 60.70 45.30 30.00 30.00 30.00 30.00 30.00 30.00 45.30 60.70 60.70 60.70 60.70 60.70 76.00 75.23 60.70 62.09 60.70 60.70 60.70 | 60.70 60.70 45.30 30.00 30.00 30.00 30.00 30.00 30.00 30.00 30.00 36.76
207_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
207_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
213_CC_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
213_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
213_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
215_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
215_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
216_STEAM_1 : 155.00 124.00 124.00 122.19 93.00 93.00 62.00 62.00 62.00 62.00 93.00 93.00 124.00 124.00 124.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 124.00 | 124.00 93.00 93.00 93.00 93.00 64.00 62.00 65.67 68.67 62.00 93.00 93.00
218_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
221_CC_1 : 231.70 230.29 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 231.70 231.70 231.70 293.30 293.30 293.30 293.30 293.30 274.21 232.41 231.70 | 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00
223_STEAM_1 : 155.00 155.00 155.00 155.00 155.00 62.00 62.00 62.00 62.00 62.00 124.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 | 155.00 155.00 155.00 119.59 69.81 62.00 62.00 62.00 62.00 66.00 155.00 155.00
223_STEAM_2 : 155.00 155.00 155.00 155.00 155.00 71.77 62.00 62.00 62.00 62.00 120.42 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 155.00 | 155.00 155.00 155.00 124.00 93.00 62.00 62.00 62.00 62.00 77.00 155.00 155.00
223_STEAM_3 : 280.00 280.00 210.00 210.00 210.00 210.00 140.00 140.00 140.00 140.00 210.00 210.00 210.00 280.00 280.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 350.00 280.00 | 211.76 210.00 210.00 210.00 210.00 140.00 140.00 140.00 140.00 200.67 210.00 210.00
223_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
223_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
223_CT_6 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
307_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
307_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
313_CC_1 : 231.70 231.70 231.70 231.70 231.70 231.70 208.10 218.10 216.10 231.70 231.70 231.70 231.70 231.70 231.70 231.70 293.30 312.14 313.60 293.30 293.30 170.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_CT_6 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_CT_7 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_CT_8 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 22.00 45.46 48.35 44.00 22.00 22.00 22.00 | 22.00 22.00 22.00 22.00 22.00 22.00 22.00 22.00 22.00 22.00 22.00 22.00
316_STEAM_1 : 124.00 124.00 124.00 124.00 62.00 62.00 62.00 62.00 62.00 62.00 62.00 87.06 124.00 124.00 124.00 124.00 155.00 155.00 155.00 155.00 155.00 124.00 124.00 124.00 | 124.00 124.00 93.31 62.00 62.00 62.00 62.00 62.00 62.00 62.00 62.00 62.00
318_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
321_CC_1 : 231.70 231.70 208.91 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 231.70 231.70 235.28 293.30 293.30 303.77 293.30 293.30 293.30 170.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
322_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
322_CT_6 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
323_CC_1 : 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 170.00 231.70 355.00 355.00 355.00 170.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
323_CC_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
114_SYNC_COND_1: 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
121_NUCLEAR_1 : 400.00 400.00 400.00 400.00 500.00 400.00 400.00 408.33 408.33 450.00 450.00 500.00 500.00 450.00 450.00 450.00 450.00 483.33 450.00 483.33 500.00 400.00 450.00 450.00 | 450.00 450.00 400.00 450.00 450.00 400.00 408.33 408.33 408.33 400.00 400.00 400.00
214_SYNC_COND_1: 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
314_SYNC_COND_1: 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
Generator Reserve Headroom:
101_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
101_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
101_STEAM_3 : 0.00 0.00 0.00 0.00 0.00 0.00 30.70 30.70 30.70 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 20.00 15.30 18.70 20.70 30.70 15.30 0.00
101_STEAM_4 : 0.00 0.00 0.00 0.00 0.00 0.00 30.70 30.70 30.70 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 24.00 28.70 15.30 15.30 30.70 15.30 0.00
102_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
102_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
102_STEAM_3 : 0.00 0.00 0.00 15.30 15.30 30.70 46.00 43.03 46.00 34.28 30.70 15.30 15.30 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 15.30 15.30 30.70 30.70 36.00 37.33 36.00 36.00 46.00 46.00 30.70
102_STEAM_4 : 0.00 0.00 0.00 15.30 15.30 30.70 39.70 46.00 40.03 46.00 30.70 15.30 15.30 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 15.30 15.30 30.70 30.70 36.00 36.00 36.00 36.00 46.00 46.00 30.70
107_CC_1 : 123.30 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 172.64 123.30 123.30 61.70 0.00 0.00 0.00 16.72 123.30 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
113_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
115_STEAM_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
115_STEAM_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
115_STEAM_3 : 31.00 31.00 31.00 62.00 62.00 93.00 93.00 93.00 93.00 93.00 93.00 62.00 36.44 31.00 31.00 31.00 0.00 0.00 0.00 0.00 0.00 31.00 31.00 31.00 | 31.00 62.00 62.00 93.00 93.00 93.00 93.00 93.00 93.00 93.00 93.00 93.00
116_STEAM_1 : 15.24 31.00 31.00 31.00 62.00 93.00 93.00 93.00 93.00 93.00 62.00 62.00 31.00 31.00 31.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 31.00 | 31.00 31.00 62.00 62.00 93.00 93.00 93.00 93.00 93.00 93.00 93.00 62.00
118_CC_1 : 123.30 123.30 123.30 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 123.30 123.30 123.30 94.91 37.02 41.40 49.95 61.70 123.30 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
123_STEAM_2 : 31.00 31.00 62.00 62.00 62.00 93.00 93.00 93.00 93.00 93.00 62.00 62.00 62.00 31.00 31.00 31.00 31.00 30.00 30.00 31.00 31.00 31.00 31.00 31.00 | 31.00 62.00 62.00 62.00 93.00 93.00 93.00 93.00 93.00 93.00 84.52 62.00
123_STEAM_3 : 0.00 70.00 70.00 70.00 140.00 210.00 210.00 210.00 210.00 210.00 210.00 140.00 70.00 70.00 55.75 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 70.00 114.31 140.00 210.00 210.00 210.00 210.00 210.00 210.00 210.00 210.00 140.00
123_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
123_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
123_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
201_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
201_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
201_STEAM_3 : 15.30 30.70 30.70 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 30.70 30.70 30.70 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 24.55 | 30.70 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00
202_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
202_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
202_STEAM_3 : 15.30 15.30 15.30 15.30 45.39 46.00 46.00 46.00 46.00 46.00 46.00 30.70 15.30 15.30 15.30 15.30 3.54 6.64 15.30 0.73 0.00 15.30 15.30 15.30 | 15.30 15.30 30.70 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 36.00
202_STEAM_4 : 15.30 15.30 15.30 15.30 30.70 46.00 46.00 46.00 46.00 46.00 46.00 30.70 15.30 15.30 15.30 15.30 15.30 0.00 0.77 15.30 13.91 15.30 15.30 15.30 | 15.30 15.30 30.70 46.00 46.00 46.00 46.00 46.00 46.00 46.00 46.00 39.24
207_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
207_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
213_CC_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
213_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
213_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
215_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
215_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
216_STEAM_1 : 0.00 31.00 31.00 32.81 62.00 62.00 93.00 93.00 93.00 93.00 62.00 62.00 31.00 31.00 31.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 31.00 | 31.00 62.00 62.00 62.00 62.00 91.00 93.00 89.33 86.33 93.00 62.00 62.00
218_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
221_CC_1 : 123.30 124.71 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 123.30 123.30 123.30 61.70 61.70 61.70 61.70 61.70 80.79 122.59 123.30 | 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00
223_STEAM_1 : 0.00 0.00 0.00 0.00 0.00 93.00 93.00 93.00 93.00 93.00 31.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 35.41 85.19 93.00 93.00 93.00 93.00 89.00 0.00 0.00
223_STEAM_2 : 0.00 0.00 0.00 0.00 0.00 83.23 93.00 93.00 93.00 93.00 34.58 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 31.00 62.00 93.00 93.00 93.00 93.00 78.00 0.00 0.00
223_STEAM_3 : 70.00 70.00 140.00 140.00 140.00 140.00 210.00 210.00 210.00 210.00 140.00 140.00 140.00 70.00 70.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 70.00 | 138.24 140.00 140.00 140.00 140.00 210.00 210.00 210.00 210.00 149.33 140.00 140.00
223_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
223_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
223_CT_6 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
301_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
302_CT_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
307_CT_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
307_CT_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
313_CC_1 : 123.30 123.30 123.30 123.30 123.30 123.30 146.90 136.90 138.90 123.30 123.30 123.30 123.30 123.30 123.30 123.30 61.70 42.86 41.40 61.70 61.70 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_3 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_4 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_STEAM_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_CT_6 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_CT_7 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
315_CT_8 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 9.54 6.65 11.00 33.00 33.00 33.00 | 33.00 33.00 33.00 33.00 33.00 33.00 33.00 33.00 33.00 33.00 33.00 33.00
316_STEAM_1 : 31.00 31.00 31.00 31.00 93.00 93.00 93.00 93.00 93.00 93.00 93.00 67.94 31.00 31.00 31.00 31.00 0.00 0.00 0.00 0.00 0.00 31.00 31.00 31.00 | 31.00 31.00 61.69 93.00 93.00 93.00 93.00 93.00 93.00 93.00 93.00 93.00
318_CC_1 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
321_CC_1 : 123.30 123.30 146.09 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 123.30 123.30 119.72 61.70 61.70 51.23 61.70 61.70 61.70 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
322_CT_5 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
322_CT_6 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
323_CC_1 : 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 185.00 123.30 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
323_CC_2 : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
114_SYNC_COND_1: 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
121_NUCLEAR_1 : 100.00 100.00 100.00 100.00 0.00 100.00 100.00 91.67 91.67 50.00 50.00 0.00 0.00 50.00 50.00 50.00 50.00 16.67 50.00 16.67 0.00 100.00 50.00 50.00 | 50.00 50.00 100.00 50.00 50.00 100.00 91.67 91.67 91.67 100.00 100.00 100.00
214_SYNC_COND_1: 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
314_SYNC_COND_1: 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
Total : 1125.64 1320.91 1504.99 1684.31 1821.99 2307.93 2528.00 2513.00 2512.00 2387.58 2085.28 1782.24 1541.64 1257.14 1193.55 971.52 564.85 256.58 301.34 305.39 319.43 645.69 329.19 486.45 | 692.54 877.51 1045.69 1255.81 1398.59 1641.00 1636.00 1621.00 1620.00 1600.73 1354.12 1152.64
Fixed costs: 2311084.74
Variable costs: 1034037.08
Renewables curtailment summary (time-period, aggregate_quantity):
2020-07-12 06:00 115.53
2020-07-12 07:00 232.64
2020-07-12 08:00 154.75
2020-07-13 05:00 249.03
2020-07-13 06:00 574.43
2020-07-13 07:00 669.54
2020-07-13 08:00 639.15
2020-07-13 09:00 379.75
2020-07-13 10:00 323.86
2020-07-13 11:00 222.51
2020-07-13 12:00 125.91
2020-07-13 13:00 41.98
Solving day-ahead market
Computing day-ahead prices using method LMP.
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 6.4516047e+03 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 6.4102979e+03 1.64e+05 9.90e+01 -1.0 2.53e+04 - 2.02e-04 1.94e-04h 1
2 1.0357577e+04 1.64e+05 9.99e+01 -1.0 2.47e+04 - 2.15e-04 9.72e-04h 1
3 1.9835143e+04 1.63e+05 1.01e+02 -1.0 1.47e+04 - 8.30e-04 2.11e-03h 1
4 8.0262174e+04 1.61e+05 1.03e+02 -1.0 3.86e+03 - 2.53e-03 1.28e-02h 1
5 3.5623976e+05 1.52e+05 1.05e+02 -1.0 1.36e+03 - 1.75e-02 5.83e-02h 1
6 5.3858281e+05 1.46e+05 8.84e+01 -1.0 2.05e+03 - 1.03e-01 4.11e-02h 1
7 2.8041806e+06 6.81e+04 9.99e+01 -1.0 2.63e+03 - 1.96e-01 5.32e-01h 1
8 3.5743499e+06 4.13e+04 3.91e+01 -1.0 3.28e+03 - 5.47e-01 3.93e-01h 1
9 4.6774308e+06 4.13e+02 3.26e+02 -1.0 7.18e+03 - 1.83e-01 9.90e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 4.5764618e+06 3.97e+00 1.95e+03 -1.0 8.30e+03 - 4.99e-01 9.90e-01f 1
11 4.4049867e+06 5.82e-11 3.20e+05 -1.0 1.32e+04 - 1.93e-01 1.00e+00f 1
12 4.2627875e+06 5.82e-11 8.56e+06 -1.0 9.99e+03 - 1.37e-01 1.00e+00f 1
13 3.4537852e+06 5.82e-11 8.49e+06 -1.0 3.13e+04 - 8.96e-03 5.18e-01f 1
14 3.4453059e+06 1.16e-10 7.05e+06 -1.0 7.76e+04 - 1.69e-01 2.16e-03f 1
15 3.3966568e+06 1.16e-10 3.48e+05 -1.0 8.20e+04 - 9.51e-01 1.45e-02f 1
16 1.2955162e+06 2.33e-10 2.71e+05 -1.0 9.21e+04 - 2.23e-01 5.56e-01f 1
17 1.2742239e+06 1.16e-10 1.25e+05 -1.0 2.74e+04 - 5.39e-01 1.89e-02f 1
18 1.2680507e+06 1.16e-10 1.24e+05 -1.0 1.03e+04 - 2.72e-03 1.34e-01f 1
19 9.3657422e+05 5.82e-11 1.01e+05 -1.0 3.36e+05 - 1.92e-01 8.35e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 8.9630754e+05 2.33e-10 1.00e+05 -1.0 7.87e+04 - 2.88e-03 4.42e-01f 1
21 6.1906824e+05 1.16e-10 8.35e+04 -1.0 3.64e+05 - 1.67e-01 6.90e-01f 1
22 4.3388960e+05 1.16e-10 8.31e+04 -1.0 2.31e+05 - 3.70e-03 7.28e-01f 1
23 3.0120250e+05 1.16e-10 7.13e+04 -1.0 2.12e+05 - 1.43e-01 5.70e-01f 1
24 1.7120029e+03 1.16e-10 7.07e+04 -1.0 4.11e+05 - 7.44e-03 6.63e-01f 1
25 -9.8417037e+03 1.16e-10 1.54e+04 -1.0 2.24e+04 - 7.82e-01 4.72e-01f 1
26 -9.9813597e+03 5.82e-11 4.62e+03 -1.0 3.75e+03 - 7.00e-01 1.00e+00f 1
27 -9.9500973e+03 1.16e-10 2.69e+03 -1.0 6.92e+03 - 4.17e-01 1.00e+00f 1
28 -9.9410108e+03 1.16e-10 6.01e+02 -1.0 1.21e+04 - 7.77e-01 1.00e+00f 1
29 -1.0460638e+04 1.16e-10 1.83e+06 -1.7 9.21e+03 - 7.71e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -1.0462704e+04 2.33e-10 2.05e+05 -1.7 3.54e+04 - 8.88e-01 1.00e+00f 1
31 -1.0452970e+04 1.16e-10 1.06e+05 -1.7 1.18e+05 - 4.82e-01 1.00e+00f 1
32 -1.0445953e+04 1.16e-10 2.00e-07 -1.7 9.13e+04 - 1.00e+00 1.00e+00f 1
33 -1.0595730e+04 2.33e-10 7.52e+05 -5.7 1.21e+05 - 6.22e-01 9.98e-01f 1
34 -1.0601783e+04 2.33e-10 2.23e+05 -5.7 1.30e+05 - 7.03e-01 5.41e-01f 1
35 -1.0604993e+04 1.16e-10 6.33e+04 -5.7 6.62e+04 - 7.15e-01 6.24e-01f 1
36 -1.0607395e+04 1.16e-10 1.86e+03 -5.7 4.73e+04 - 9.71e-01 9.96e-01f 1
37 -1.0607408e+04 1.16e-10 1.85e-11 -5.7 2.76e+02 - 1.00e+00 1.00e+00f 1
38 -1.0607422e+04 1.16e-10 9.38e-13 -7.0 6.22e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 38
(scaled) (unscaled)
Objective...............: -1.0607422016272744e+02 -1.0607422016272743e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.4137859740721684e-07 1.4137859740721683e-05
Overall NLP error.......: 1.4137859740721684e-07 1.4137859740721683e-05
Number of objective function evaluations = 39
Number of objective gradient evaluations = 39
Number of equality constraint evaluations = 39
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 39
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 38
Total CPU secs in IPOPT (w/o function evaluations) = 0.043
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 65712.44
Variable costs: 41719.65
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 237.11
Simulating time_step 2020-07-11 17:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -8.0121574e+03 1.51e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -8.0537600e+03 1.51e+05 9.90e+01 -1.0 6.66e+03 - 2.02e-04 1.94e-04h 1
2 -6.0998776e+03 1.51e+05 1.00e+02 -1.0 6.88e+03 - 1.94e-04 8.73e-04h 1
3 -1.0721869e+03 1.51e+05 1.00e+02 -1.0 6.82e+03 - 1.07e-03 2.08e-03h 1
4 1.6500546e+04 1.50e+05 1.01e+02 -1.0 3.52e+03 - 2.37e-03 6.93e-03h 1
5 6.6104109e+04 1.47e+05 1.00e+02 -1.0 1.32e+03 - 1.20e-02 1.89e-02h 1
6 2.0421462e+05 1.39e+05 9.10e+01 -1.0 1.34e+03 - 1.63e-01 5.32e-02h 1
7 1.0803254e+06 8.95e+04 9.04e+01 -1.0 1.57e+03 - 1.00e-01 3.57e-01h 1
8 1.9286238e+06 4.10e+04 3.03e+01 -1.0 1.69e+03 - 6.18e-01 5.42e-01h 1
9 2.6007576e+06 4.10e+02 4.56e+01 -1.0 3.70e+03 - 1.83e-01 9.90e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.5590102e+06 3.95e+00 1.95e+03 -1.0 3.40e+03 - 4.61e-01 9.90e-01f 1
11 2.4603640e+06 1.16e-10 3.10e+05 -1.0 5.51e+03 - 1.60e-01 1.00e+00f 1
12 2.1809916e+06 1.16e-10 8.61e+06 -1.0 2.46e+04 - 1.34e-01 1.00e+00f 1
13 1.0965311e+06 1.16e-10 8.54e+06 -1.0 5.12e+04 - 8.80e-03 7.20e-01f 1
14 1.0670796e+06 1.16e-10 6.76e+06 -1.0 6.36e+04 - 2.09e-01 2.00e-02f 1
15 7.7024248e+05 1.16e-10 3.97e+06 -1.0 6.41e+04 - 4.12e-01 2.16e-01f 1
16 7.6697166e+05 2.33e-10 3.32e+06 -1.0 9.83e+04 - 1.64e-01 2.79e-03f 1
17 7.4394363e+05 1.95e-10 6.98e+05 -1.0 1.12e+05 - 7.90e-01 3.32e-02f 1
18 4.5447983e+05 1.41e-10 6.49e+05 -1.0 2.59e+05 - 6.99e-02 3.15e-01f 1
19 4.4766723e+05 2.33e-10 2.54e+05 -1.0 1.48e+05 - 6.09e-01 2.01e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 3.0479241e+05 1.16e-10 2.51e+05 -1.0 1.07e+05 - 1.22e-02 7.13e-01f 1
21 2.9941729e+05 1.16e-10 2.47e+05 -1.0 2.38e+05 - 1.63e-02 2.01e-02f 1
22 2.8843705e+05 1.16e-10 1.05e+05 -1.0 2.12e+05 - 5.73e-01 4.60e-02f 1
23 1.9567169e+05 1.16e-10 1.02e+05 -1.0 4.56e+05 - 3.46e-02 1.83e-01f 1
24 1.9413073e+05 1.16e-10 4.72e+04 -1.0 3.30e+05 - 5.36e-01 4.20e-03f 1
25 -8.2892964e+03 2.33e-10 2.21e+04 -1.0 2.65e+05 - 5.33e-01 6.90e-01f 1
26 -1.1290060e+04 1.16e-10 2.08e+04 -1.0 5.42e+04 - 5.74e-02 7.59e-01f 1
27 -1.3563376e+04 1.75e-10 4.96e+03 -1.0 2.57e+05 - 7.62e-01 1.00e+00f 1
28 -1.6148830e+04 2.33e-10 3.21e+03 -1.0 6.04e+05 - 3.52e-01 5.30e-01f 1
29 -1.6161625e+04 2.33e-10 1.34e+03 -1.0 1.67e+05 - 9.18e-01 9.50e-03f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -1.6524294e+04 1.16e-10 9.82e+05 -1.7 2.04e+04 - 5.67e-01 6.90e-01f 1
31 -1.6674037e+04 1.16e-10 2.02e+06 -1.7 4.03e+04 - 4.16e-01 1.00e+00f 1
32 -1.6670650e+04 2.33e-10 2.24e+05 -1.7 5.18e+04 - 8.89e-01 1.00e+00f 1
33 -1.6655690e+04 2.33e-10 1.06e+05 -1.7 1.87e+05 - 5.26e-01 1.00e+00f 1
34 -1.6650196e+04 1.16e-10 2.00e-07 -1.7 6.38e+04 - 1.00e+00 1.00e+00f 1
35 -1.6807269e+04 2.33e-10 9.23e+05 -5.7 1.92e+05 - 5.37e-01 9.98e-01f 1
36 -1.6813984e+04 2.33e-10 6.91e+04 -5.7 1.74e+05 - 9.24e-01 5.79e-01f 1
37 -1.6816356e+04 1.16e-10 2.45e+04 -5.7 5.97e+04 - 6.45e-01 6.52e-01f 1
38 -1.6818029e+04 2.33e-10 2.37e+02 -5.7 4.40e+04 - 9.89e-01 9.23e-01f 1
39 -1.6818163e+04 2.33e-10 1.85e-11 -5.7 3.41e+03 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -1.6818177e+04 1.16e-10 9.24e-13 -7.0 6.24e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 40
(scaled) (unscaled)
Objective...............: -1.6818176830295303e+02 -1.6818176830295302e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 3.2337589396370780e-12 1.1641532182693481e-10
Complementarity.........: 1.2653391076660310e-07 1.2653391076660309e-05
Overall NLP error.......: 1.2653391076660310e-07 1.2653391076660309e-05
Number of objective function evaluations = 43
Number of objective gradient evaluations = 41
Number of equality constraint evaluations = 43
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 41
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 40
Total CPU secs in IPOPT (w/o function evaluations) = 0.029
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 64336.44
Variable costs: 45890.16
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 241.93
Simulating time_step 2020-07-11 18:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -1.4172512e+04 6.29e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.4214360e+04 6.28e+03 9.90e+01 -1.0 6.66e+03 - 2.02e-04 1.94e-04h 1
2 -8.9914878e+03 6.27e+03 9.98e+01 -1.0 6.88e+03 - 1.94e-04 1.83e-03h 1
3 1.0899812e+04 6.23e+03 1.02e+02 -1.0 6.78e+03 - 2.02e-03 6.68e-03h 1
4 6.3635987e+04 6.13e+03 1.01e+02 -1.0 1.33e+03 - 1.06e-02 1.69e-02h 1
5 2.0713630e+05 5.84e+03 9.20e+01 -1.0 1.33e+03 - 6.69e-01 4.64e-02h 1
6 3.0906388e+06 5.84e+01 8.33e+01 -1.0 3.58e+03 - 9.23e-02 9.90e-01h 1
7 3.0781478e+06 5.78e-01 8.04e+02 -1.0 3.15e+03 - 2.43e-01 9.90e-01f 1
8 3.0314265e+06 1.16e-10 5.98e+04 -1.0 3.05e+03 - 4.45e-01 1.00e+00f 1
9 2.9313872e+06 2.33e-10 7.87e+06 -1.0 6.34e+03 - 2.09e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.7695437e+06 2.33e-10 7.24e+06 -1.0 3.23e+04 - 8.05e-02 4.53e-01f 1
11 1.7469033e+06 1.16e-10 7.17e+06 -1.0 5.19e+04 - 8.83e-03 9.22e-01f 1
12 1.7240160e+06 1.16e-10 5.05e+06 -1.0 5.15e+04 - 2.96e-01 2.72e-02f 1
13 1.4308624e+06 1.16e-10 3.45e+06 -1.0 7.76e+04 - 3.17e-01 3.66e-01f 1
14 1.4247936e+06 1.16e-10 2.47e+06 -1.0 1.04e+05 - 2.83e-01 1.07e-02f 1
15 1.2752268e+06 1.16e-10 5.27e+05 -1.0 1.48e+05 - 7.87e-01 2.90e-01f 1
16 3.4783597e+05 1.16e-10 4.45e+05 -1.0 1.22e+06 - 1.55e-01 4.77e-01f 1
17 3.2686654e+05 1.16e-10 3.78e+05 -1.0 2.58e+04 - 1.50e-01 2.21e-01f 1
18 3.1994742e+05 1.16e-10 3.77e+05 -1.0 5.17e+04 - 2.33e-03 7.23e-02f 1
19 3.1284773e+05 1.64e-10 1.43e+05 -1.0 1.71e+05 - 6.21e-01 3.17e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 2.7695233e+05 2.33e-10 1.41e+05 -1.0 6.74e+05 - 1.36e-02 4.64e-02f 1
21 2.7511461e+05 1.31e-10 1.01e+05 -1.0 4.35e+05 - 2.86e-01 3.60e-03f 1
22 -2.5313195e+03 2.33e-10 1.00e+05 -1.0 5.17e+05 - 5.56e-03 4.65e-01f 1
23 -6.3534986e+03 2.55e-10 4.89e+04 -1.0 2.13e+04 - 5.12e-01 1.16e-01f 1
24 -1.3774913e+04 2.33e-10 1.59e+04 -1.0 2.80e+04 - 6.74e-01 8.46e-01f 1
25 -1.5659465e+04 1.16e-10 1.03e+04 -1.0 7.27e+04 - 3.53e-01 1.00e+00f 1
26 -1.6608026e+04 1.16e-10 4.64e+03 -1.0 1.22e+05 - 5.50e-01 1.00e+00f 1
27 -1.8579229e+04 2.33e-10 1.05e+03 -1.0 2.43e+05 - 7.74e-01 1.00e+00f 1
28 -1.9948873e+04 2.33e-10 1.96e+06 -1.7 5.47e+05 - 5.23e-01 2.77e-01f 1
29 -1.9970129e+04 3.49e-10 4.49e+06 -1.7 1.09e+05 - 6.88e-01 1.70e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -2.0232362e+04 1.16e-10 1.67e+06 -1.7 3.07e+04 - 6.68e-01 6.36e-01f 1
31 -2.0360905e+04 2.33e-10 2.30e+05 -1.7 6.56e+04 - 4.18e-01 1.00e+00f 1
32 -2.0355950e+04 1.16e-10 3.19e+04 -1.7 7.67e+04 - 8.61e-01 1.00e+00f 1
33 -2.0343353e+04 2.33e-10 6.16e+03 -1.7 2.26e+05 - 8.07e-01 1.00e+00f 1
34 -2.0342514e+04 2.33e-10 2.00e-07 -1.7 4.99e+04 - 1.00e+00 1.00e+00f 1
35 -2.0497997e+04 1.16e-10 8.67e+05 -5.7 1.49e+05 - 5.64e-01 9.98e-01f 1
36 -2.0506227e+04 2.33e-10 8.69e+04 -5.7 2.23e+05 - 8.98e-01 6.37e-01f 1
37 -2.0508958e+04 3.49e-10 2.92e+04 -5.7 7.77e+04 - 6.64e-01 6.31e-01f 1
38 -2.0510855e+04 2.33e-10 1.85e-11 -5.7 4.75e+04 - 1.00e+00 1.00e+00f 1
39 -2.0510869e+04 2.33e-10 9.38e-13 -7.0 6.49e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 39
(scaled) (unscaled)
Objective...............: -2.0510868931496771e+02 -2.0510868931496771e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 1.3189017478696777e-07 1.3189017478696777e-05
Overall NLP error.......: 1.3189017478696777e-07 1.3189017478696777e-05
Number of objective function evaluations = 40
Number of objective gradient evaluations = 40
Number of equality constraint evaluations = 40
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 40
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 39
Total CPU secs in IPOPT (w/o function evaluations) = 0.032
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 69206.31
Variable costs: 50277.70
Number on/offs: 2
Sum on/off ramps: 16.00
Sum nominal ramps: 152.14
Simulating time_step 2020-07-11 19:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -1.7816104e+04 6.29e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.7857949e+04 6.28e+03 9.90e+01 -1.0 6.66e+03 - 2.02e-04 1.94e-04h 1
2 -1.2634719e+04 6.27e+03 9.98e+01 -1.0 6.88e+03 - 1.94e-04 1.83e-03h 1
3 7.2656804e+03 6.23e+03 1.02e+02 -1.0 6.78e+03 - 2.02e-03 6.68e-03h 1
4 6.0254580e+04 6.13e+03 1.01e+02 -1.0 1.33e+03 - 1.06e-02 1.69e-02h 1
5 2.0401546e+05 5.84e+03 9.20e+01 -1.0 1.33e+03 - 6.69e-01 4.64e-02h 1
6 3.0936506e+06 5.84e+01 8.33e+01 -1.0 3.58e+03 - 9.23e-02 9.90e-01h 1
7 3.0794433e+06 5.78e-01 8.04e+02 -1.0 3.15e+03 - 2.43e-01 9.90e-01f 1
8 3.0311076e+06 1.16e-10 5.98e+04 -1.0 3.05e+03 - 4.45e-01 1.00e+00f 1
9 2.9294690e+06 2.33e-10 7.87e+06 -1.0 6.34e+03 - 2.09e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.8016455e+06 1.16e-10 7.24e+06 -1.0 3.23e+04 - 8.05e-02 3.57e-01f 1
11 2.7418684e+06 3.49e-10 7.18e+06 -1.0 5.06e+04 - 7.94e-03 5.72e-02f 1
12 2.6380058e+06 3.49e-10 6.66e+06 -1.0 9.01e+04 - 7.22e-02 6.98e-02f 1
13 2.4165762e+06 2.33e-10 5.59e+06 -1.0 8.63e+04 - 1.61e-01 1.48e-01f 1
14 1.6080251e+06 1.16e-10 3.48e+06 -1.0 7.72e+04 - 3.78e-01 5.60e-01f 1
15 1.5331099e+06 2.33e-10 1.93e+06 -1.0 7.43e+04 - 4.45e-01 8.99e-02f 1
16 1.5229704e+06 3.49e-10 1.46e+06 -1.0 1.38e+05 - 2.43e-01 1.87e-02f 1
17 1.3010833e+06 2.33e-10 3.66e+05 -1.0 1.80e+05 - 7.50e-01 3.74e-01f 1
18 1.2328386e+06 1.95e-10 3.54e+05 -1.0 4.88e+05 - 3.13e-02 5.70e-02f 1
19 1.2162044e+06 2.33e-10 3.54e+05 -1.0 5.21e+05 - 1.98e-03 1.39e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.1941765e+06 3.49e-10 3.16e+05 -1.0 5.26e+05 - 1.07e-01 1.89e-02f 1
21 3.5684209e+05 1.75e-10 3.15e+05 -1.0 5.85e+05 - 1.95e-03 6.36e-01f 1
22 2.1075350e+05 1.16e-10 2.26e+05 -1.0 2.83e+05 - 2.82e-01 1.91e-01f 1
23 1.3675990e+05 2.33e-10 9.03e+04 -1.0 2.45e+05 - 6.01e-01 2.53e-01f 1
24 -1.0054843e+04 2.33e-10 6.01e+04 -1.0 4.85e+05 - 3.34e-01 2.67e-01f 1
25 -1.4854710e+04 1.16e-10 1.25e+04 -1.0 1.09e+04 - 7.91e-01 3.19e-01f 1
26 -2.1834698e+04 1.16e-10 9.53e+03 -1.0 5.10e+04 - 2.40e-01 9.47e-01f 1
27 -2.2533210e+04 1.16e-10 3.16e+04 -1.0 6.42e+04 - 1.75e-01 1.00e+00f 1
28 -2.3120188e+04 1.16e-10 1.64e+03 -1.0 7.27e+04 - 7.91e-01 1.00e+00f 1
29 -2.3609407e+04 1.16e-10 4.89e+06 -1.7 2.43e+05 - 8.07e-01 1.96e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -2.3670246e+04 1.16e-10 5.43e+06 -1.7 1.71e+04 - 8.45e-01 1.19e-01f 1
31 -2.4045781e+04 2.33e-10 1.76e+05 -1.7 9.24e+04 - 2.62e-01 1.00e+00f 1
32 -2.4040787e+04 2.33e-10 4.16e+04 -1.7 8.86e+04 - 7.63e-01 1.00e+00f 1
33 -2.4034012e+04 1.16e-10 5.59e+03 -1.7 1.35e+05 - 8.66e-01 1.00e+00f 1
34 -2.4031687e+04 2.33e-10 2.00e-07 -1.7 4.21e+04 - 1.00e+00 1.00e+00f 1
35 -2.4185465e+04 2.33e-10 8.25e+05 -5.7 9.13e+04 - 5.85e-01 9.97e-01f 1
36 -2.4193149e+04 1.16e-10 1.11e+05 -5.7 2.49e+05 - 8.64e-01 6.56e-01f 1
37 -2.4197670e+04 1.16e-10 1.13e+04 -5.7 1.06e+05 - 9.00e-01 9.58e-01f 1
38 -2.4197806e+04 1.16e-10 1.85e-11 -5.7 2.21e+03 - 1.00e+00 1.00e+00f 1
39 -2.4197818e+04 5.82e-11 9.38e-13 -7.0 4.22e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 39
(scaled) (unscaled)
Objective...............: -2.4197818126813479e+02 -2.4197818126813479e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 5.8207660913467407e-11
Complementarity.........: 1.2557873033799102e-07 1.2557873033799101e-05
Overall NLP error.......: 1.2557873033799102e-07 1.2557873033799101e-05
Number of objective function evaluations = 40
Number of objective gradient evaluations = 40
Number of equality constraint evaluations = 40
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 40
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 39
Total CPU secs in IPOPT (w/o function evaluations) = 0.027
Total CPU secs in NLP function evaluations = 0.002
EXIT: Optimal Solution Found.
Fixed costs: 75215.86
Variable costs: 51460.55
Number on/offs: 4
Sum on/off ramps: 32.00
Sum nominal ramps: 39.07
Simulating time_step 2020-07-11 20:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.1453954e+04 6.29e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.1495504e+04 6.28e+03 9.90e+01 -1.0 2.70e+04 - 2.02e-04 1.94e-04h 1
2 -1.8508106e+04 6.28e+03 9.99e+01 -1.0 2.66e+04 - 1.94e-04 1.01e-03h 1
3 -1.0746797e+04 6.26e+03 1.01e+02 -1.0 1.79e+04 - 8.76e-04 2.40e-03h 1
4 1.2316990e+04 6.22e+03 1.01e+02 -1.0 2.37e+03 - 3.42e-03 6.66e-03h 1
5 8.3882287e+04 6.10e+03 1.00e+02 -1.0 2.33e+03 - 1.22e-02 2.03e-02h 1
6 2.7926167e+05 5.75e+03 9.06e+01 -1.0 2.37e+03 - 1.07e-01 5.64e-02h 1
7 1.0875019e+06 4.33e+03 8.59e+01 -1.0 2.65e+03 - 1.21e-01 2.48e-01h 1
8 2.2928609e+06 2.19e+03 3.45e+01 -1.0 3.01e+03 - 6.52e-01 4.93e-01h 1
9 3.1233638e+06 6.10e+02 4.72e+01 -1.0 8.56e+03 - 1.83e-01 7.22e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.3439174e+06 6.10e+00 1.33e+02 -1.0 9.93e+03 - 4.28e-01 9.90e-01h 1
11 3.1035273e+06 5.47e-02 8.23e+03 -1.0 1.37e+04 - 1.92e-01 9.91e-01f 1
12 3.0812731e+06 5.28e-02 6.86e+04 -1.0 2.60e+04 - 1.10e-01 3.53e-02f 1
13 3.0800897e+06 5.27e-02 7.08e+04 -1.0 4.17e+04 - 3.43e-03 1.28e-03f 1
14 2.9785163e+06 4.90e-02 5.87e+03 -1.0 8.70e+04 - 2.62e-03 7.07e-02f 1
15 2.9675209e+06 4.87e-02 5.09e+04 -1.0 8.77e+04 - 5.77e-02 7.16e-03f 1
16 2.8473455e+06 4.50e-02 1.59e+05 -1.0 8.80e+04 - 1.74e-01 7.48e-02f 1
17 1.6657757e+06 1.61e-02 5.29e+05 -1.0 8.49e+04 - 1.46e-01 6.43e-01f 1
18 1.6511787e+06 1.58e-02 1.46e+06 -1.0 5.48e+04 - 7.63e-01 1.87e-02f 1
19 1.5484032e+06 1.36e-02 1.32e+06 -1.0 2.22e+05 - 1.63e-01 1.35e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.2297471e+06 7.96e-03 1.30e+06 -1.0 2.50e+05 - 6.51e-01 4.15e-01f 1
21 1.2246632e+06 7.93e-03 1.33e+06 -1.0 4.48e+05 - 1.92e-02 4.70e-03f 1
22 1.1943284e+06 7.73e-03 1.23e+06 -1.0 4.56e+05 - 4.82e-04 2.51e-02f 1
23 1.1764342e+06 7.61e-03 1.39e+06 -1.0 4.46e+05 - 8.37e-02 1.48e-02f 1
24 1.0150672e+06 6.69e-03 1.03e+06 -1.0 5.44e+05 - 4.24e-02 1.21e-01f 1
25 2.1949268e+05 2.59e-03 4.70e+05 -1.0 5.11e+05 - 2.72e-01 6.13e-01f 1
26 1.7018740e+05 2.25e-03 6.58e+05 -1.0 2.39e+05 - 4.62e-01 1.32e-01f 1
27 1.0338564e+04 1.34e-03 8.05e+05 -1.0 3.09e+05 - 5.84e-01 4.02e-01f 1
28 -6.8505770e+03 7.15e-04 6.50e+05 -1.0 8.66e+03 - 6.21e-01 4.68e-01f 1
29 -1.9737163e+04 1.96e-04 4.09e+03 -1.0 2.21e+04 - 4.99e-01 7.26e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -2.1427439e+04 1.29e-04 2.85e+05 -1.0 4.05e+04 - 9.58e-01 3.41e-01f 1
31 -2.1917498e+04 1.14e-04 2.78e+05 -1.0 1.23e+05 - 9.40e-01 1.20e-01f 1
32 -2.4404075e+04 8.02e-06 1.98e+04 -1.0 5.42e+03 - 1.00e+00 9.29e-01f 1
33 -2.4600397e+04 2.33e-10 1.00e-06 -1.0 1.09e+03 - 1.00e+00 1.00e+00f 1
34 -2.5478937e+04 2.33e-10 4.84e+04 -5.7 9.95e+03 - 9.92e-01 9.87e-01f 1
35 -2.5486866e+04 2.33e-10 3.64e+04 -5.7 1.12e+02 - 1.00e+00 7.25e-01f 1
36 -2.5488655e+04 1.16e-10 8.20e+03 -5.7 3.08e+01 - 2.25e-02 7.75e-01f 1
37 -2.5488940e+04 1.16e-10 2.20e+03 -5.7 6.93e+00 - 1.00e+00 7.32e-01f 1
38 -2.5488992e+04 1.16e-10 5.78e+02 -5.7 2.36e+00 - 9.84e-01 8.11e-01f 1
39 -2.5489005e+04 1.16e-10 1.85e-11 -5.7 5.22e-01 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -2.5489016e+04 2.33e-10 9.09e-02 -7.0 2.07e-01 - 9.99e-01 1.00e+00f 1
41 -2.5489016e+04 1.16e-10 3.46e+00 -7.0 2.79e+00 - 1.00e+00 7.70e-01h 1
42 -2.5489016e+04 1.16e-10 9.38e-13 -7.0 9.19e-01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 42
(scaled) (unscaled)
Objective...............: -2.5489015554263744e+02 -2.5489015554263744e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 3.2337589396370780e-12 1.1641532182693481e-10
Complementarity.........: 1.8859723382819099e-07 1.8859723382819100e-05
Overall NLP error.......: 1.8859723382819099e-07 1.8859723382819100e-05
Number of objective function evaluations = 43
Number of objective gradient evaluations = 43
Number of equality constraint evaluations = 43
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 43
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 42
Total CPU secs in IPOPT (w/o function evaluations) = 0.030
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 62776.44
Variable costs: 53596.65
Number on/offs: 6
Sum on/off ramps: 0.00
Sum nominal ramps: 107.87
Simulating time_step 2020-07-11 21:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.2694753e+04 6.29e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.2736691e+04 6.28e+03 9.90e+01 -1.0 5.63e+03 - 2.02e-04 1.94e-04h 1
2 -2.0047346e+04 6.28e+03 9.99e+01 -1.0 1.42e+03 - 1.94e-04 8.89e-04h 1
3 -1.2275648e+04 6.26e+03 1.00e+02 -1.0 1.38e+03 - 1.08e-03 2.41e-03h 1
4 1.0252712e+04 6.22e+03 1.00e+02 -1.0 1.24e+03 - 3.47e-03 6.81e-03h 1
5 7.8654518e+04 6.10e+03 1.00e+02 -1.0 1.08e+03 - 1.23e-02 2.03e-02h 1
6 2.7261374e+05 5.74e+03 9.04e+01 -1.0 1.06e+03 - 2.60e-01 5.85e-02h 1
7 1.8942984e+06 2.75e+03 9.02e+01 -1.0 1.04e+03 - 1.03e-01 5.21e-01h 1
8 3.0146097e+06 6.82e+02 5.18e+01 -1.0 6.00e+02 - 5.24e-01 7.52e-01h 1
9 3.3643492e+06 6.81e+00 7.06e+01 -1.0 5.79e+02 - 2.28e-01 9.90e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.3417255e+06 6.19e-02 5.22e+03 -1.0 9.51e+02 - 4.24e-01 9.91e-01f 1
11 3.2493212e+06 1.16e-10 6.87e+05 -1.0 4.23e+03 - 2.55e-01 1.00e+00f 1
12 3.2189179e+06 2.33e-10 1.07e+05 -1.0 2.39e+04 - 1.17e-01 6.21e-02f 1
13 3.2180880e+06 2.33e-10 5.07e+04 -1.0 4.20e+04 - 7.56e-03 1.02e-03f 1
14 3.0960662e+06 2.33e-10 5.27e+05 -1.0 8.32e+04 - 1.24e-03 5.72e-02f 1
15 3.0779192e+06 2.33e-10 1.34e+05 -1.0 8.88e+04 - 5.33e-02 7.80e-03f 1
16 2.8946986e+06 4.66e-10 6.25e+05 -1.0 8.91e+04 - 1.69e-01 7.61e-02f 1
17 2.3047516e+06 4.66e-10 7.15e+04 -1.0 8.59e+04 - 1.44e-01 2.27e-01f 1
18 2.2985750e+06 5.82e-10 2.14e+06 -1.0 6.95e+04 - 3.87e-01 2.90e-03f 1
19 2.2541881e+06 5.82e-10 2.87e+06 -1.0 8.58e+04 - 2.54e-01 2.88e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.4857112e+06 3.49e-10 2.39e+06 -1.0 1.14e+05 - 8.57e-01 4.97e-01f 1
21 1.4555568e+06 3.49e-10 2.38e+06 -1.0 5.87e+05 - 9.60e-02 1.85e-02f 1
22 1.3479261e+06 3.49e-10 2.25e+06 -1.0 6.27e+05 - 1.85e-01 7.02e-02f 1
23 1.3263431e+06 2.33e-10 2.28e+06 -1.0 6.69e+05 - 2.39e-01 1.36e-02f 1
24 1.1520902e+06 3.49e-10 2.00e+06 -1.0 7.28e+05 - 3.25e-03 1.13e-01f 1
25 1.1136994e+06 4.66e-10 2.07e+06 -1.0 6.55e+05 - 6.00e-01 2.34e-02f 1
26 2.9770870e+05 2.33e-10 1.20e+06 -1.0 7.21e+05 - 2.11e-02 4.06e-01f 1
27 2.0778338e+05 1.16e-10 1.01e+06 -1.0 2.83e+05 - 5.87e-01 1.85e-01f 1
28 3.8922268e+03 2.33e-10 2.99e+05 -1.0 1.61e+05 - 5.75e-01 7.00e-01f 1
29 -2.6071167e+04 1.75e-10 4.14e+04 -1.0 1.87e+04 - 5.30e-01 8.46e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -3.1493058e+04 1.16e-10 3.28e+03 -1.0 3.86e+04 - 5.15e-01 1.00e+00f 1
31 -3.2080549e+04 2.33e-10 2.26e+03 -1.0 7.36e+04 - 6.50e-01 1.00e+00f 1
32 -3.2118788e+04 2.33e-10 6.49e+06 -1.7 6.49e+04 - 8.52e-01 4.08e-02f 1
33 -3.2423857e+04 2.33e-10 2.00e+06 -1.7 2.64e+04 - 6.15e-01 6.80e-01f 1
34 -3.2551978e+04 2.33e-10 2.19e+05 -1.7 5.50e+04 - 5.19e-01 1.00e+00f 1
35 -3.2550168e+04 1.16e-10 2.82e+04 -1.7 6.90e+04 - 8.71e-01 1.00e+00f 1
36 -3.2548046e+04 1.16e-10 2.00e-07 -1.7 5.20e+04 - 1.00e+00 1.00e+00f 1
37 -3.2673186e+04 2.33e-10 6.06e+05 -5.7 3.60e+04 - 6.95e-01 9.97e-01f 1
38 -3.2676659e+04 2.33e-10 8.47e+04 -5.7 1.65e+05 - 8.58e-01 6.48e-01f 1
39 -3.2678717e+04 1.16e-10 8.51e+03 -5.7 6.65e+04 - 9.01e-01 9.81e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -3.2678736e+04 1.16e-10 1.85e-11 -5.7 4.13e+02 - 1.00e+00 1.00e+00f 1
41 -3.2678746e+04 2.33e-10 9.38e-13 -7.0 4.54e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 41
(scaled) (unscaled)
Objective...............: -3.2678745894924617e+02 -3.2678745894924617e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 1.3570899226293397e-07 1.3570899226293396e-05
Overall NLP error.......: 1.3570899226293397e-07 1.3570899226293396e-05
Number of objective function evaluations = 42
Number of objective gradient evaluations = 42
Number of equality constraint evaluations = 42
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 42
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 41
Total CPU secs in IPOPT (w/o function evaluations) = 0.020
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 62776.44
Variable costs: 46566.81
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 244.06
Simulating time_step 2020-07-11 22:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.9833507e+04 6.29e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.9875076e+04 6.28e+03 9.90e+01 -1.0 1.62e+04 - 2.02e-04 1.94e-04h 1
2 -2.7175885e+04 6.28e+03 9.99e+01 -1.0 1.64e+04 - 1.94e-04 8.80e-04h 1
3 -2.1088243e+04 6.27e+03 1.00e+02 -1.0 1.42e+04 - 8.99e-04 1.77e-03h 1
4 -2.9905499e+03 6.24e+03 1.00e+02 -1.0 4.27e+03 - 1.75e-03 4.93e-03h 1
5 2.4665054e+04 6.19e+03 9.97e+01 -1.0 2.04e+03 - 7.82e-03 7.39e-03h 1
6 1.4700376e+05 5.99e+03 9.93e+01 -1.0 2.06e+03 - 1.81e-02 3.27e-02h 1
7 4.6350752e+05 5.47e+03 8.61e+01 -1.0 2.09e+03 - 3.16e-01 8.74e-02h 1
8 2.4591506e+06 2.15e+03 7.86e+01 -1.0 3.00e+03 - 1.63e-01 6.07e-01h 1
9 3.6989983e+06 2.15e+01 7.99e+01 -1.0 3.43e+03 - 4.27e-01 9.90e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.6086943e+06 2.08e-01 1.96e+03 -1.0 5.29e+03 - 3.21e-01 9.90e-01f 1
11 3.4435772e+06 1.75e-10 1.95e+05 -1.0 7.24e+03 - 3.33e-01 1.00e+00f 1
12 3.1191409e+06 1.16e-10 6.65e+06 -1.0 1.71e+04 - 3.29e-01 1.00e+00f 1
13 3.0870726e+06 1.16e-10 6.25e+06 -1.0 3.41e+04 - 6.00e-02 3.06e-02f 1
14 3.0860134e+06 2.33e-10 6.19e+06 -1.0 4.32e+04 - 8.69e-03 1.01e-03f 1
15 2.9936228e+06 2.91e-10 6.19e+06 -1.0 7.77e+04 - 1.21e-03 5.53e-02f 1
16 2.9749284e+06 2.33e-10 5.85e+06 -1.0 8.91e+04 - 5.45e-02 1.01e-02f 1
17 2.8362654e+06 2.33e-10 4.88e+06 -1.0 8.93e+04 - 1.66e-01 7.14e-02f 1
18 2.5435700e+06 2.33e-10 4.18e+06 -1.0 8.64e+04 - 1.43e-01 1.33e-01f 1
19 2.5403918e+06 2.91e-10 2.90e+06 -1.0 7.75e+04 - 3.05e-01 1.60e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.5580466e+06 1.75e-10 2.26e+06 -1.0 7.93e+04 - 2.23e-01 5.67e-01f 1
21 1.5450025e+06 1.75e-10 1.71e+05 -1.0 9.76e+04 - 9.24e-01 1.68e-02f 1
22 1.5073971e+06 1.46e-10 1.62e+05 -1.0 8.45e+05 - 4.96e-02 1.78e-02f 1
23 1.4108975e+06 3.49e-10 1.44e+05 -1.0 8.81e+05 - 1.10e-01 4.48e-02f 1
24 1.4028192e+06 3.49e-10 1.34e+05 -1.0 8.70e+05 - 6.98e-02 4.45e-03f 1
25 1.2770689e+06 2.33e-10 1.34e+05 -1.0 8.76e+05 - 9.12e-04 6.96e-02f 1
26 1.1873907e+06 3.49e-10 1.09e+05 -1.0 8.13e+05 - 1.84e-01 4.75e-02f 1
27 5.9397663e+05 2.33e-10 1.04e+05 -1.0 7.58e+05 - 5.39e-02 3.13e-01f 1
28 2.6994529e+05 2.33e-10 3.89e+04 -1.0 4.05e+05 - 6.24e-01 2.59e-01f 1
29 1.3419107e+05 3.49e-10 1.36e+04 -1.0 2.26e+05 - 6.49e-01 3.42e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 1.0059379e+05 4.66e-10 5.09e+03 -1.0 2.14e+05 - 6.27e-01 1.79e-01f 1
31 -1.2057393e+04 2.33e-10 3.20e+03 -1.0 5.97e+04 - 3.72e-01 8.04e-01f 1
32 -2.3384022e+04 1.16e-10 1.65e+02 -1.0 5.19e+04 - 9.48e-01 4.92e-01f 1
33 -2.4802520e+04 2.33e-10 5.62e+06 -2.5 3.04e+05 - 6.79e-01 1.00e-01f 1
34 -2.8398460e+04 2.33e-10 5.75e+06 -2.5 8.73e+03 - 9.97e-01 3.41e-01f 1
35 -3.4880487e+04 2.33e-10 3.57e+05 -2.5 3.12e+03 - 1.00e+00 9.38e-01f 1
36 -3.5192448e+04 2.33e-10 9.68e+04 -2.5 1.61e+02 - 1.00e+00 7.29e-01f 1
37 -3.5275778e+04 2.33e-10 2.75e+04 -2.5 6.96e+01 - 1.00e+00 7.16e-01f 1
38 -3.5309045e+04 1.16e-10 2.83e-08 -2.5 1.44e+01 - 1.00e+00 1.00e+00f 1
39 -3.5326187e+04 2.33e-10 3.04e+04 -5.7 3.49e+02 - 1.00e+00 8.92e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -3.5327527e+04 2.33e-10 4.32e+03 -5.7 3.73e+01 - 3.30e-02 8.58e-01f 1
41 -3.5327561e+04 2.33e-10 3.80e+03 -5.7 5.33e+00 - 9.56e-01 1.92e-01f 1
42 -3.5327673e+04 3.49e-10 6.91e+02 -5.7 6.01e+00 - 4.12e-01 8.11e-01f 1
43 -3.5327695e+04 1.16e-10 3.72e-01 -5.7 1.01e+00 - 9.98e-01 1.00e+00f 1
44 -3.5327697e+04 1.16e-10 1.85e-11 -5.7 2.18e-01 - 1.00e+00 1.00e+00f 1
45 -3.5327706e+04 1.16e-10 9.38e-13 -7.0 2.56e-01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 45
(scaled) (unscaled)
Objective...............: -3.5327705501088315e+02 -3.5327705501088312e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2880385951482124e-07 1.2880385951482123e-05
Overall NLP error.......: 1.2880385951482124e-07 1.2880385951482123e-05
Number of objective function evaluations = 46
Number of objective gradient evaluations = 46
Number of equality constraint evaluations = 46
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 46
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 45
Total CPU secs in IPOPT (w/o function evaluations) = 0.035
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 62154.87
Variable costs: 40297.90
Number on/offs: 1
Sum on/off ramps: 0.00
Sum nominal ramps: 281.10
Simulating time_step 2020-07-11 23:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.2432062e+04 6.29e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.2473864e+04 6.28e+03 9.90e+01 -1.0 1.11e+04 - 2.02e-04 1.94e-04h 1
2 -2.9818216e+04 6.28e+03 9.99e+01 -1.0 1.03e+04 - 1.94e-04 8.80e-04h 1
3 -2.1916354e+04 6.26e+03 1.01e+02 -1.0 4.43e+03 - 8.99e-04 2.41e-03h 1
4 8.5677786e+02 6.22e+03 1.01e+02 -1.0 1.26e+03 - 3.46e-03 6.71e-03h 1
5 7.0170309e+04 6.10e+03 1.00e+02 -1.0 1.08e+03 - 1.22e-02 2.00e-02h 1
6 2.6600256e+05 5.75e+03 9.05e+01 -1.0 1.06e+03 - 2.70e-01 5.76e-02h 1
7 1.9956536e+06 2.64e+03 9.10e+01 -1.0 1.07e+03 - 1.01e-01 5.41e-01h 1
8 3.1073942e+06 6.24e+02 5.37e+01 -1.0 1.27e+03 - 5.11e-01 7.63e-01h 1
9 3.4035994e+06 6.24e+00 7.64e+01 -1.0 3.31e+03 - 2.34e-01 9.90e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.3229408e+06 5.61e-02 5.45e+03 -1.0 5.91e+03 - 4.49e-01 9.91e-01f 1
11 3.0384738e+06 2.33e-10 7.79e+05 -1.0 1.85e+04 - 2.26e-01 1.00e+00f 1
12 3.0027817e+06 2.33e-10 1.08e+04 -1.0 3.21e+04 - 1.19e-01 4.34e-02f 1
13 3.0016083e+06 2.33e-10 3.55e+04 -1.0 4.19e+04 - 6.53e-03 1.15e-03f 1
14 2.9038576e+06 2.33e-10 4.49e+05 -1.0 8.66e+04 - 1.19e-03 5.76e-02f 1
15 2.8894138e+06 4.07e-10 5.97e+04 -1.0 8.86e+04 - 5.32e-02 8.10e-03f 1
16 2.7475160e+06 3.49e-10 7.04e+05 -1.0 8.89e+04 - 1.70e-01 7.57e-02f 1
17 2.4507237e+06 3.49e-10 6.42e+05 -1.0 8.57e+04 - 1.43e-01 1.38e-01f 1
18 2.4475371e+06 2.33e-10 2.39e+06 -1.0 7.64e+04 - 3.05e-01 1.65e-03f 1
19 1.5157080e+06 2.33e-10 2.58e+05 -1.0 7.81e+04 - 2.33e-01 5.61e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.5033618e+06 3.49e-10 2.52e+06 -1.0 9.91e+04 - 9.23e-01 1.66e-02f 1
21 1.4600218e+06 3.49e-10 2.48e+06 -1.0 8.51e+05 - 4.92e-02 2.07e-02f 1
22 1.3709856e+06 2.33e-10 2.39e+06 -1.0 8.82e+05 - 1.15e-01 4.19e-02f 1
23 1.3624219e+06 2.33e-10 2.39e+06 -1.0 8.71e+05 - 5.77e-02 4.82e-03f 1
24 1.2528304e+06 2.33e-10 2.23e+06 -1.0 8.75e+05 - 7.83e-04 6.16e-02f 1
25 1.1672326e+06 2.33e-10 2.15e+06 -1.0 8.20e+05 - 1.65e-01 4.59e-02f 1
26 6.4578988e+05 2.33e-10 1.52e+06 -1.0 7.69e+05 - 5.53e-02 2.79e-01f 1
27 2.5420079e+05 2.33e-10 1.12e+06 -1.0 4.68e+05 - 5.96e-01 2.90e-01f 1
28 1.3905991e+05 2.33e-10 8.09e+05 -1.0 2.30e+05 - 6.00e-01 2.95e-01f 1
29 -1.8165300e+04 2.33e-10 1.85e+05 -1.0 1.04e+05 - 8.51e-01 7.73e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -2.0242561e+04 2.33e-10 1.71e+05 -1.0 3.14e+05 - 7.63e-01 8.89e-02f 1
31 -2.6600261e+04 1.16e-10 1.19e+05 -1.0 2.00e+05 - 8.20e-01 3.10e-01f 1
32 -3.9517467e+04 1.16e-10 1.26e+03 -1.0 9.44e+03 - 9.85e-01 9.89e-01f 1
33 -4.0162220e+04 3.49e-10 2.00e-07 -1.7 2.50e+04 - 1.00e+00 1.00e+00f 1
34 -4.0276609e+04 1.16e-10 5.31e+04 -5.7 2.67e+03 - 9.98e-01 9.71e-01f 1
35 -4.0279124e+04 1.16e-10 3.54e+03 -5.7 7.54e+01 - 9.88e-01 9.37e-01f 1
36 -4.0279187e+04 2.33e-10 1.98e+03 -5.7 5.71e+00 - 7.60e-01 4.45e-01f 1
37 -4.0279258e+04 2.33e-10 2.39e+01 -5.7 3.13e+00 - 8.96e-01 9.96e-01f 1
38 -4.0279260e+04 2.33e-10 1.85e-11 -5.7 2.17e-02 - 1.00e+00 1.00e+00f 1
39 -4.0279269e+04 2.33e-10 9.24e-13 -7.0 2.77e-01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 39
(scaled) (unscaled)
Objective...............: -4.0279268565481340e+02 -4.0279268565481339e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 1.2783766129895096e-07 1.2783766129895096e-05
Overall NLP error.......: 1.2783766129895096e-07 1.2783766129895096e-05
Number of objective function evaluations = 40
Number of objective gradient evaluations = 40
Number of equality constraint evaluations = 40
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 40
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 39
Total CPU secs in IPOPT (w/o function evaluations) = 0.025
Total CPU secs in NLP function evaluations = 0.006
EXIT: Optimal Solution Found.
Fixed costs: 61106.87
Variable costs: 36547.04
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 142.17
Simulating time_step 2020-07-12 00:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.7332943e+04 6.29e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.7374399e+04 6.28e+03 9.90e+01 -1.0 2.61e+04 - 2.02e-04 1.94e-04h 1
2 -3.4619066e+04 6.28e+03 9.99e+01 -1.0 2.56e+04 - 1.94e-04 8.80e-04h 1
3 -2.7595869e+04 6.27e+03 1.01e+02 -1.0 1.70e+04 - 8.29e-04 1.94e-03h 1
4 -7.6745740e+03 6.23e+03 1.01e+02 -1.0 2.27e+03 - 2.74e-03 5.15e-03h 1
5 2.5176471e+04 6.18e+03 9.96e+01 -1.0 2.23e+03 - 8.88e-03 8.37e-03h 1
6 1.7329000e+05 5.95e+03 9.92e+01 -1.0 2.26e+03 - 2.06e-02 3.78e-02h 1
7 5.3047753e+05 5.38e+03 8.48e+01 -1.0 2.31e+03 - 2.70e-01 9.48e-02h 1
8 2.3871901e+06 2.44e+03 7.63e+01 -1.0 3.27e+03 - 1.89e-01 5.47e-01h 1
9 3.8119961e+06 1.13e+02 6.29e+01 -1.0 4.06e+03 - 4.30e-01 9.54e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.7659064e+06 1.12e+00 4.01e+02 -1.0 6.94e+03 - 2.73e-01 9.90e-01f 1
11 3.5914207e+06 4.97e-03 3.17e+04 -1.0 8.75e+03 - 4.28e-01 9.96e-01f 1
12 3.1931713e+06 1.75e-10 4.17e+06 -1.0 1.82e+04 - 2.51e-01 1.00e+00f 1
13 3.1592719e+06 2.33e-10 3.43e+06 -1.0 3.24e+04 - 1.05e-01 3.58e-02f 1
14 3.1579862e+06 3.49e-10 3.37e+06 -1.0 4.16e+04 - 8.56e-03 1.23e-03f 1
15 3.0667028e+06 2.33e-10 3.61e+06 -1.0 6.32e+04 - 1.39e-03 5.88e-02f 1
16 3.0462512e+06 3.49e-10 3.24e+06 -1.0 8.96e+04 - 5.47e-02 1.09e-02f 1
17 2.9025292e+06 2.33e-10 2.30e+06 -1.0 8.97e+04 - 1.71e-01 7.27e-02f 1
18 2.6043503e+06 3.49e-10 1.93e+06 -1.0 8.68e+04 - 1.43e-01 1.32e-01f 1
19 2.6010776e+06 2.33e-10 4.02e+05 -1.0 7.79e+04 - 3.00e-01 1.61e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.5839975e+06 1.16e-10 1.39e+06 -1.0 7.96e+04 - 2.29e-01 5.69e-01f 1
21 1.5703694e+06 2.33e-10 1.13e+06 -1.0 9.82e+04 - 9.24e-01 1.69e-02f 1
22 1.5335534e+06 3.49e-10 1.12e+06 -1.0 8.46e+05 - 4.98e-02 1.72e-02f 1
23 1.4346476e+06 3.49e-10 1.08e+06 -1.0 8.83e+05 - 1.08e-01 4.53e-02f 1
24 1.4264417e+06 3.49e-10 1.09e+06 -1.0 8.71e+05 - 7.19e-02 4.44e-03f 1
25 1.2958293e+06 2.33e-10 1.00e+06 -1.0 8.76e+05 - 9.34e-04 7.11e-02f 1
26 1.2054250e+06 3.49e-10 9.78e+05 -1.0 8.13e+05 - 1.91e-01 4.72e-02f 1
27 5.8575670e+05 2.33e-10 6.28e+05 -1.0 7.56e+05 - 5.31e-02 3.22e-01f 1
28 2.7553744e+05 2.33e-10 5.18e+05 -1.0 3.88e+05 - 6.26e-01 2.51e-01f 1
29 1.3128492e+05 3.49e-10 3.49e+05 -1.0 2.24e+05 - 6.58e-01 3.54e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -2.2053622e+04 2.33e-10 6.84e+04 -1.0 2.44e+05 - 8.13e-01 8.04e-01f 1
31 -2.8384889e+04 3.49e-10 5.31e+04 -1.0 7.89e+05 - 6.63e-01 2.42e-01f 1
32 -3.2514816e+04 1.16e-10 4.16e+04 -1.0 4.16e+05 - 7.29e-01 2.26e-01f 1
33 -3.5406438e+04 2.33e-10 3.34e+04 -1.0 3.29e+05 - 7.52e-01 2.02e-01f 1
34 -3.8300125e+04 1.16e-10 2.32e+04 -1.0 1.68e+04 - 1.00e+00 3.06e-01f 1
35 -4.4749105e+04 1.16e-10 1.00e-06 -1.0 5.11e+03 - 1.00e+00 1.00e+00f 1
36 -4.5300978e+04 2.33e-10 2.27e+04 -5.7 1.47e+04 - 9.89e-01 9.87e-01f 1
37 -4.5308263e+04 2.33e-10 3.45e+03 -5.7 1.89e+02 - 1.00e+00 9.74e-01f 1
38 -4.5308348e+04 1.16e-10 1.60e+03 -5.7 4.81e+00 - 7.77e-01 5.35e-01f 1
39 -4.5308414e+04 2.33e-10 2.42e+01 -5.7 2.25e+00 - 9.21e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -4.5308415e+04 2.33e-10 1.85e-11 -5.7 1.41e-03 - 1.00e+00 1.00e+00h 1
41 -4.5308424e+04 2.33e-10 9.38e-13 -7.0 2.59e-01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 41
(scaled) (unscaled)
Objective...............: -4.5308423541376766e+02 -4.5308423541376767e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 1.2627758109316031e-07 1.2627758109316031e-05
Overall NLP error.......: 1.2627758109316031e-07 1.2627758109316031e-05
Number of objective function evaluations = 42
Number of objective gradient evaluations = 42
Number of equality constraint evaluations = 42
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 42
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 41
Total CPU secs in IPOPT (w/o function evaluations) = 0.019
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 57898.87
Variable costs: 28412.85
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 355.43
Simulating time_step 2020-07-12 01:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -4.2311424e+04 2.91e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -4.2353325e+04 2.91e+05 9.90e+01 -1.0 2.60e+04 - 2.02e-04 1.94e-04h 1
2 -4.0495979e+04 2.91e+05 9.99e+01 -1.0 2.56e+04 - 1.94e-04 8.80e-04h 1
3 -3.5445936e+04 2.90e+05 1.01e+02 -1.0 1.70e+04 - 8.29e-04 1.95e-03h 1
4 -2.0713045e+04 2.89e+05 1.01e+02 -1.0 2.27e+03 - 2.74e-03 5.15e-03h 1
5 3.8123187e+03 2.86e+05 9.96e+01 -1.0 2.97e+03 - 8.88e-03 8.37e-03h 1
6 2.2240262e+04 2.85e+05 9.77e+01 -1.0 1.08e+04 - 1.25e-02 6.27e-03h 1
7 2.6138035e+04 2.84e+05 1.91e+02 -1.0 1.59e+05 - 4.39e-02 1.29e-03h 1
8 1.8790043e+05 2.69e+05 9.44e+01 -1.0 1.18e+05 - 2.47e-03 5.25e-02h 1
9 2.0053134e+05 2.68e+05 1.75e+02 -1.0 6.09e+04 - 7.98e-02 4.23e-03h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.1167622e+06 9.80e+04 1.58e+02 -1.0 2.88e+04 - 6.69e-02 6.34e-01h 1
11 2.6340969e+06 5.08e+04 8.94e+01 -1.0 1.05e+04 - 4.51e-01 4.82e-01h 1
12 3.1019601e+06 2.76e+03 1.16e+02 -1.0 5.28e+03 - 3.03e-01 9.46e-01h 1
13 3.0814369e+06 2.17e+03 2.83e+02 -1.0 7.26e+03 - 5.10e-01 2.14e-01f 1
14 2.8049162e+06 2.14e+01 1.11e+03 -1.0 1.37e+04 - 1.58e-01 9.90e-01f 1
15 2.4925761e+06 8.09e+00 5.08e+04 -1.0 2.25e+04 - 2.47e-01 6.23e-01f 1
16 2.4908466e+06 8.08e+00 3.27e+04 -1.0 3.82e+04 - 5.36e-02 1.48e-03f 1
17 2.4475838e+06 7.73e+00 4.29e+04 -1.0 4.58e+04 - 1.00e-02 4.35e-02f 1
18 2.4158644e+06 7.49e+00 4.42e+03 -1.0 5.06e+04 - 1.38e-01 3.00e-02f 1
19 2.3005118e+06 6.86e+00 4.06e+03 -1.0 7.50e+04 - 8.15e-02 8.52e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 2.1078931e+06 5.90e+00 1.73e+04 -1.0 7.68e+04 - 1.91e-01 1.40e-01f 1
21 2.1057768e+06 5.89e+00 1.79e+05 -1.0 7.20e+04 - 3.52e-01 1.65e-03f 1
22 1.4078251e+06 1.87e+00 3.78e+04 -1.0 8.66e+04 - 4.74e-01 6.82e-01f 1
23 1.0496379e+06 7.08e-01 3.41e+05 -1.0 1.57e+05 - 3.64e-01 6.22e-01f 1
24 1.0230296e+06 6.69e-01 3.96e+05 -1.0 1.70e+05 - 2.66e-02 5.48e-02f 1
25 1.0211856e+06 6.67e-01 1.81e+06 -1.0 2.30e+05 - 8.24e-01 3.60e-03f 1
26 4.5695646e+05 4.91e-01 8.19e+05 -1.0 7.41e+05 - 9.45e-03 2.64e-01f 1
27 3.8562779e+05 4.72e-01 1.71e+06 -1.0 7.64e+05 - 4.11e-01 3.73e-02f 1
28 3.8341218e+05 4.71e-01 3.02e+06 -1.0 4.69e+05 - 6.14e-01 1.79e-03f 1
29 -5.1074719e+02 2.65e-01 2.01e+06 -1.0 4.44e+05 - 6.29e-01 4.39e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -2.5372300e+04 1.11e-01 1.45e+06 -1.0 7.69e+04 - 9.36e-01 5.80e-01f 1
31 -3.7932000e+04 4.05e-02 3.75e+05 -1.0 5.92e+05 - 5.06e-01 6.35e-01f 1
32 -4.0132812e+04 2.69e-02 7.11e+05 -1.0 2.27e+05 - 8.35e-01 3.37e-01f 1
33 -4.2900637e+04 9.13e-03 3.14e+05 -1.0 9.22e+04 - 9.43e-01 6.60e-01f 1
34 -4.3565387e+04 4.51e-03 1.74e+05 -1.0 3.23e+04 - 1.00e+00 5.07e-01f 1
35 -4.4214348e+04 1.16e-10 1.00e-06 -1.0 7.63e+03 - 1.00e+00 1.00e+00f 1
36 -4.4646316e+04 1.16e-10 1.00e+06 -5.7 2.87e+03 - 9.40e-01 8.40e-01f 1
37 -4.4732134e+04 2.33e-10 1.80e+04 -5.7 8.05e+04 - 8.58e-01 9.58e-01f 1
38 -4.4735658e+04 3.49e-10 2.46e+03 -5.7 2.35e+03 - 1.00e+00 9.64e-01f 1
39 -4.4735734e+04 1.16e-10 2.24e+02 -5.7 6.06e+01 - 8.67e-01 9.09e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -4.4735742e+04 2.33e-10 1.85e-11 -5.7 5.52e+00 - 1.00e+00 1.00e+00f 1
41 -4.4735751e+04 2.33e-10 9.24e-13 -7.0 2.63e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 41
(scaled) (unscaled)
Objective...............: -4.4735750843619144e+02 -4.4735750843619142e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 3.2868686106868199e-07 3.2868686106868196e-05
Overall NLP error.......: 3.2868686106868199e-07 3.2868686106868196e-05
Number of objective function evaluations = 42
Number of objective gradient evaluations = 42
Number of equality constraint evaluations = 42
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 42
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 41
Total CPU secs in IPOPT (w/o function evaluations) = 0.030
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 59534.87
Variable costs: 25222.93
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 137.29
Simulating time_step 2020-07-12 02:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -4.1787862e+04 2.91e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -4.1829767e+04 2.91e+05 9.90e+01 -1.0 2.60e+04 - 2.02e-04 1.94e-04h 1
2 -3.9633973e+04 2.91e+05 1.00e+02 -1.0 2.56e+04 - 1.94e-04 8.73e-04h 1
3 -3.3646238e+04 2.90e+05 1.01e+02 -1.0 1.71e+04 - 8.27e-04 1.93e-03h 1
4 -1.6574153e+04 2.89e+05 1.00e+02 -1.0 3.34e+03 - 2.72e-03 5.07e-03h 1
5 1.1688283e+04 2.86e+05 9.96e+01 -1.0 5.05e+03 - 8.74e-03 8.26e-03h 1
6 3.4790815e+04 2.84e+05 9.77e+01 -1.0 1.72e+04 - 1.28e-02 6.76e-03h 1
7 4.0843470e+04 2.84e+05 1.34e+02 -1.0 1.93e+05 - 4.42e-02 1.74e-03h 1
8 1.6325630e+05 2.74e+05 9.38e+01 -1.0 1.73e+05 - 3.72e-03 3.50e-02h 1
9 1.7316713e+05 2.73e+05 2.42e+02 -1.0 1.18e+05 - 7.93e-02 2.87e-03h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.7253632e+06 1.53e+05 1.95e+02 -1.0 2.89e+04 - 2.28e-02 4.39e-01h 1
11 2.5800732e+06 8.66e+04 1.13e+02 -1.0 1.62e+04 - 4.23e-01 4.35e-01h 1
12 3.4685163e+06 1.39e+04 9.56e+01 -1.0 8.96e+03 - 4.12e-01 8.40e-01h 1
13 3.5105471e+06 1.39e+02 1.21e+02 -1.0 7.93e+03 - 4.17e-01 9.90e-01h 1
14 3.2313969e+06 1.10e+00 1.60e+04 -1.0 1.18e+04 - 2.30e-01 9.92e-01f 1
15 2.9502166e+06 4.82e-01 6.12e+05 -1.0 2.27e+04 - 2.72e-01 5.60e-01f 1
16 2.9485642e+06 4.82e-01 5.45e+05 -1.0 4.18e+04 - 1.98e-02 1.32e-03f 1
17 2.8572068e+06 4.44e-01 7.68e+05 -1.0 4.47e+04 - 2.49e-03 7.78e-02f 1
18 2.8419449e+06 4.41e-01 6.92e+05 -1.0 8.78e+04 - 2.68e-02 7.96e-03f 1
19 2.6837060e+06 4.05e-01 7.28e+05 -1.0 8.72e+04 - 5.62e-02 8.12e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 2.6758790e+06 4.03e-01 4.20e+04 -1.0 6.19e+04 - 2.09e-01 6.01e-03f 1
21 2.5014975e+06 3.54e-01 2.30e+05 -1.0 8.08e+04 - 1.75e-01 1.19e-01f 1
22 2.4993339e+06 3.54e-01 2.34e+06 -1.0 7.47e+04 - 6.13e-01 1.66e-03f 1
23 1.4263598e+06 5.99e-02 1.48e+06 -1.0 1.47e+05 - 7.97e-02 8.31e-01f 1
24 1.2630906e+06 4.09e-02 1.89e+06 -1.0 1.45e+05 - 1.18e-01 3.17e-01f 1
25 1.2608851e+06 4.07e-02 4.44e+04 -1.0 1.67e+05 - 4.40e-01 4.26e-03f 1
26 1.1917717e+06 3.72e-02 2.44e+05 -1.0 2.78e+05 - 7.88e-03 8.65e-02f 1
27 7.4811454e+05 2.94e-02 7.36e+05 -1.0 1.25e+06 - 2.51e-04 2.09e-01f 1
28 7.4385067e+05 2.94e-02 5.34e+04 -1.0 1.41e+06 - 2.58e-01 1.90e-03f 1
29 7.3774850e+05 2.92e-02 1.42e+06 -1.0 3.29e+05 - 7.31e-01 7.56e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 5.0998419e+05 2.65e-02 1.49e+06 -1.0 1.17e+06 - 3.85e-01 9.18e-02f 1
31 5.0414324e+05 2.64e-02 1.74e+06 -1.0 5.61e+05 - 5.59e-01 3.80e-03f 1
32 -8.3723692e+03 1.49e-02 1.00e+06 -1.0 6.05e+05 - 5.27e-01 4.35e-01f 1
33 -2.5981862e+04 8.13e-03 6.07e+05 -1.0 2.94e+04 - 9.70e-01 4.54e-01f 1
34 -3.7084965e+04 3.16e-03 2.38e+05 -1.0 4.01e+05 - 7.74e-01 6.11e-01f 1
35 -3.7402356e+04 3.00e-03 2.28e+05 -1.0 5.36e+04 - 9.92e-01 5.11e-02f 1
36 -3.9912672e+04 1.63e-03 1.24e+05 -1.0 1.19e+05 - 1.00e+00 4.56e-01f 1
37 -4.2915594e+04 1.16e-10 1.00e-06 -1.0 3.63e+04 - 1.00e+00 1.00e+00f 1
38 -4.3385940e+04 2.33e-10 9.73e+05 -5.7 1.68e+04 - 8.37e-01 9.34e-01f 1
39 -4.3437768e+04 2.33e-10 1.05e+06 -5.7 1.89e+05 - 3.50e-01 9.80e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -4.3440141e+04 2.33e-10 1.38e+05 -5.7 7.71e+04 - 8.68e-01 8.20e-01f 1
41 -4.3440664e+04 1.16e-10 1.71e+04 -5.7 2.50e+04 - 8.74e-01 7.62e-01f 1
42 -4.3440807e+04 2.33e-10 7.04e+00 -5.7 4.95e+03 - 1.00e+00 9.96e-01f 1
43 -4.3440807e+04 2.33e-10 1.85e-11 -5.7 1.83e+01 - 1.00e+00 1.00e+00f 1
44 -4.3440816e+04 2.33e-10 9.38e-13 -7.0 2.55e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 44
(scaled) (unscaled)
Objective...............: -4.3440815763750425e+02 -4.3440815763750426e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 1.2653084928110924e-07 1.2653084928110923e-05
Overall NLP error.......: 1.2653084928110924e-07 1.2653084928110923e-05
Number of objective function evaluations = 45
Number of objective gradient evaluations = 45
Number of equality constraint evaluations = 45
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 45
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 44
Total CPU secs in IPOPT (w/o function evaluations) = 0.030
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 57898.87
Variable costs: 21077.63
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 180.69
Simulating time_step 2020-07-12 03:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -4.0542027e+04 2.91e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -4.0583936e+04 2.91e+05 9.90e+01 -1.0 2.60e+04 - 2.02e-04 1.94e-04h 1
2 -3.8388327e+04 2.91e+05 1.00e+02 -1.0 2.56e+04 - 1.94e-04 8.73e-04h 1
3 -3.2402061e+04 2.90e+05 1.01e+02 -1.0 1.71e+04 - 8.27e-04 1.93e-03h 1
4 -1.5343294e+04 2.89e+05 1.00e+02 -1.0 4.26e+03 - 2.72e-03 5.07e-03h 1
5 1.2846389e+04 2.86e+05 9.96e+01 -1.0 6.41e+03 - 8.74e-03 8.27e-03h 1
6 3.6475734e+04 2.84e+05 9.77e+01 -1.0 2.13e+04 - 1.29e-02 6.93e-03h 1
7 4.3566455e+04 2.84e+05 1.39e+02 -1.0 2.06e+05 - 5.47e-02 2.06e-03h 1
8 1.5759532e+05 2.74e+05 9.39e+01 -1.0 1.85e+05 - 4.18e-03 3.29e-02h 1
9 1.6875449e+05 2.74e+05 2.56e+02 -1.0 1.31e+05 - 8.20e-02 3.30e-03h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.7251106e+06 1.53e+05 2.02e+02 -1.0 2.87e+04 - 1.92e-02 4.42e-01h 1
11 1.8469033e+06 1.43e+05 1.08e+02 -1.0 1.61e+04 - 4.23e-01 6.25e-02h 1
12 3.6149589e+06 1.43e+03 9.81e+01 -1.0 1.48e+04 - 4.02e-01 9.90e-01h 1
13 3.5040370e+06 2.75e+02 1.04e+03 -1.0 1.31e+04 - 2.97e-01 8.08e-01f 1
14 3.2586648e+06 2.46e+00 6.04e+03 -1.0 2.31e+04 - 4.22e-01 9.91e-01f 1
15 2.9016917e+06 9.39e-01 5.11e+05 -1.0 4.77e+04 - 1.38e-01 6.18e-01f 1
16 2.9000023e+06 9.37e-01 4.41e+05 -1.0 5.63e+04 - 3.13e-02 1.95e-03f 1
17 2.6712207e+06 5.94e-01 9.89e+05 -1.0 5.80e+04 - 5.96e-02 3.66e-01f 1
18 2.6652530e+06 5.92e-01 9.78e+05 -1.0 6.20e+04 - 6.06e-03 3.89e-03f 1
19 2.6634655e+06 5.92e-01 9.58e+05 -1.0 7.98e+04 - 7.15e-03 9.55e-04f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 2.6434549e+06 5.85e-01 8.66e+05 -1.0 9.02e+04 - 3.61e-02 1.03e-02f 1
21 2.6243336e+06 5.78e-01 8.87e+05 -1.0 8.67e+04 - 1.97e-03 1.19e-02f 1
22 2.4881056e+06 5.31e-01 9.57e+05 -1.0 8.61e+04 - 3.67e-02 8.13e-02f 1
23 2.4823042e+06 5.28e-01 5.96e+05 -1.0 6.41e+04 - 1.13e-01 5.93e-03f 1
24 2.3812047e+06 4.72e-01 1.80e+05 -1.0 7.05e+04 - 2.17e-01 1.07e-01f 1
25 2.2861190e+06 4.27e-01 3.00e+05 -1.0 7.33e+04 - 2.41e-01 9.44e-02f 1
26 1.9055708e+06 2.65e-01 5.04e+05 -1.0 7.36e+04 - 4.84e-01 3.80e-01f 1
27 1.0451942e+06 2.17e-02 7.36e+05 -1.0 1.47e+05 - 6.73e-01 9.18e-01f 1
28 1.0412175e+06 2.16e-02 1.75e+04 -1.0 4.17e+05 - 1.99e-01 3.23e-03f 1
29 9.9762302e+05 2.06e-02 2.62e+05 -1.0 3.99e+05 - 1.41e-01 4.75e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 9.7983299e+05 2.02e-02 2.12e+05 -1.0 4.41e+05 - 1.67e-03 1.91e-02f 1
31 8.9399728e+05 1.96e-02 1.34e+05 -1.0 1.96e+06 - 5.17e-04 2.84e-02f 1
32 7.9921642e+05 1.90e-02 3.27e+05 -1.0 1.96e+06 - 1.08e-01 3.17e-02f 1
33 7.1744915e+05 1.85e-02 4.50e+05 -1.0 1.78e+06 - 8.57e-02 2.88e-02f 1
34 7.1456692e+05 1.84e-02 1.11e+06 -1.0 4.72e+05 - 3.12e-01 2.39e-03f 1
35 2.7283689e+05 1.17e-02 1.64e+05 -1.0 5.52e+05 - 3.99e-03 3.63e-01f 1
36 2.7110004e+05 1.17e-02 1.66e+05 -1.0 1.02e+06 - 2.28e-03 9.06e-04f 1
37 2.6476257e+05 1.16e-02 1.31e+06 -1.0 3.86e+05 - 7.52e-01 9.25e-03f 1
38 -3.1645023e+04 7.26e-03 9.26e+05 -1.0 4.21e+05 - 6.23e-01 3.75e-01f 1
39 -3.8277723e+04 3.50e-03 5.29e+05 -1.0 4.20e+03 - 9.87e-01 5.18e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -4.1630185e+04 1.16e-10 3.09e+01 -1.0 2.91e+04 - 9.95e-01 1.00e+00f 1
41 -4.2107867e+04 2.33e-10 2.94e+06 -3.8 5.46e+04 - 6.70e-01 9.64e-01f 1
42 -4.2137733e+04 1.16e-10 1.53e+06 -3.8 2.53e+05 - 5.32e-01 9.68e-01f 1
43 -4.2145314e+04 2.33e-10 1.20e+06 -3.8 2.50e+05 - 2.23e-01 5.49e-01f 1
44 -4.2149231e+04 2.33e-10 3.16e+05 -3.8 1.37e+05 - 7.36e-01 8.66e-01f 1
45 -4.2150758e+04 2.33e-10 2.72e+01 -3.8 6.38e+04 - 1.00e+00 9.73e-01f 1
46 -4.2150734e+04 2.33e-10 1.50e-09 -3.8 1.50e+03 - 1.00e+00 1.00e+00f 1
47 -4.2151531e+04 1.16e-10 1.87e+03 -5.7 2.07e+03 - 1.00e+00 8.74e-01f 1
48 -4.2151615e+04 4.66e-10 2.94e+02 -5.7 2.68e+02 - 8.93e-01 1.00e+00f 1
49 -4.2151614e+04 1.16e-10 1.85e-11 -5.7 1.15e-02 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
50 -4.2151624e+04 2.33e-10 9.24e-13 -7.0 2.46e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 50
(scaled) (unscaled)
Objective...............: -4.2151623537705115e+02 -4.2151623537705113e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 1.2391549548197348e-07 1.2391549548197347e-05
Overall NLP error.......: 1.2391549548197348e-07 1.2391549548197347e-05
Number of objective function evaluations = 51
Number of objective gradient evaluations = 51
Number of equality constraint evaluations = 51
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 51
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 50
Total CPU secs in IPOPT (w/o function evaluations) = 0.029
Total CPU secs in NLP function evaluations = 0.010
EXIT: Optimal Solution Found.
Fixed costs: 58782.87
Variable costs: 17604.13
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 154.86
Simulating time_step 2020-07-12 04:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.9301934e+04 2.91e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.9343888e+04 2.91e+05 9.90e+01 -1.0 2.60e+04 - 2.02e-04 1.94e-04h 1
2 -3.7848384e+04 2.91e+05 1.00e+02 -1.0 2.56e+04 - 2.15e-04 8.68e-04h 1
3 -3.2910943e+04 2.90e+05 1.01e+02 -1.0 1.67e+04 - 8.15e-04 1.99e-03h 1
4 -1.8535438e+04 2.89e+05 1.00e+02 -1.0 4.49e+03 - 2.79e-03 5.26e-03h 1
5 5.2002164e+03 2.86e+05 9.95e+01 -1.0 6.89e+03 - 9.12e-03 8.57e-03h 1
6 2.3741468e+04 2.84e+05 9.71e+01 -1.0 2.43e+04 - 2.14e-02 6.72e-03h 1
7 3.2606175e+04 2.83e+05 2.59e+02 -1.0 2.11e+05 - 1.09e-01 3.30e-03h 1
8 1.5110504e+05 2.70e+05 2.36e+02 -1.0 1.12e+05 - 3.46e-02 4.63e-02h 1
9 2.2552333e+05 2.62e+05 2.33e+02 -1.0 2.80e+04 - 6.38e-02 3.18e-02h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.7139888e+06 8.83e+04 2.12e+02 -1.0 2.88e+04 - 8.86e-02 6.62e-01h 1
11 2.2549467e+06 2.24e+04 1.38e+02 -1.0 9.81e+03 - 4.54e-01 7.46e-01h 1
12 2.3543932e+06 8.08e+02 1.40e+02 -1.0 5.92e+03 - 2.62e-01 9.64e-01h 1
13 2.2293966e+06 7.79e+00 2.30e+03 -1.0 7.58e+03 - 3.51e-01 9.90e-01f 1
14 1.9933503e+06 1.75e-10 3.54e+05 -1.0 1.37e+04 - 1.62e-02 1.00e+00f 1
15 1.7255913e+06 2.33e-10 5.41e+06 -1.0 1.71e+04 - 4.58e-01 1.00e+00f 1
16 1.7118570e+06 3.49e-10 5.01e+06 -1.0 3.14e+04 - 7.38e-02 1.89e-02f 1
17 1.7107680e+06 3.49e-10 4.97e+06 -1.0 3.39e+04 - 7.66e-03 1.80e-03f 1
18 1.6386358e+06 4.66e-10 4.97e+06 -1.0 5.87e+04 - 1.17e-03 5.70e-02f 1
19 1.6372785e+06 4.66e-10 4.89e+06 -1.0 8.07e+04 - 1.66e-02 7.69e-04f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.5917938e+06 3.49e-10 3.83e+06 -1.0 8.88e+04 - 2.17e-01 3.07e-02f 1
21 1.4870945e+06 3.49e-10 3.82e+06 -1.0 8.19e+04 - 2.93e-03 6.82e-02f 1
22 1.4783473e+06 3.49e-10 3.74e+06 -1.0 5.61e+04 - 2.00e-02 7.34e-03f 1
23 1.4758241e+06 2.33e-10 1.72e+06 -1.0 4.59e+04 - 5.41e-01 4.21e-03f 1
24 1.4344260e+06 2.91e-10 9.08e+05 -1.0 9.71e+04 - 4.71e-01 4.94e-02f 1
25 1.4306205e+06 2.33e-10 2.81e+05 -1.0 8.31e+04 - 6.91e-01 1.18e-02f 1
26 1.2711514e+06 2.33e-10 2.74e+05 -1.0 3.21e+05 - 2.24e-02 2.24e-01f 1
27 1.2671204e+06 2.33e-10 2.74e+05 -1.0 6.89e+05 - 3.49e-04 2.88e-03f 1
28 1.2126543e+06 2.33e-10 2.56e+05 -1.0 2.01e+06 - 6.63e-02 2.02e-02f 1
29 1.0488992e+06 4.66e-10 2.50e+05 -1.0 1.87e+06 - 2.26e-02 6.43e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 1.0394006e+06 4.66e-10 1.76e+05 -1.0 1.56e+06 - 2.95e-01 4.33e-03f 1
31 1.0149527e+06 4.66e-10 1.11e+05 -1.0 2.74e+05 - 3.70e-01 3.55e-02f 1
32 6.8030675e+05 3.49e-10 1.10e+05 -1.0 4.47e+05 - 5.91e-03 3.48e-01f 1
33 6.7836203e+05 4.66e-10 1.10e+05 -1.0 9.68e+05 - 2.77e-03 1.12e-03f 1
34 6.7575190e+05 4.66e-10 5.34e+04 -1.0 4.41e+05 - 5.15e-01 4.79e-03f 1
35 4.5067743e+05 5.82e-10 2.76e+04 -1.0 8.12e+05 - 4.84e-01 2.36e-01f 1
36 4.4739988e+05 5.82e-10 1.24e+04 -1.0 8.53e+05 - 5.50e-01 3.32e-03f 1
37 1.7754501e+05 3.49e-10 6.29e+03 -1.0 8.37e+05 - 4.93e-01 2.79e-01f 1
38 1.7454702e+05 3.49e-10 5.70e+03 -1.0 5.30e+05 - 9.38e-02 4.86e-03f 1
39 -2.4638493e+04 1.16e-10 3.43e+03 -1.0 4.74e+05 - 3.98e-01 3.58e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -3.0912465e+04 2.33e-10 8.12e+02 -1.0 9.42e+03 - 9.87e-01 2.29e-01f 1
41 -4.5119923e+04 1.16e-10 3.00e+06 -1.7 9.25e+03 - 6.19e-01 9.94e-01f 1
42 -4.5133206e+04 3.49e-10 7.47e+05 -1.7 1.06e+05 - 7.40e-01 1.13e-01f 1
43 -4.5200958e+04 1.16e-10 1.70e+04 -1.7 8.37e+03 - 1.00e+00 6.27e-01f 1
44 -4.5240315e+04 2.33e-10 2.00e-07 -1.7 7.04e+03 - 1.00e+00 1.00e+00f 1
45 -4.5311777e+04 2.33e-10 9.37e+04 -5.7 7.33e+02 - 9.11e-01 8.64e-01f 1
46 -4.5323841e+04 3.49e-10 2.23e+04 -5.7 2.16e+04 - 9.77e-01 9.02e-01f 1
47 -4.5324987e+04 3.49e-10 2.14e+03 -5.7 1.31e+03 - 9.63e-01 9.13e-01f 1
48 -4.5325066e+04 2.33e-10 2.56e+02 -5.7 1.13e+02 - 8.73e-01 9.35e-01f 1
49 -4.5325071e+04 1.16e-10 1.85e-11 -5.7 7.34e+00 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
50 -4.5325079e+04 1.16e-10 9.24e-13 -7.0 2.63e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 50
(scaled) (unscaled)
Objective...............: -4.5325079058051688e+02 -4.5325079058051684e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 3.2429528882481619e-07 3.2429528882481617e-05
Overall NLP error.......: 3.2429528882481619e-07 3.2429528882481617e-05
Number of objective function evaluations = 51
Number of objective gradient evaluations = 51
Number of equality constraint evaluations = 51
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 51
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 50
Total CPU secs in IPOPT (w/o function evaluations) = 0.038
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 58758.87
Variable costs: 12604.91
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 306.10
Simulating time_step 2020-07-12 05:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -4.2373290e+04 4.19e+04 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -4.2455342e+04 4.19e+04 9.90e+01 -1.0 2.60e+04 - 4.12e-04 3.82e-04f 1
2 -4.1073630e+04 4.18e+04 9.98e+01 -1.0 2.22e+04 - 4.75e-04 1.38e-03h 1
3 -3.6003236e+04 4.17e+04 1.00e+02 -1.0 7.75e+03 - 1.06e-03 3.17e-03h 1
4 -2.4363039e+04 4.14e+04 1.00e+02 -1.0 2.57e+03 - 3.98e-03 6.71e-03h 1
5 1.4758518e+04 4.05e+04 9.97e+01 -1.0 2.40e+03 - 1.33e-02 2.21e-02h 1
6 1.2373352e+05 3.80e+04 8.98e+01 -1.0 2.40e+03 - 1.58e-01 6.22e-02h 1
7 6.7848617e+05 2.50e+04 8.61e+01 -1.0 2.75e+03 - 1.19e-01 3.41e-01h 1
8 1.2973579e+06 1.01e+04 6.63e+01 -1.0 3.17e+03 - 3.76e-01 5.95e-01h 1
9 1.4161009e+06 6.49e+03 4.06e+01 -1.0 5.11e+03 - 3.80e-01 3.59e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.4180918e+06 6.39e+03 2.94e+01 -1.0 8.07e+03 - 3.91e-01 1.44e-02h 1
11 1.4329901e+06 3.85e+03 2.39e+01 -1.0 1.50e+04 - 1.58e-01 3.97e-01h 1
12 1.4275008e+06 3.71e+03 2.64e+01 -1.0 1.42e+04 - 2.91e-01 3.82e-02f 1
13 1.1665263e+06 1.24e+03 6.03e+01 -1.0 2.61e+04 - 5.77e-02 6.65e-01f 1
14 1.1650737e+06 1.24e+03 4.96e+01 -1.0 3.71e+04 - 8.62e-02 1.81e-03f 1
15 1.1337858e+06 1.17e+03 4.50e+01 -1.0 4.07e+04 - 1.13e-02 5.60e-02f 1
16 1.1153738e+06 1.13e+03 4.26e+01 -1.0 4.10e+04 - 1.42e-01 3.30e-02f 1
17 9.9861435e+05 9.20e+02 3.53e+01 -1.0 4.65e+04 - 1.80e-01 1.86e-01f 1
18 9.2269479e+05 8.15e+02 1.56e+02 -1.0 4.86e+04 - 4.68e-01 1.14e-01f 1
19 9.2172077e+05 8.14e+02 2.60e+02 -1.0 4.77e+04 - 2.05e-01 1.60e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 6.3861247e+05 6.74e+01 1.94e+02 -1.0 5.96e+04 - 4.99e-01 9.17e-01f 1
21 6.3664819e+05 6.70e+01 2.08e+03 -1.0 1.21e+05 - 3.72e-01 6.10e-03f 1
22 6.1107712e+05 6.29e+01 5.60e+03 -1.0 1.94e+05 - 6.46e-01 6.20e-02f 1
23 4.9236459e+05 5.44e+01 4.96e+03 -1.0 5.55e+05 - 1.53e-01 1.35e-01f 1
24 5.8318893e+04 3.01e+01 6.71e+02 -1.0 6.12e+05 - 1.89e-03 4.46e-01f 1
25 5.4487093e+04 3.00e+01 4.26e+03 -1.0 4.73e+05 - 3.59e-01 3.56e-03f 1
26 5.2631227e+04 2.98e+01 1.52e+04 -1.0 1.88e+05 - 7.93e-01 8.16e-03f 1
27 -3.4083581e+04 1.56e+01 1.36e+04 -1.0 1.51e+05 - 8.78e-01 4.74e-01f 1
28 -3.9252244e+04 7.41e+00 1.79e+04 -1.0 1.66e+04 - 9.57e-01 5.26e-01f 1
29 -4.3539655e+04 3.26e-02 3.25e+02 -1.0 6.92e+04 - 1.00e+00 9.96e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -4.3550937e+04 2.40e-02 4.09e+06 -1.0 4.01e+05 - 1.00e+00 2.65e-01f 1
31 -4.3556468e+04 1.20e-02 3.42e+06 -1.0 6.10e+04 - 1.00e+00 5.00e-01f 2
32 -4.3562795e+04 2.33e-10 1.00e-06 -1.0 1.83e+04 - 1.00e+00 1.00e+00h 1
33 -4.3939225e+04 1.16e-10 2.50e+05 -5.7 8.78e+03 - 8.85e-01 9.11e-01f 1
34 -4.3988573e+04 2.33e-10 4.36e+05 -5.7 1.62e+05 - 5.40e-01 9.15e-01f 1
35 -4.3992440e+04 1.16e-10 1.25e+05 -5.7 1.18e+04 - 7.32e-01 8.42e-01f 1
36 -4.3992984e+04 1.16e-10 1.93e+03 -5.7 1.32e+03 - 9.99e-01 8.25e-01f 1
37 -4.3993070e+04 2.33e-10 3.07e+02 -5.7 1.99e+02 - 8.82e-01 9.77e-01f 1
38 -4.3993071e+04 2.33e-10 1.85e-11 -5.7 4.60e+00 - 1.00e+00 1.00e+00f 1
39 -4.3993080e+04 2.33e-10 9.38e-13 -7.0 2.55e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 39
(scaled) (unscaled)
Objective...............: -4.3993079649399033e+02 -4.3993079649399035e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 3.1738550573582929e-07 3.1738550573582927e-05
Overall NLP error.......: 3.1738550573582929e-07 3.1738550573582927e-05
Number of objective function evaluations = 41
Number of objective gradient evaluations = 40
Number of equality constraint evaluations = 41
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 40
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 39
Total CPU secs in IPOPT (w/o function evaluations) = 0.029
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 59450.87
Variable costs: 9104.79
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 172.10
Simulating time_step 2020-07-12 06:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -4.1091691e+04 2.91e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -4.1173738e+04 2.91e+05 9.90e+01 -1.0 2.60e+04 - 4.12e-04 3.82e-04h 1
2 -3.9838452e+04 2.91e+05 9.98e+01 -1.0 2.22e+04 - 4.75e-04 1.38e-03h 1
3 -3.4958051e+04 2.90e+05 1.00e+02 -1.0 1.01e+04 - 1.06e-03 3.17e-03h 1
4 -2.4190617e+04 2.88e+05 1.00e+02 -1.0 5.31e+03 - 3.46e-03 6.34e-03h 1
5 -4.0622839e+03 2.85e+05 9.93e+01 -1.0 9.51e+03 - 1.12e-02 1.16e-02h 1
6 -2.0961842e+03 2.84e+05 3.35e+02 -1.0 1.95e+05 - 1.48e-01 1.10e-03h 1
7 3.2108850e+05 2.38e+05 2.81e+02 -1.0 3.18e+04 - 1.15e-03 1.62e-01h 1
8 6.9868482e+05 1.84e+05 2.25e+02 -1.0 2.46e+04 - 1.82e-01 2.26e-01h 1
9 1.1989142e+06 1.11e+05 1.43e+02 -1.0 1.93e+04 - 3.60e-01 3.96e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.2701802e+06 9.97e+04 7.74e+01 -1.0 1.13e+04 - 4.10e-01 1.05e-01h 1
11 1.7546872e+06 9.97e+02 8.18e+01 -1.0 1.38e+04 - 2.71e-01 9.90e-01h 1
12 1.4114882e+06 9.68e+00 1.68e+03 -1.0 2.18e+04 - 4.13e-01 9.90e-01f 1
13 1.0976495e+06 5.09e+00 9.35e+04 -1.0 4.93e+04 - 1.57e-01 4.75e-01f 1
14 1.0949584e+06 5.07e+00 7.45e+04 -1.0 5.57e+04 - 3.82e-02 3.50e-03f 1
15 1.0775082e+06 4.93e+00 5.74e+04 -1.0 3.88e+04 - 5.44e-02 2.64e-02f 1
16 1.0691307e+06 4.88e+00 1.94e+05 -1.0 4.06e+04 - 4.66e-01 1.20e-02f 1
17 8.6303734e+05 3.89e+00 7.21e+04 -1.0 6.51e+04 - 5.13e-02 2.03e-01f 1
18 8.6078871e+05 3.87e+00 4.07e+05 -1.0 4.91e+04 - 5.02e-01 2.70e-03f 1
19 8.4460560e+05 3.73e+00 4.22e+05 -1.0 7.02e+04 - 8.47e-02 3.73e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 8.3652764e+05 3.64e+00 9.53e+05 -1.0 7.95e+04 - 8.37e-01 2.53e-02f 1
21 7.3683822e+05 3.32e+00 8.28e+05 -1.0 4.41e+05 - 1.96e-02 8.62e-02f 1
22 7.3299112e+05 3.31e+00 1.11e+06 -1.0 5.41e+05 - 4.13e-01 3.58e-03f 1
23 1.7191794e+05 2.05e+00 4.34e+05 -1.0 8.35e+05 - 5.90e-03 3.81e-01f 1
24 1.6370536e+05 2.04e+00 4.38e+05 -1.0 6.21e+05 - 1.12e-02 5.05e-03f 1
25 1.5420654e+05 2.03e+00 6.89e+05 -1.0 4.90e+05 - 2.50e-01 6.64e-03f 1
26 7.5182727e+04 1.94e+00 6.25e+05 -1.0 7.84e+05 - 9.20e-03 4.33e-02f 1
27 7.4274359e+04 1.94e+00 9.39e+05 -1.0 4.96e+05 - 2.99e-01 7.14e-04f 1
28 3.8931628e+04 1.80e+00 1.50e+06 -1.0 3.79e+05 - 6.93e-01 7.17e-02f 1
29 3.6377701e+04 1.74e+00 1.91e+06 -1.0 4.70e+04 - 4.83e-01 2.94e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -3.9199812e+04 1.25e-02 3.81e+05 -1.0 6.11e+04 - 5.74e-01 9.93e-01f 1
31 -3.9887951e+04 2.33e-10 3.66e+05 -1.0 3.09e+04 - 9.37e-01 1.00e+00f 1
32 -3.9877550e+04 1.16e-10 6.88e+04 -1.0 4.58e+04 - 8.88e-01 1.00e+00f 1
33 -3.9888672e+04 1.16e-10 4.62e+04 -1.0 3.55e+05 - 3.28e-01 6.59e-01f 1
34 -3.9864628e+04 4.66e-10 6.62e+02 -1.0 2.12e+05 - 9.86e-01 1.00e+00f 1
35 -4.0190808e+04 4.66e-10 6.05e+05 -1.7 4.97e+04 - 9.24e-01 1.00e+00f 1
36 -4.0201452e+04 1.16e-10 4.61e+00 -1.7 3.46e+05 - 1.00e+00 5.00e-01f 2
37 -4.0301216e+04 2.33e-10 6.78e+05 -3.8 1.73e+05 - 6.58e-01 1.00e+00f 1
38 -4.0311055e+04 2.33e-10 4.50e+04 -3.8 1.42e+05 - 9.34e-01 9.08e-01f 1
39 -4.0311159e+04 1.16e-10 5.93e+01 -3.8 4.93e+03 - 1.00e+00 4.79e-01f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -4.0311242e+04 1.16e-10 1.50e-09 -3.8 8.80e+02 - 1.00e+00 1.00e+00f 1
41 -4.0311926e+04 1.16e-10 1.67e+03 -5.7 2.06e+03 - 9.86e-01 8.74e-01f 1
42 -4.0312008e+04 1.16e-10 2.96e+02 -5.7 2.89e+02 - 8.93e-01 1.00e+00f 1
43 -4.0312007e+04 2.33e-10 1.85e-11 -5.7 1.22e-01 - 1.00e+00 1.00e+00f 1
44 -4.0312015e+04 2.33e-10 9.38e-13 -7.0 2.46e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 44
(scaled) (unscaled)
Objective...............: -4.0312015462612806e+02 -4.0312015462612806e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 1.2387929298377143e-07 1.2387929298377142e-05
Overall NLP error.......: 1.2387929298377143e-07 1.2387929298377142e-05
Number of objective function evaluations = 47
Number of objective gradient evaluations = 45
Number of equality constraint evaluations = 47
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 45
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 44
Total CPU secs in IPOPT (w/o function evaluations) = 0.034
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
Fixed costs: 58646.87
Variable costs: 1667.73
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 391.40
Simulating time_step 2020-07-12 07:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.7459726e+04 2.91e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.7542148e+04 2.91e+05 9.90e+01 -1.0 2.60e+04 - 4.12e-04 3.82e-04h 1
2 -3.6001848e+04 2.91e+05 9.98e+01 -1.0 2.22e+04 - 4.75e-04 1.38e-03h 1
3 -3.0152446e+04 2.90e+05 1.00e+02 -1.0 1.01e+04 - 1.06e-03 3.17e-03h 1
4 -2.4555645e+03 2.86e+05 1.02e+02 -1.0 4.57e+03 - 3.46e-03 1.37e-02h 1
5 6.9188257e+03 2.84e+05 9.75e+01 -1.0 2.12e+04 - 2.21e-02 4.58e-03h 1
6 1.2426578e+04 2.84e+05 2.78e+02 -1.0 2.06e+05 - 1.05e-01 2.80e-03h 1
7 3.4343734e+04 2.80e+05 2.91e+02 -1.0 9.14e+04 - 3.14e-02 1.20e-02h 1
8 3.4573584e+04 2.80e+05 3.05e+02 -1.0 9.40e+04 - 1.68e-02 1.26e-04h 1
9 1.1020060e+05 2.70e+05 2.39e+02 -1.0 1.40e+05 - 8.39e-05 3.76e-02h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.7712428e+05 2.48e+05 2.18e+02 -1.0 2.73e+04 - 3.73e-02 8.09e-02h 1
11 2.1473907e+06 2.49e+03 1.37e+02 -1.0 2.61e+04 - 1.34e-01 9.90e-01h 1
12 2.1066946e+06 1.28e+03 2.88e+02 -1.0 3.35e+03 - 2.44e-01 4.85e-01f 1
13 1.9779763e+06 1.25e+01 1.17e+03 -1.0 4.39e+03 - 4.79e-01 9.90e-01f 1
14 1.6927136e+06 2.33e-10 1.47e+05 -1.0 8.01e+03 - 3.54e-01 1.00e+00f 1
15 1.5875319e+06 3.49e-10 1.97e+06 -1.0 1.42e+04 - 4.33e-01 2.23e-01f 1
16 1.0684466e+06 1.75e-10 1.88e+06 -1.0 3.03e+04 - 7.98e-02 5.66e-01f 1
17 1.0630674e+06 2.33e-10 1.57e+06 -1.0 3.80e+04 - 6.47e-02 5.70e-03f 1
18 1.0610184e+06 2.33e-10 1.41e+06 -1.0 4.02e+04 - 3.37e-02 2.89e-03f 1
19 9.9426938e+05 3.49e-10 1.14e+06 -1.0 4.14e+04 - 1.24e-01 9.31e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 8.2994463e+05 2.33e-10 1.18e+06 -1.0 4.45e+04 - 1.48e-01 2.19e-01f 1
21 8.2825819e+05 3.49e-10 7.23e+05 -1.0 4.05e+04 - 5.46e-01 2.40e-03f 1
22 8.0439032e+05 4.66e-10 8.35e+05 -1.0 5.47e+04 - 1.53e-01 5.66e-02f 1
23 8.0097358e+05 2.33e-10 1.36e+06 -1.0 6.48e+04 - 4.08e-01 1.12e-02f 1
24 5.7481221e+05 2.33e-10 2.50e+05 -1.0 1.10e+05 - 1.16e-01 5.57e-01f 1
25 5.7243074e+05 2.91e-10 7.82e+05 -1.0 1.26e+05 - 7.66e-01 6.98e-03f 1
26 1.3863239e+05 2.33e-10 4.04e+05 -1.0 5.59e+05 - 1.79e-01 4.30e-01f 1
27 1.3400227e+05 3.49e-10 4.07e+05 -1.0 5.67e+05 - 4.52e-02 4.88e-03f 1
28 1.2850219e+05 2.33e-10 4.04e+05 -1.0 5.74e+05 - 7.72e-04 6.85e-03f 1
29 6.4394542e+02 4.66e-10 3.82e+05 -1.0 5.63e+05 - 3.65e-01 1.30e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -6.2601456e+02 4.66e-10 3.87e+05 -1.0 5.37e+05 - 6.65e-02 1.09e-03f 1
31 -3.1815003e+03 4.66e-10 4.09e+05 -1.0 3.77e+03 - 6.90e-01 6.56e-02f 1
32 -3.2633321e+04 1.16e-10 7.34e+04 -1.0 3.53e+03 - 9.63e-01 8.28e-01f 1
33 -3.8619364e+04 2.33e-10 7.40e+01 -1.0 1.99e+04 - 9.16e-01 1.00e+00f 1
34 -3.9001454e+04 2.33e-10 5.08e+06 -2.5 2.48e+04 - 4.77e-01 1.00e+00f 1
35 -3.9010364e+04 2.33e-10 5.05e+05 -2.5 6.81e+04 - 9.00e-01 1.00e+00f 1
36 -3.9021901e+04 1.16e-10 2.53e+05 -2.5 1.94e+05 - 5.00e-01 4.61e-01f 1
37 -3.9025795e+04 1.16e-10 1.09e+04 -2.5 1.88e+05 - 9.57e-01 2.69e-01f 1
38 -3.9026438e+04 2.33e-10 2.83e-08 -2.5 2.91e+04 - 1.00e+00 1.00e+00f 1
39 -3.9038896e+04 2.33e-10 1.86e+04 -5.7 5.64e+04 - 8.82e-01 8.16e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -3.9041326e+04 1.16e-10 6.21e+03 -5.7 7.03e+03 - 7.76e-01 9.76e-01f 1
41 -3.9041426e+04 1.16e-10 1.85e-11 -5.7 1.56e+03 - 1.00e+00 1.00e+00f 1
42 -3.9041434e+04 1.16e-10 9.24e-13 -7.0 1.93e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 42
(scaled) (unscaled)
Objective...............: -3.9041434477311168e+02 -3.9041434477311166e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 3.9441609154977104e-07 3.9441609154977102e-05
Overall NLP error.......: 3.9441609154977104e-07 3.9441609154977102e-05
Number of objective function evaluations = 43
Number of objective gradient evaluations = 43
Number of equality constraint evaluations = 43
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 43
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 42
Total CPU secs in IPOPT (w/o function evaluations) = 0.028
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 51898.87
Variable costs: 754.72
Renewables curtailment reported at t=1 - total= 28.98
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 75.01
Simulating time_step 2020-07-12 08:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.6238245e+04 2.16e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.6319946e+04 2.16e+05 9.90e+01 -1.0 2.60e+04 - 4.12e-04 3.82e-04h 1
2 -3.4678579e+04 2.15e+05 9.98e+01 -1.0 2.22e+04 - 4.75e-04 1.38e-03h 1
3 -2.6410627e+04 2.14e+05 1.01e+02 -1.0 1.01e+04 - 1.06e-03 4.08e-03h 1
4 -6.3236957e+03 2.12e+05 1.01e+02 -1.0 2.84e+03 - 4.16e-03 8.89e-03h 1
5 2.8927662e+04 2.09e+05 9.84e+01 -1.0 5.14e+03 - 2.01e-02 1.54e-02h 1
6 3.6694892e+04 2.08e+05 9.86e+01 -1.0 5.70e+04 - 7.67e-04 3.23e-03h 1
7 3.0244712e+05 1.85e+05 8.96e+01 -1.0 5.76e+04 - 1.00e-01 1.10e-01h 1
8 3.3994650e+05 1.82e+05 8.42e+01 -1.0 3.29e+04 - 1.04e-01 1.77e-02h 1
9 1.3480946e+06 9.37e+04 6.50e+01 -1.0 2.78e+04 - 3.09e-01 4.86e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.7210090e+06 5.76e+04 4.22e+01 -1.0 1.09e+04 - 5.30e-01 3.85e-01h 1
11 2.0474366e+06 5.76e+02 7.33e+01 -1.0 1.67e+04 - 2.93e-01 9.90e-01h 1
12 1.5374413e+06 5.55e+00 3.44e+03 -1.0 2.03e+04 - 7.18e-02 9.90e-01f 1
13 1.1454721e+06 1.78e+00 2.49e+05 -1.0 1.64e+04 - 1.71e-02 6.78e-01f 1
14 1.1416426e+06 1.77e+00 2.02e+05 -1.0 1.62e+04 - 4.24e-01 6.85e-03f 1
15 1.1054711e+06 1.68e+00 2.20e+05 -1.0 3.36e+04 - 7.96e-02 5.25e-02f 1
16 1.0712709e+06 1.60e+00 1.89e+05 -1.0 3.82e+04 - 2.44e-02 4.41e-02f 1
17 1.0077108e+06 1.47e+00 5.30e+05 -1.0 3.97e+04 - 4.01e-01 8.18e-02f 1
18 9.0400807e+05 1.34e+00 5.14e+05 -1.0 7.08e+04 - 1.15e-01 8.82e-02f 1
19 9.0068348e+05 1.34e+00 9.44e+05 -1.0 6.56e+04 - 3.57e-01 3.54e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 7.1341682e+05 1.07e+00 6.94e+05 -1.0 6.68e+04 - 1.43e-01 1.98e-01f 1
21 7.1126076e+05 1.07e+00 1.88e+06 -1.0 7.52e+04 - 8.68e-01 2.92e-03f 1
22 6.2009246e+05 9.97e-01 1.70e+06 -1.0 5.03e+05 - 2.86e-02 6.93e-02f 1
23 6.1562328e+05 9.93e-01 2.20e+06 -1.0 5.28e+05 - 4.09e-01 4.03e-03f 1
24 2.6077654e+05 7.50e-01 1.39e+06 -1.0 8.16e+05 - 6.02e-03 2.44e-01f 1
25 2.5518709e+05 7.48e-01 1.39e+06 -1.0 6.93e+05 - 7.90e-03 3.39e-03f 1
26 2.0571819e+05 7.21e-01 1.62e+06 -1.0 6.93e+05 - 2.32e-01 3.63e-02f 1
27 4.9593695e+04 6.54e-01 1.38e+06 -1.0 7.35e+05 - 2.52e-02 9.20e-02f 1
28 4.8029162e+04 6.54e-01 1.77e+06 -1.0 7.17e+05 - 2.62e-01 1.05e-03f 1
29 3.9113830e+04 5.84e-01 1.96e+06 -1.0 8.37e+03 - 3.73e-01 1.07e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -3.4284897e+04 6.45e-03 2.23e+04 -1.0 7.48e+03 - 9.58e-01 9.89e-01f 1
31 -3.4935321e+04 1.16e-10 1.37e+05 -1.0 9.35e+03 - 9.63e-01 1.00e+00f 1
32 -3.4931409e+04 1.16e-10 1.03e+05 -1.0 1.70e+05 - 5.85e-01 1.00e+00f 1
33 -3.4908448e+04 2.33e-10 1.49e+03 -1.0 2.26e+05 - 9.86e-01 1.00e+00f 1
34 -3.5233930e+04 2.33e-10 2.00e-07 -1.7 1.16e+05 - 1.00e+00 1.00e+00f 1
35 -3.5338680e+04 2.33e-10 6.09e+05 -5.7 3.48e+05 - 5.58e-01 8.62e-01f 1
36 -3.5356197e+04 1.16e-10 2.21e+05 -5.7 1.49e+05 - 6.92e-01 8.12e-01f 1
37 -3.5358876e+04 2.33e-10 3.85e+03 -5.7 3.13e+04 - 9.33e-01 7.24e-01f 1
38 -3.5359507e+04 1.16e-10 2.65e+01 -5.7 1.63e+03 - 9.50e-01 9.37e-01f 1
39 -3.5359534e+04 2.33e-10 1.85e-11 -5.7 2.07e+02 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -3.5359543e+04 2.33e-10 9.24e-13 -7.0 2.23e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 40
(scaled) (unscaled)
Objective...............: -3.5359542763540560e+02 -3.5359542763540558e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 3.9788054145068073e-07 3.9788054145068074e-05
Overall NLP error.......: 3.9788054145068073e-07 3.9788054145068074e-05
Number of objective function evaluations = 41
Number of objective gradient evaluations = 41
Number of equality constraint evaluations = 41
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 41
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 40
Total CPU secs in IPOPT (w/o function evaluations) = 0.028
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 51898.87
Variable costs: 791.62
Renewables curtailment reported at t=1 - total= 59.97
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 2.00
Simulating time_step 2020-07-12 09:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.2606752e+04 2.15e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.2688557e+04 2.15e+05 9.90e+01 -1.0 2.60e+04 - 4.12e-04 3.82e-04h 1
2 -3.1431110e+04 2.15e+05 9.98e+01 -1.0 2.22e+04 - 4.75e-04 1.38e-03h 1
3 -2.6013487e+04 2.14e+05 1.00e+02 -1.0 1.01e+04 - 1.06e-03 3.16e-03h 1
4 -8.1923049e+03 2.12e+05 1.01e+02 -1.0 2.77e+03 - 3.45e-03 8.96e-03h 1
5 2.4499424e+04 2.09e+05 9.90e+01 -1.0 3.46e+03 - 1.67e-02 1.61e-02h 1
6 2.9468708e+04 2.08e+05 9.91e+01 -1.0 5.01e+04 - 6.95e-04 2.30e-03h 1
7 2.7950855e+05 1.85e+05 8.49e+01 -1.0 4.53e+04 - 1.32e-01 1.15e-01h 1
8 2.9837452e+05 1.83e+05 9.20e+01 -1.0 1.84e+04 - 2.89e-02 9.78e-03h 1
9 1.2031178e+06 9.67e+04 1.48e+02 -1.0 2.06e+04 - 1.81e-03 4.71e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.4649925e+06 7.03e+04 9.48e+01 -1.0 9.76e+03 - 4.45e-01 2.72e-01h 1
11 2.0304596e+06 7.03e+02 5.52e+01 -1.0 7.26e+03 - 3.88e-01 9.90e-01h 1
12 1.6954800e+06 6.82e+00 1.62e+03 -1.0 7.98e+03 - 4.62e-01 9.90e-01f 1
13 1.4885100e+06 4.47e+00 4.34e+04 -1.0 1.72e+04 - 2.05e-01 3.44e-01f 1
14 1.4827943e+06 4.44e+00 6.44e+04 -1.0 2.41e+04 - 2.44e-01 8.16e-03f 1
15 1.1089266e+06 2.55e+00 1.47e+05 -1.0 3.28e+04 - 2.16e-02 4.26e-01f 1
16 1.0682396e+06 2.41e+00 1.11e+05 -1.0 3.12e+04 - 8.91e-02 5.19e-02f 1
17 1.0676964e+06 2.41e+00 2.60e+05 -1.0 2.06e+04 - 4.65e-01 7.85e-04f 1
18 8.5818831e+05 1.62e+00 1.86e+04 -1.0 3.22e+04 - 7.62e-02 3.28e-01f 1
19 8.5589456e+05 1.61e+00 6.13e+05 -1.0 3.87e+04 - 5.83e-01 4.58e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 6.0816900e+05 5.78e-01 2.79e+05 -1.0 9.29e+04 - 1.54e-01 6.42e-01f 1
21 6.0604507e+05 5.74e-01 1.47e+06 -1.0 1.12e+05 - 7.64e-01 7.23e-03f 1
22 2.6578163e+05 3.35e-01 4.67e+05 -1.0 4.92e+05 - 2.03e-01 4.17e-01f 1
23 2.6265177e+05 3.33e-01 6.72e+05 -1.0 5.28e+05 - 8.69e-02 3.88e-03f 1
24 2.6192077e+05 3.32e-01 6.65e+05 -1.0 5.61e+04 - 1.13e-03 3.28e-03f 1
25 4.8331430e+04 1.82e-01 1.34e+05 -1.0 2.90e+05 - 3.58e-01 4.53e-01f 1
26 4.6563255e+04 1.82e-01 5.82e+05 -1.0 6.91e+05 - 1.58e-01 2.23e-03f 1
27 3.9836444e+04 1.76e-01 1.87e+06 -1.0 1.92e+05 - 5.26e-01 3.00e-02f 1
28 -2.3230380e+04 1.41e-01 2.18e+06 -1.0 2.76e+05 - 5.61e-01 1.99e-01f 1
29 -2.3869839e+04 1.41e-01 3.23e+06 -1.0 1.54e+05 - 7.33e-01 3.58e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -3.2320827e+04 1.04e-02 3.84e+05 -1.0 3.24e+04 - 1.52e-01 9.26e-01f 1
31 -3.2822164e+04 1.79e-03 1.84e+05 -1.0 2.75e+03 - 7.26e-01 8.28e-01f 1
32 -3.2960262e+04 2.33e-10 3.40e+04 -1.0 9.49e+03 - 9.08e-01 1.00e+00f 1
33 -3.2957396e+04 4.66e-10 1.41e+04 -1.0 1.11e+05 - 6.19e-01 1.00e+00f 1
34 -3.2941376e+04 4.66e-10 4.15e+03 -1.0 2.21e+05 - 7.06e-01 1.00e+00f 1
35 -3.2912065e+04 1.16e-10 1.00e-06 -1.0 2.81e+05 - 1.00e+00 1.00e+00f 1
36 -3.3393632e+04 2.33e-10 2.73e+06 -5.7 1.95e+05 - 7.23e-01 9.96e-01f 1
37 -3.3419843e+04 4.66e-10 5.72e+05 -5.7 2.76e+05 - 7.92e-01 8.85e-01f 1
38 -3.3425401e+04 3.49e-10 1.73e+05 -5.7 1.58e+05 - 6.97e-01 7.58e-01f 1
39 -3.3425944e+04 1.16e-10 3.08e+04 -5.7 2.77e+04 - 8.20e-01 4.95e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -3.3426711e+04 1.16e-10 2.10e+02 -5.7 2.96e+04 - 9.93e-01 9.67e-01f 1
41 -3.3426733e+04 2.33e-10 1.85e-11 -5.7 9.96e+02 - 1.00e+00 1.00e+00f 1
42 -3.3426743e+04 4.66e-10 9.24e-13 -7.0 3.48e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 42
(scaled) (unscaled)
Objective...............: -3.3426742996097596e+02 -3.3426742996097593e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 4.6566128730773926e-10
Complementarity.........: 1.6209992550618188e-07 1.6209992550618189e-05
Overall NLP error.......: 1.6209992550618188e-07 1.6209992550618189e-05
Number of objective function evaluations = 43
Number of objective gradient evaluations = 43
Number of equality constraint evaluations = 43
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 43
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 42
Total CPU secs in IPOPT (w/o function evaluations) = 0.027
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 51898.87
Variable costs: 865.47
Renewables curtailment reported at t=1 - total= 70.61
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 4.00
Simulating time_step 2020-07-12 10:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.0623829e+04 2.15e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.0665317e+04 2.15e+05 9.90e+01 -1.0 2.60e+04 - 2.02e-04 1.94e-04h 1
2 -2.9186317e+04 2.15e+05 1.00e+02 -1.0 2.56e+04 - 2.15e-04 8.73e-04h 1
3 -2.4336659e+04 2.15e+05 1.00e+02 -1.0 1.66e+04 - 8.16e-04 1.80e-03h 1
4 -2.8843940e+03 2.13e+05 1.01e+02 -1.0 5.61e+03 - 1.72e-03 6.46e-03h 1
5 5.5273561e+04 2.10e+05 1.01e+02 -1.0 2.33e+03 - 7.52e-03 1.70e-02h 1
6 7.9407502e+04 2.08e+05 9.57e+01 -1.0 4.95e+03 - 4.18e-02 7.20e-03h 1
7 1.1277564e+05 2.06e+05 9.47e+01 -1.0 2.41e+04 - 8.28e-02 1.06e-02h 1
8 2.6480194e+06 3.82e+04 4.30e+02 -1.0 2.05e+04 - 7.25e-02 8.15e-01h 1
9 2.7801787e+06 2.76e+04 3.05e+02 -1.0 4.14e+03 - 2.27e-01 2.77e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.0527344e+06 2.76e+02 1.16e+02 -1.0 3.72e+03 - 3.11e-01 9.90e-01h 1
11 2.8734319e+06 4.96e+01 2.30e+03 -1.0 5.28e+03 - 5.27e-01 8.20e-01f 1
12 2.4210934e+06 2.82e-01 3.24e+04 -1.0 1.08e+04 - 2.44e-01 9.94e-01f 1
13 2.0055043e+06 7.41e-02 3.18e+06 -1.0 1.75e+04 - 3.84e-03 7.38e-01f 1
14 1.9982146e+06 7.31e-02 2.77e+05 -1.0 1.83e+04 - 3.99e-01 1.30e-02f 1
15 1.7468154e+06 4.83e-02 1.87e+06 -1.0 3.35e+04 - 1.60e-02 3.39e-01f 1
16 1.7410753e+06 4.81e-02 1.82e+06 -1.0 6.74e+04 - 1.19e-02 4.31e-03f 1
17 1.7377353e+06 4.80e-02 1.47e+06 -1.0 9.23e+04 - 6.48e-02 2.37e-03f 1
18 1.5421495e+06 4.14e-02 1.90e+06 -1.0 9.16e+04 - 1.88e-02 1.37e-01f 1
19 1.5150611e+06 4.06e-02 7.92e+05 -1.0 8.27e+04 - 2.19e-01 2.06e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.5125894e+06 4.05e-02 1.12e+06 -1.0 8.39e+04 - 4.36e-01 2.37e-03f 1
21 9.0603275e+05 1.83e-02 6.79e+05 -1.0 8.76e+04 - 1.21e-01 5.47e-01f 1
22 9.0233256e+05 1.82e-02 1.66e+06 -1.0 3.85e+04 - 8.61e-01 6.63e-03f 1
23 7.5419763e+05 1.55e-02 1.37e+06 -1.0 3.79e+05 - 5.73e-02 1.46e-01f 1
24 7.2799835e+05 1.50e-02 1.45e+06 -1.0 4.33e+05 - 2.67e-01 3.41e-02f 1
25 3.3646903e+05 9.50e-03 7.68e+05 -1.0 6.38e+05 - 3.54e-03 3.67e-01f 1
26 3.3105929e+05 9.47e-03 7.69e+05 -1.0 6.04e+05 - 1.37e-02 3.80e-03f 1
27 3.3086312e+05 9.47e-03 1.14e+06 -1.0 3.87e+05 - 9.00e-01 3.35e-04f 1
28 5.7453932e+03 7.95e-05 4.58e+04 -1.0 2.49e+05 - 1.38e-02 9.92e-01f 1
29 -3.2543664e+04 6.43e-06 2.25e+04 -1.0 3.77e+04 - 5.96e-01 9.19e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -3.2958887e+04 4.66e-10 1.05e+04 -1.0 4.44e+03 - 5.55e-01 1.00e+00f 1
31 -3.2939042e+04 1.16e-10 4.48e+03 -1.0 7.35e+03 - 5.73e-01 1.00e+00f 1
32 -3.2931686e+04 1.16e-10 1.66e+03 -1.0 1.30e+04 - 6.29e-01 1.00e+00f 1
33 -3.3311115e+04 3.49e-10 9.61e+05 -1.7 8.28e+03 - 8.80e-01 1.00e+00f 1
34 -3.3320453e+04 1.16e-10 3.47e+05 -1.7 6.31e+04 - 6.39e-01 1.00e+00f 1
35 -3.3334233e+04 2.33e-10 9.03e+04 -1.7 1.40e+05 - 7.40e-01 1.00e+00f 1
36 -3.3336462e+04 1.16e-10 5.23e+03 -1.7 1.19e+05 - 9.42e-01 4.79e-01f 1
37 -3.3327914e+04 2.33e-10 2.00e-07 -1.7 1.20e+05 - 1.00e+00 1.00e+00f 1
38 -3.3439164e+04 1.16e-10 2.83e+05 -5.7 2.45e+05 - 7.45e-01 8.86e-01f 1
39 -3.3452568e+04 1.16e-10 8.15e+04 -5.7 1.06e+05 - 7.35e-01 7.63e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -3.3455705e+04 2.33e-10 1.56e+04 -5.7 2.51e+04 - 8.27e-01 8.55e-01f 1
41 -3.3456168e+04 2.33e-10 1.89e+03 -5.7 1.07e+04 - 1.00e+00 7.58e-01f 1
42 -3.3456295e+04 2.33e-10 2.84e+02 -5.7 2.58e+03 - 8.94e-01 1.00e+00f 1
43 -3.3456292e+04 2.33e-10 1.85e-11 -5.7 1.10e-02 - 1.00e+00 1.00e+00f 1
44 -3.3456303e+04 1.16e-10 9.38e-13 -7.0 3.48e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 44
(scaled) (unscaled)
Objective...............: -3.3456302550352439e+02 -3.3456302550352440e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2437385165872740e-07 1.2437385165872740e-05
Overall NLP error.......: 1.2437385165872740e-07 1.2437385165872740e-05
Number of objective function evaluations = 45
Number of objective gradient evaluations = 45
Number of equality constraint evaluations = 45
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 45
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 44
Total CPU secs in IPOPT (w/o function evaluations) = 0.018
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 57810.87
Variable costs: 5253.53
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 250.44
Simulating time_step 2020-07-12 11:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.0654688e+04 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.0696073e+04 1.64e+05 9.90e+01 -1.0 1.80e+04 - 2.02e-04 1.94e-04h 1
2 -2.9191600e+04 1.64e+05 1.00e+02 -1.0 1.82e+04 - 2.15e-04 8.46e-04h 1
3 -2.4775448e+04 1.63e+05 1.00e+02 -1.0 1.60e+04 - 1.00e-03 1.79e-03h 1
4 -2.8928594e+03 1.62e+05 1.01e+02 -1.0 4.22e+03 - 1.63e-03 7.39e-03h 1
5 4.9775709e+04 1.59e+05 1.01e+02 -1.0 2.33e+03 - 8.50e-03 1.73e-02h 1
6 1.8341558e+05 1.52e+05 9.32e+01 -1.0 2.35e+03 - 6.22e-02 4.45e-02h 1
7 6.6761831e+05 1.26e+05 8.54e+01 -1.0 2.51e+03 - 1.26e-01 1.70e-01h 1
8 1.2875876e+06 9.30e+04 5.62e+01 -1.0 2.87e+03 - 3.41e-01 2.64e-01h 1
9 2.9253101e+06 9.30e+02 5.68e+01 -1.0 4.36e+03 - 4.58e-01 9.90e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.6886356e+06 9.14e+00 1.29e+03 -1.0 7.83e+03 - 2.56e-01 9.90e-01f 1
11 2.3494483e+06 3.49e-10 1.16e+05 -1.0 1.05e+04 - 3.40e-01 1.00e+00f 1
12 2.0727209e+06 2.33e-10 2.39e+06 -1.0 1.94e+04 - 3.31e-01 5.66e-01f 1
13 2.0653186e+06 3.49e-10 2.14e+06 -1.0 3.03e+04 - 4.33e-02 1.09e-02f 1
14 1.8859544e+06 1.16e-10 3.15e+06 -1.0 3.81e+04 - 8.92e-03 2.51e-01f 1
15 1.7302385e+06 1.16e-10 3.33e+06 -1.0 8.96e+04 - 1.69e-02 9.18e-02f 1
16 1.7125867e+06 1.16e-10 2.28e+06 -1.0 8.50e+04 - 1.75e-01 1.06e-02f 1
17 1.7011471e+06 3.49e-10 1.11e+06 -1.0 8.69e+04 - 2.31e-01 6.80e-03f 1
18 1.0679008e+06 1.16e-10 1.32e+06 -1.0 8.91e+04 - 2.05e-01 3.60e-01f 1
19 1.0613314e+06 1.16e-10 1.41e+06 -1.0 5.96e+04 - 8.78e-01 5.47e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.0342482e+06 2.33e-10 1.39e+06 -1.0 2.69e+05 - 3.81e-02 2.35e-02f 1
21 9.5077904e+05 4.66e-10 1.28e+06 -1.0 3.04e+05 - 3.70e-02 7.03e-02f 1
22 9.4628652e+05 3.49e-10 1.46e+06 -1.0 3.24e+05 - 5.46e-01 4.13e-03f 1
23 6.8499425e+05 3.49e-10 1.27e+06 -1.0 1.02e+06 - 5.14e-02 1.27e-01f 1
24 6.8218706e+05 3.49e-10 1.32e+06 -1.0 8.42e+05 - 3.84e-01 1.54e-03f 1
25 3.5827989e+05 3.49e-10 9.97e+05 -1.0 7.51e+05 - 3.55e-01 2.53e-01f 1
26 3.1551678e+05 3.49e-10 9.76e+05 -1.0 1.11e+06 - 1.72e-01 2.96e-02f 1
27 3.1476347e+05 3.49e-10 9.73e+05 -1.0 1.32e+05 - 1.52e-03 2.49e-03f 1
28 6.3534226e+04 2.33e-10 3.87e+05 -1.0 3.79e+05 - 3.14e-01 5.88e-01f 1
29 2.9395273e+04 2.33e-10 2.76e+05 -1.0 8.30e+04 - 6.52e-01 3.16e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -3.5265897e+04 1.16e-10 5.38e+03 -1.0 7.97e+04 - 3.91e-01 9.56e-01f 1
31 -3.6232215e+04 1.16e-10 2.73e+03 -1.0 7.78e+04 - 7.86e-01 6.61e-01f 1
32 -3.6415677e+04 2.33e-10 6.79e+02 -1.0 2.45e+04 - 3.75e-01 6.77e-01f 1
33 -3.6746958e+04 2.33e-10 2.89e+06 -1.7 3.45e+04 - 8.52e-01 4.91e-01f 1
34 -3.6952823e+04 3.49e-10 4.86e+05 -1.7 2.38e+04 - 5.89e-01 1.00e+00f 1
35 -3.6950081e+04 2.33e-10 1.71e+05 -1.7 4.55e+04 - 6.48e-01 1.00e+00f 1
36 -3.6944454e+04 2.33e-10 3.93e+04 -1.7 8.86e+04 - 7.70e-01 1.00e+00f 1
37 -3.6935818e+04 2.33e-10 1.22e+03 -1.7 1.35e+05 - 9.69e-01 1.00e+00f 1
38 -3.6929858e+04 2.33e-10 2.00e-07 -1.7 7.03e+04 - 1.00e+00 1.00e+00f 1
39 -3.7037302e+04 1.16e-10 5.94e+05 -5.7 2.74e+05 - 6.99e-01 9.96e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -3.7040757e+04 1.16e-10 9.36e+04 -5.7 1.26e+05 - 8.41e-01 7.35e-01f 1
41 -3.7041658e+04 1.16e-10 1.02e+04 -5.7 2.48e+04 - 8.90e-01 8.40e-01f 1
42 -3.7041811e+04 2.33e-10 3.50e+03 -5.7 6.95e+03 - 6.66e-01 1.00e+00f 1
43 -3.7041816e+04 1.16e-10 1.85e-11 -5.7 1.51e+02 - 1.00e+00 1.00e+00f 1
44 -3.7041825e+04 2.33e-10 9.24e-13 -7.0 3.58e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 44
(scaled) (unscaled)
Objective...............: -3.7041824886655951e+02 -3.7041824886655952e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 1.3193589306009337e-07 1.3193589306009336e-05
Overall NLP error.......: 1.3193589306009337e-07 1.3193589306009336e-05
Number of objective function evaluations = 45
Number of objective gradient evaluations = 45
Number of equality constraint evaluations = 45
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 45
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 44
Total CPU secs in IPOPT (w/o function evaluations) = 0.028
Total CPU secs in NLP function evaluations = 0.002
EXIT: Optimal Solution Found.
Fixed costs: 57502.87
Variable costs: 9355.40
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 212.06
Simulating time_step 2020-07-12 12:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.4142244e+04 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.4183287e+04 1.64e+05 9.90e+01 -1.0 2.53e+04 - 2.02e-04 1.94e-04h 1
2 -3.2571507e+04 1.64e+05 1.00e+02 -1.0 2.48e+04 - 2.15e-04 8.46e-04h 1
3 -2.7495955e+04 1.63e+05 1.00e+02 -1.0 1.53e+04 - 7.93e-04 1.79e-03h 1
4 -6.5023859e+03 1.62e+05 1.01e+02 -1.0 5.13e+03 - 1.74e-03 6.13e-03h 1
5 5.2387733e+04 1.60e+05 1.01e+02 -1.0 2.23e+03 - 7.19e-03 1.67e-02h 1
6 3.1679041e+05 1.48e+05 1.00e+02 -1.0 2.25e+03 - 4.08e-02 7.60e-02h 1
7 5.7650615e+05 1.36e+05 8.39e+01 -1.0 2.37e+03 - 1.26e-01 8.13e-02h 1
8 1.0985049e+06 1.11e+05 6.72e+01 -1.0 2.78e+03 - 3.30e-01 1.79e-01h 1
9 1.4701067e+06 9.35e+04 5.65e+01 -1.0 4.39e+03 - 5.01e-01 1.59e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.2406567e+06 9.35e+02 4.38e+01 -1.0 8.35e+03 - 1.91e-01 9.90e-01h 1
11 2.9183632e+06 9.19e+00 8.86e+02 -1.0 9.63e+03 - 4.84e-01 9.90e-01f 1
12 2.3759446e+06 3.44e-01 1.45e+05 -1.0 1.80e+04 - 1.36e-01 9.63e-01f 1
13 2.3661587e+06 3.39e-01 1.19e+05 -1.0 3.20e+04 - 9.59e-02 1.45e-02f 1
14 2.3634618e+06 3.38e-01 1.23e+05 -1.0 4.85e+04 - 3.51e-03 2.33e-03f 1
15 2.2252931e+06 3.08e-01 1.34e+05 -1.0 9.23e+04 - 1.10e-02 8.89e-02f 1
16 2.1977246e+06 3.02e-01 6.53e+04 -1.0 8.60e+04 - 7.62e-02 1.74e-02f 1
17 2.0051775e+06 2.67e-01 3.21e+05 -1.0 8.59e+04 - 1.96e-01 1.16e-01f 1
18 1.4604680e+06 1.86e-01 1.33e+05 -1.0 7.97e+04 - 1.97e-01 3.05e-01f 1
19 1.3385121e+06 1.70e-01 1.50e+06 -1.0 5.80e+04 - 5.17e-01 8.81e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.3366850e+06 1.69e-01 2.21e+06 -1.0 9.58e+04 - 2.39e-01 1.44e-03f 1
21 9.6991462e+05 1.08e-01 2.01e+06 -1.0 1.31e+05 - 5.89e-01 3.62e-01f 1
22 9.4538693e+05 1.06e-01 2.30e+06 -1.0 4.10e+05 - 1.61e-01 2.01e-02f 1
23 5.8256191e+05 7.83e-02 1.68e+06 -1.0 5.19e+05 - 2.51e-01 2.60e-01f 1
24 5.3492725e+05 7.66e-02 2.17e+06 -1.0 7.61e+05 - 2.85e-01 2.26e-02f 1
25 5.3152059e+05 7.64e-02 2.32e+06 -1.0 1.01e+06 - 1.02e-01 2.28e-03f 1
26 3.3439829e+05 6.62e-02 1.82e+06 -1.0 1.06e+06 - 1.19e-03 1.33e-01f 1
27 3.3134447e+05 6.61e-02 2.16e+06 -1.0 8.37e+05 - 2.26e-01 1.68e-03f 1
28 3.0005713e+05 6.25e-02 1.99e+06 -1.0 4.65e+05 - 9.83e-03 5.48e-02f 1
29 -8.1817779e+03 2.81e-02 1.42e+06 -1.0 4.59e+05 - 9.50e-01 5.50e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -3.2662238e+04 3.28e-03 1.47e+04 -1.0 3.13e+04 - 5.74e-01 8.83e-01f 1
31 -3.5896356e+04 2.33e-10 1.73e+05 -1.0 4.72e+04 - 3.97e-01 1.00e+00f 1
32 -3.6138947e+04 2.33e-10 5.93e+04 -1.0 3.33e+04 - 6.68e-01 1.00e+00f 1
33 -3.6203391e+04 1.16e-10 2.41e+04 -1.0 1.91e+04 - 5.94e-01 1.00e+00f 1
34 -3.6195858e+04 1.16e-10 9.77e+03 -1.0 4.41e+04 - 5.94e-01 1.00e+00f 1
35 -3.6195598e+04 2.33e-10 3.18e+03 -1.0 9.16e+04 - 6.74e-01 1.00e+00f 1
36 -3.6188800e+04 3.49e-10 6.83e+02 -1.0 1.60e+05 - 7.85e-01 1.00e+00f 1
37 -3.6517928e+04 2.33e-10 2.00e-07 -1.7 7.16e+04 - 1.00e+00 1.00e+00f 1
38 -3.6618568e+04 2.33e-10 5.52e+05 -5.7 3.92e+05 - 6.15e-01 8.91e-01f 1
39 -3.6629477e+04 1.16e-10 2.30e+05 -5.7 1.70e+05 - 6.08e-01 6.73e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -3.6634038e+04 2.33e-10 1.82e+03 -5.7 4.40e+04 - 9.33e-01 7.43e-01f 1
41 -3.6635267e+04 2.33e-10 2.92e+03 -5.7 1.85e+04 - 7.46e-01 8.81e-01f 1
42 -3.6635410e+04 1.16e-10 5.11e+02 -5.7 2.75e+03 - 8.78e-01 9.48e-01f 1
43 -3.6635415e+04 1.16e-10 1.85e-11 -5.7 1.54e+02 - 1.00e+00 1.00e+00f 1
44 -3.6635424e+04 2.33e-10 9.24e-13 -7.0 3.76e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 44
(scaled) (unscaled)
Objective...............: -3.6635424050647703e+02 -3.6635424050647700e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 2.0618204524282620e-07 2.0618204524282619e-05
Overall NLP error.......: 2.0618204524282620e-07 2.0618204524282619e-05
Number of objective function evaluations = 45
Number of objective gradient evaluations = 45
Number of equality constraint evaluations = 45
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 45
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 44
Total CPU secs in IPOPT (w/o function evaluations) = 0.050
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 56798.87
Variable costs: 13302.31
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 195.98
Simulating time_step 2020-07-12 13:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.3786251e+04 6.19e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.3826925e+04 6.19e+05 9.90e+01 -1.0 1.74e+04 - 2.02e-04 1.94e-04h 1
2 -3.2313791e+04 6.18e+05 1.00e+02 -1.0 1.76e+04 - 2.15e-04 8.46e-04h 1
3 -2.7862402e+04 6.17e+05 1.00e+02 -1.0 1.52e+04 - 9.92e-04 1.79e-03h 1
4 -6.1114707e+03 6.12e+05 1.01e+02 -1.0 5.93e+03 - 1.68e-03 7.32e-03h 1
5 4.8687625e+04 6.01e+05 1.01e+02 -1.0 3.41e+03 - 8.46e-03 1.80e-02h 1
6 2.6024638e+05 5.59e+05 1.01e+02 -1.0 2.26e+03 - 3.72e-02 7.04e-02h 1
7 4.9048240e+05 5.13e+05 8.53e+01 -1.0 2.36e+03 - 1.20e-01 8.28e-02h 1
8 9.5370176e+05 4.19e+05 6.71e+01 -1.0 2.71e+03 - 3.30e-01 1.83e-01h 1
9 1.2616630e+06 3.56e+05 5.69e+01 -1.0 4.35e+03 - 5.05e-01 1.51e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.8456263e+06 3.56e+03 4.45e+01 -1.0 8.34e+03 - 1.79e-01 9.90e-01h 1
11 2.6187216e+06 3.49e+01 8.93e+02 -1.0 9.50e+03 - 4.77e-01 9.90e-01f 1
12 2.2141762e+06 2.35e-01 1.50e+05 -1.0 1.75e+04 - 1.29e-01 9.93e-01f 1
13 2.2064201e+06 2.31e-01 4.76e+05 -1.0 2.66e+04 - 1.01e-01 1.50e-02f 1
14 2.2049514e+06 2.31e-01 5.15e+05 -1.0 3.79e+04 - 8.33e-03 2.41e-03f 1
15 2.1607491e+06 2.15e-01 1.42e+05 -1.0 3.90e+04 - 1.89e-02 6.93e-02f 1
16 2.1177393e+06 2.09e-01 3.96e+04 -1.0 5.90e+04 - 1.34e-02 2.80e-02f 1
17 8.5759665e+05 9.57e-02 3.41e+06 -1.0 9.13e+04 - 3.01e-02 5.42e-01f 1
18 8.4325413e+05 9.48e-02 1.26e+05 -1.0 5.06e+04 - 4.38e-01 9.27e-03f 1
19 8.4014108e+05 9.46e-02 1.71e+06 -1.0 6.20e+04 - 3.90e-01 2.54e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 6.3602312e+05 7.92e-02 3.05e+06 -1.0 6.72e+04 - 6.83e-01 1.63e-01f 1
21 6.3208469e+05 7.89e-02 3.56e+06 -1.0 1.88e+05 - 4.01e-01 3.62e-03f 1
22 3.4044786e+05 6.00e-02 2.74e+06 -1.0 4.99e+05 - 2.77e-01 2.40e-01f 1
23 2.9994484e+05 5.87e-02 2.78e+06 -1.0 1.43e+06 - 1.79e-01 2.22e-02f 1
24 2.9951261e+05 5.86e-02 2.91e+06 -1.0 1.94e+05 - 2.61e-01 1.63e-03f 1
25 2.8714150e+05 3.25e-02 1.44e+06 -1.0 7.54e+03 - 3.58e-03 4.45e-01f 1
26 3.9178397e+04 1.70e-02 6.62e+05 -1.0 4.59e+05 - 2.77e-01 4.79e-01f 1
27 -3.2195510e+04 6.01e-03 3.36e+05 -1.0 9.50e+04 - 9.58e-01 6.46e-01f 1
28 -3.4896567e+04 6.49e-05 6.27e+03 -1.0 8.90e+03 - 5.48e-01 9.89e-01f 1
29 -3.4862951e+04 1.16e-10 3.73e+03 -1.0 1.50e+04 - 6.40e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -3.4861812e+04 2.33e-10 1.50e+03 -1.0 2.62e+04 - 5.97e-01 1.00e+00f 1
31 -3.5126176e+04 2.33e-10 9.42e+05 -1.7 1.48e+04 - 8.82e-01 1.00e+00f 1
32 -3.5130639e+04 1.16e-10 3.05e+05 -1.7 7.34e+04 - 6.76e-01 1.00e+00f 1
33 -3.5131259e+04 1.16e-10 6.28e+04 -1.7 8.06e+04 - 7.94e-01 1.00e+00f 1
34 -3.5129265e+04 2.33e-10 2.00e-07 -1.7 7.06e+04 - 1.00e+00 1.00e+00f 1
35 -3.5214708e+04 2.33e-10 6.82e+05 -5.7 2.71e+05 - 6.22e-01 9.63e-01f 1
36 -3.5222661e+04 1.16e-10 7.26e+04 -5.7 1.11e+05 - 8.73e-01 6.87e-01f 1
37 -3.5225258e+04 1.16e-10 5.39e+02 -5.7 2.93e+04 - 9.65e-01 8.33e-01f 1
38 -3.5225528e+04 1.16e-10 1.11e+03 -5.7 9.73e+03 - 9.14e-01 6.39e-01f 1
39 -3.5225675e+04 1.16e-10 1.01e+02 -5.7 3.52e+03 - 9.39e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -3.5225675e+04 1.16e-10 1.85e-11 -5.7 1.50e+00 - 1.00e+00 1.00e+00h 1
41 -3.5225683e+04 2.33e-10 9.38e-13 -7.0 3.74e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 41
(scaled) (unscaled)
Objective...............: -3.5225682928078032e+02 -3.5225682928078029e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 2.3283064365386963e-10
Complementarity.........: 1.3221384975085861e-07 1.3221384975085860e-05
Overall NLP error.......: 1.3221384975085861e-07 1.3221384975085860e-05
Number of objective function evaluations = 42
Number of objective gradient evaluations = 42
Number of equality constraint evaluations = 42
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 42
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 41
Total CPU secs in IPOPT (w/o function evaluations) = 0.029
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 59498.87
Variable costs: 20669.15
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 429.81
Simulating time_step 2020-07-12 14:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.2426910e+04 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.2468298e+04 1.64e+05 9.90e+01 -1.0 1.74e+04 - 2.02e-04 1.94e-04h 1
2 -3.1300631e+04 1.64e+05 1.00e+02 -1.0 1.76e+04 - 2.15e-04 8.46e-04h 1
3 -2.7777020e+04 1.63e+05 1.00e+02 -1.0 1.52e+04 - 9.92e-04 1.79e-03h 1
4 -9.7868647e+03 1.62e+05 1.01e+02 -1.0 3.77e+03 - 1.68e-03 7.32e-03h 1
5 3.3249843e+04 1.59e+05 1.01e+02 -1.0 2.23e+03 - 8.46e-03 1.69e-02h 1
6 1.4530447e+05 1.52e+05 9.32e+01 -1.0 2.26e+03 - 6.18e-02 4.45e-02h 1
7 5.7051927e+05 1.25e+05 8.66e+01 -1.0 2.42e+03 - 1.23e-01 1.78e-01h 1
8 8.1266756e+05 1.10e+05 6.63e+01 -1.0 2.81e+03 - 3.45e-01 1.24e-01h 1
9 1.3650753e+06 7.33e+04 4.43e+01 -1.0 4.56e+03 - 4.73e-01 3.32e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.3306086e+06 7.33e+02 3.90e+01 -1.0 8.22e+03 - 2.89e-01 9.90e-01h 1
11 2.0676553e+06 7.17e+00 1.29e+03 -1.0 1.06e+04 - 4.12e-01 9.90e-01f 1
12 1.7049693e+06 7.76e-01 1.52e+05 -1.0 1.77e+04 - 2.12e-01 8.92e-01f 1
13 1.6956470e+06 7.66e-01 1.32e+05 -1.0 4.56e+04 - 2.28e-02 1.23e-02f 1
14 1.6939813e+06 7.65e-01 1.28e+05 -1.0 5.88e+04 - 3.40e-03 1.38e-03f 1
15 6.1539176e+05 2.14e-01 1.26e+06 -1.0 9.40e+04 - 2.03e-02 7.21e-01f 1
16 5.9488298e+05 2.09e-01 7.74e+05 -1.0 4.68e+04 - 4.91e-01 2.27e-02f 1
17 5.6037978e+05 1.98e-01 2.14e+06 -1.0 5.44e+04 - 4.67e-01 5.36e-02f 1
18 5.5956073e+05 1.97e-01 3.92e+06 -1.0 8.22e+04 - 6.40e-01 3.27e-03f 1
19 2.9625234e+05 8.42e-02 1.27e+06 -1.0 2.02e+05 - 3.68e-01 5.73e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 2.9373220e+05 8.39e-02 1.46e+06 -1.0 6.33e+05 - 8.38e-02 2.74e-03f 1
21 2.9342078e+05 8.35e-02 1.44e+06 -1.0 4.12e+04 - 9.44e-04 5.01e-03f 1
22 -2.0390871e+04 6.64e-02 9.30e+05 -1.0 1.38e+06 - 1.10e-01 2.05e-01f 1
23 -2.4577559e+04 5.87e-02 2.71e+06 -1.0 2.04e+04 - 9.45e-01 1.16e-01f 1
24 -3.3272124e+04 1.70e-03 8.04e+04 -1.0 4.59e+03 - 7.65e-01 9.71e-01f 1
25 -3.3535856e+04 1.16e-10 3.45e+05 -1.0 1.16e+04 - 2.38e-01 1.00e+00f 1
26 -3.3519874e+04 1.16e-10 1.18e+05 -1.0 1.12e+04 - 6.63e-01 1.00e+00f 1
27 -3.3518719e+04 2.33e-10 4.53e+04 -1.0 1.99e+04 - 6.15e-01 1.00e+00f 1
28 -3.3516292e+04 2.33e-10 1.96e+04 -1.0 3.57e+04 - 5.67e-01 1.00e+00f 1
29 -3.3510702e+04 1.16e-10 6.33e+03 -1.0 7.39e+04 - 6.77e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -3.3496472e+04 1.16e-10 1.96e+03 -1.0 1.50e+05 - 6.90e-01 1.00e+00f 1
31 -3.3765515e+04 1.16e-10 2.59e+04 -1.7 4.91e+04 - 9.97e-01 1.00e+00f 1
32 -3.3779422e+04 1.16e-10 2.00e-07 -1.7 1.94e+05 - 1.00e+00 1.00e+00f 1
33 -3.3860711e+04 1.16e-10 6.03e+05 -5.7 2.63e+05 - 6.09e-01 9.11e-01f 1
34 -3.3872770e+04 1.16e-10 1.51e+05 -5.7 1.38e+05 - 7.39e-01 7.02e-01f 1
35 -3.3876660e+04 1.16e-10 2.78e+03 -5.7 4.48e+04 - 9.32e-01 7.91e-01f 1
36 -3.3877357e+04 2.33e-10 1.11e+03 -5.7 1.23e+04 - 9.35e-01 8.19e-01f 1
37 -3.3877481e+04 1.16e-10 2.35e+02 -5.7 2.63e+03 - 8.86e-01 8.32e-01f 1
38 -3.3877504e+04 1.16e-10 1.85e-11 -5.7 4.41e+02 - 1.00e+00 1.00e+00f 1
39 -3.3877513e+04 1.16e-10 9.38e-13 -7.0 3.74e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 39
(scaled) (unscaled)
Objective...............: -3.3877512584163298e+02 -3.3877512584163298e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2742195498507997e-07 1.2742195498507998e-05
Overall NLP error.......: 1.2742195498507997e-07 1.2742195498507998e-05
Number of objective function evaluations = 40
Number of objective gradient evaluations = 40
Number of equality constraint evaluations = 40
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 40
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 39
Total CPU secs in IPOPT (w/o function evaluations) = 0.049
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 59614.87
Variable costs: 31385.31
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 461.68
Simulating time_step 2020-07-12 15:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.1129141e+04 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.1170520e+04 1.64e+05 9.90e+01 -1.0 1.74e+04 - 2.02e-04 1.94e-04h 1
2 -3.0002812e+04 1.64e+05 1.00e+02 -1.0 1.76e+04 - 2.15e-04 8.46e-04h 1
3 -2.6479113e+04 1.63e+05 1.00e+02 -1.0 1.52e+04 - 9.92e-04 1.79e-03h 1
4 -8.4886137e+03 1.62e+05 1.01e+02 -1.0 3.77e+03 - 1.68e-03 7.32e-03h 1
5 3.4560938e+04 1.59e+05 1.01e+02 -1.0 2.23e+03 - 8.46e-03 1.70e-02h 1
6 1.4657507e+05 1.52e+05 9.32e+01 -1.0 2.26e+03 - 6.18e-02 4.45e-02h 1
7 5.7169832e+05 1.25e+05 8.66e+01 -1.0 2.42e+03 - 1.23e-01 1.78e-01h 1
8 8.1395137e+05 1.10e+05 6.63e+01 -1.0 2.81e+03 - 3.45e-01 1.24e-01h 1
9 1.3658120e+06 7.34e+04 4.43e+01 -1.0 4.56e+03 - 4.73e-01 3.31e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.3319875e+06 7.33e+02 3.90e+01 -1.0 8.22e+03 - 2.89e-01 9.90e-01h 1
11 2.0690578e+06 7.17e+00 1.29e+03 -1.0 1.06e+04 - 4.12e-01 9.90e-01f 1
12 1.7063106e+06 7.75e-01 1.52e+05 -1.0 1.77e+04 - 2.11e-01 8.92e-01f 1
13 1.6969858e+06 7.66e-01 1.32e+05 -1.0 4.56e+04 - 2.28e-02 1.23e-02f 1
14 1.6953250e+06 7.65e-01 1.28e+05 -1.0 5.88e+04 - 3.40e-03 1.37e-03f 1
15 6.1670771e+05 2.14e-01 1.26e+06 -1.0 9.40e+04 - 2.04e-02 7.21e-01f 1
16 5.9620428e+05 2.09e-01 7.74e+05 -1.0 4.68e+04 - 4.91e-01 2.27e-02f 1
17 5.6172962e+05 1.98e-01 2.14e+06 -1.0 5.44e+04 - 4.67e-01 5.35e-02f 1
18 5.6091026e+05 1.97e-01 3.92e+06 -1.0 8.22e+04 - 6.40e-01 3.27e-03f 1
19 2.9760123e+05 8.42e-02 1.27e+06 -1.0 2.02e+05 - 3.68e-01 5.73e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 2.9508106e+05 8.39e-02 1.46e+06 -1.0 6.33e+05 - 8.38e-02 2.74e-03f 1
21 2.9476962e+05 8.35e-02 1.44e+06 -1.0 4.12e+04 - 9.44e-04 5.01e-03f 1
22 -1.9042105e+04 6.64e-02 9.30e+05 -1.0 1.38e+06 - 1.10e-01 2.05e-01f 1
23 -2.3228685e+04 5.87e-02 2.71e+06 -1.0 2.04e+04 - 9.45e-01 1.16e-01f 1
24 -3.1923823e+04 1.70e-03 8.03e+04 -1.0 3.25e+03 - 7.65e-01 9.71e-01f 1
25 -3.2187600e+04 1.16e-10 3.45e+05 -1.0 8.09e+03 - 2.38e-01 1.00e+00f 1
26 -3.2171541e+04 2.33e-10 1.18e+05 -1.0 7.74e+03 - 6.63e-01 1.00e+00f 1
27 -3.2170182e+04 2.33e-10 4.53e+04 -1.0 1.45e+04 - 6.15e-01 1.00e+00f 1
28 -3.2167341e+04 2.33e-10 1.96e+04 -1.0 3.57e+04 - 5.67e-01 1.00e+00f 1
29 -3.2161142e+04 1.75e-10 6.29e+03 -1.0 7.36e+04 - 6.79e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -3.2144873e+04 1.16e-10 1.91e+03 -1.0 1.48e+05 - 6.96e-01 1.00e+00f 1
31 -3.2413147e+04 1.16e-10 2.00e-07 -1.7 4.93e+04 - 1.00e+00 1.00e+00f 1
32 -3.2497450e+04 1.16e-10 4.85e+05 -5.7 3.68e+05 - 5.70e-01 8.12e-01f 1
33 -3.2516970e+04 1.16e-10 3.34e+05 -5.7 1.79e+05 - 4.60e-01 6.51e-01f 1
34 -3.2523585e+04 1.16e-10 8.47e+03 -5.7 5.26e+04 - 9.02e-01 7.17e-01f 1
35 -3.2525610e+04 1.16e-10 4.89e+02 -5.7 1.98e+04 - 8.87e-01 8.74e-01f 1
36 -3.2525809e+04 1.16e-10 1.59e+03 -5.7 4.23e+03 - 9.97e-01 6.57e-01f 1
37 -3.2525905e+04 2.33e-10 1.51e+02 -5.7 1.45e+03 - 9.18e-01 1.00e+00f 1
38 -3.2525905e+04 1.16e-10 1.85e-11 -5.7 1.71e-01 - 1.00e+00 1.00e+00h 1
39 -3.2525914e+04 1.16e-10 9.24e-13 -7.0 3.74e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 39
(scaled) (unscaled)
Objective...............: -3.2525913685123209e+02 -3.2525913685123207e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.3128783063139561e-07 1.3128783063139561e-05
Overall NLP error.......: 1.3128783063139561e-07 1.3128783063139561e-05
Number of objective function evaluations = 40
Number of objective gradient evaluations = 40
Number of equality constraint evaluations = 40
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 40
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 39
Total CPU secs in IPOPT (w/o function evaluations) = 0.028
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 58226.87
Variable costs: 29232.66
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 80.69
Simulating time_step 2020-07-12 16:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.9827942e+04 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.9869311e+04 1.64e+05 9.90e+01 -1.0 1.74e+04 - 2.02e-04 1.94e-04h 1
2 -2.8701517e+04 1.64e+05 1.00e+02 -1.0 1.76e+04 - 2.15e-04 8.46e-04h 1
3 -2.5177625e+04 1.63e+05 1.00e+02 -1.0 1.52e+04 - 9.92e-04 1.79e-03h 1
4 -7.1879798e+03 1.62e+05 1.01e+02 -1.0 3.77e+03 - 1.68e-03 7.32e-03h 1
5 3.5944105e+04 1.59e+05 1.01e+02 -1.0 2.22e+03 - 8.46e-03 1.70e-02h 1
6 1.4774930e+05 1.52e+05 9.32e+01 -1.0 2.25e+03 - 6.18e-02 4.44e-02h 1
7 5.7189515e+05 1.25e+05 8.66e+01 -1.0 2.42e+03 - 1.23e-01 1.77e-01h 1
8 8.1504699e+05 1.10e+05 6.63e+01 -1.0 2.81e+03 - 3.45e-01 1.25e-01h 1
9 1.3619811e+06 7.37e+04 4.45e+01 -1.0 4.56e+03 - 4.73e-01 3.28e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.3336074e+06 7.37e+02 3.91e+01 -1.0 8.22e+03 - 2.89e-01 9.90e-01h 1
11 2.0708817e+06 7.21e+00 1.28e+03 -1.0 1.06e+04 - 4.13e-01 9.90e-01f 1
12 1.7076066e+06 7.75e-01 1.52e+05 -1.0 1.77e+04 - 2.11e-01 8.92e-01f 1
13 1.6982599e+06 7.66e-01 1.32e+05 -1.0 4.57e+04 - 2.27e-02 1.23e-02f 1
14 1.6966124e+06 7.65e-01 1.28e+05 -1.0 5.91e+04 - 3.40e-03 1.36e-03f 1
15 6.1780281e+05 2.14e-01 1.26e+06 -1.0 9.40e+04 - 2.12e-02 7.20e-01f 1
16 5.9733138e+05 2.09e-01 7.75e+05 -1.0 4.68e+04 - 4.91e-01 2.27e-02f 1
17 5.6314689e+05 1.98e-01 2.15e+06 -1.0 5.44e+04 - 4.67e-01 5.31e-02f 1
18 5.6232358e+05 1.97e-01 3.92e+06 -1.0 8.23e+04 - 6.40e-01 3.31e-03f 1
19 2.9897501e+05 8.42e-02 1.27e+06 -1.0 2.02e+05 - 3.68e-01 5.73e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 2.9645456e+05 8.40e-02 1.46e+06 -1.0 6.34e+05 - 8.37e-02 2.73e-03f 1
21 2.9614288e+05 8.36e-02 1.44e+06 -1.0 4.12e+04 - 9.43e-04 5.01e-03f 1
22 -1.7673038e+04 6.64e-02 9.32e+05 -1.0 1.38e+06 - 1.10e-01 2.05e-01f 1
23 -2.1859861e+04 5.88e-02 2.71e+06 -1.0 2.04e+04 - 9.45e-01 1.16e-01f 1
24 -3.0570736e+04 1.71e-03 7.99e+04 -1.0 2.01e+03 - 7.65e-01 9.71e-01f 1
25 -3.0835980e+04 1.16e-10 3.45e+05 -1.0 4.88e+03 - 2.38e-01 1.00e+00f 1
26 -3.0819805e+04 1.16e-10 1.18e+05 -1.0 4.92e+03 - 6.63e-01 1.00e+00f 1
27 -3.0818282e+04 1.16e-10 4.53e+04 -1.0 1.45e+04 - 6.15e-01 1.00e+00f 1
28 -3.0815114e+04 1.16e-10 1.96e+04 -1.0 3.57e+04 - 5.68e-01 1.00e+00f 1
29 -3.0808433e+04 3.49e-10 6.23e+03 -1.0 7.33e+04 - 6.82e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -3.0791016e+04 1.16e-10 1.84e+03 -1.0 1.45e+05 - 7.05e-01 1.00e+00f 1
31 -3.1058283e+04 1.16e-10 2.00e-07 -1.7 4.86e+04 - 1.00e+00 1.00e+00f 1
32 -3.1141933e+04 1.16e-10 3.85e+05 -5.7 3.48e+05 - 6.13e-01 8.06e-01f 1
33 -3.1160834e+04 1.16e-10 2.68e+03 -5.7 1.85e+05 - 8.06e-01 6.20e-01f 1
34 -3.1168687e+04 1.16e-10 1.65e+04 -5.7 5.79e+04 - 8.73e-01 7.59e-01f 1
35 -3.1170668e+04 1.16e-10 1.01e+03 -5.7 1.79e+04 - 8.82e-01 9.08e-01f 1
36 -3.1170793e+04 1.16e-10 1.54e+03 -5.7 2.98e+03 - 1.00e+00 5.84e-01f 1
37 -3.1170878e+04 1.16e-10 1.21e+01 -5.7 1.24e+03 - 9.91e-01 1.00e+00f 1
38 -3.1170877e+04 2.33e-10 1.85e-11 -5.7 1.58e-01 - 1.00e+00 1.00e+00h 1
39 -3.1170886e+04 1.16e-10 9.24e-13 -7.0 3.74e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 39
(scaled) (unscaled)
Objective...............: -3.1170886235842949e+02 -3.1170886235842947e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.3063030987060938e-07 1.3063030987060938e-05
Overall NLP error.......: 1.3063030987060938e-07 1.3063030987060938e-05
Number of objective function evaluations = 40
Number of objective gradient evaluations = 40
Number of equality constraint evaluations = 40
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 40
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 39
Total CPU secs in IPOPT (w/o function evaluations) = 0.029
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 61538.87
Variable costs: 36786.70
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 305.00
Simulating time_step 2020-07-12 17:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.8523315e+04 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.8565282e+04 1.64e+05 9.90e+01 -1.0 2.67e+04 - 2.02e-04 1.94e-04h 1
2 -2.7352660e+04 1.64e+05 1.00e+02 -1.0 2.63e+04 - 2.15e-04 8.46e-04h 1
3 -2.3553596e+04 1.63e+05 1.00e+02 -1.0 1.82e+04 - 8.26e-04 1.79e-03h 1
4 -7.1681832e+03 1.62e+05 1.01e+02 -1.0 4.88e+03 - 1.73e-03 6.30e-03h 1
5 3.8200275e+04 1.60e+05 1.01e+02 -1.0 3.47e+03 - 7.38e-03 1.69e-02h 1
6 2.3966017e+05 1.48e+05 9.96e+01 -1.0 3.13e+03 - 4.49e-02 7.53e-02h 1
7 4.5560955e+05 1.35e+05 8.23e+01 -1.0 2.64e+03 - 1.33e-01 8.77e-02h 1
8 8.4986583e+05 1.11e+05 6.70e+01 -1.0 2.92e+03 - 3.28e-01 1.76e-01h 1
9 1.1450033e+06 9.27e+04 5.60e+01 -1.0 4.43e+03 - 4.95e-01 1.64e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.5103329e+06 9.27e+02 4.05e+01 -1.0 8.45e+03 - 2.53e-01 9.90e-01h 1
11 2.3460250e+06 3.32e+02 3.41e+02 -1.0 1.04e+04 - 4.52e-01 6.42e-01f 1
12 2.3440919e+06 3.30e+02 5.60e+02 -1.0 1.72e+04 - 1.87e-01 4.45e-03f 1
13 1.9137339e+06 2.10e+01 1.61e+04 -1.0 2.15e+04 - 1.57e-02 9.36e-01f 1
14 1.8924133e+06 2.07e+01 1.58e+04 -1.0 5.94e+04 - 2.40e-02 1.63e-02f 1
15 1.8906525e+06 2.07e+01 1.58e+04 -1.0 9.07e+04 - 4.75e-02 1.14e-03f 1
16 1.7306127e+06 1.85e+01 1.42e+04 -1.0 9.19e+04 - 2.78e-01 1.03e-01f 1
17 1.2631743e+06 1.32e+01 1.01e+04 -1.0 8.75e+04 - 1.31e-01 2.88e-01f 1
18 1.2583704e+06 1.32e+01 5.76e+04 -1.0 6.53e+04 - 5.08e-01 3.98e-03f 1
19 1.2421833e+06 1.29e+01 1.52e+05 -1.0 6.60e+04 - 8.12e-01 2.19e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 7.9147206e+05 1.02e+01 1.10e+05 -1.0 1.33e+06 - 1.24e-01 2.10e-01f 1
21 7.8743371e+05 1.01e+01 1.46e+05 -1.0 1.54e+06 - 2.37e-01 1.81e-03f 1
22 7.8113846e+05 1.00e+01 1.99e+05 -1.0 4.81e+04 - 3.63e-01 1.22e-02f 1
23 6.1240300e+05 6.61e+00 7.89e+04 -1.0 4.62e+04 - 5.71e-03 3.40e-01f 1
24 6.0341179e+05 6.54e+00 7.65e+04 -1.0 6.63e+05 - 4.28e-03 1.11e-02f 1
25 5.8040752e+05 6.34e+00 7.61e+04 -1.0 6.46e+05 - 3.81e-02 3.00e-02f 1
26 2.9399873e+05 4.25e+00 1.72e+04 -1.0 7.69e+05 - 4.98e-02 3.30e-01f 1
27 2.9057732e+05 4.03e+00 3.26e+04 -1.0 4.90e+04 - 1.88e-01 5.19e-02f 1
28 2.5337652e+05 1.65e+00 2.07e+05 -1.0 4.73e+04 - 2.64e-03 5.90e-01f 1
29 -3.1291402e+04 4.52e-01 6.68e+05 -1.0 3.50e+05 - 1.97e-02 7.27e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -3.2613527e+04 3.43e-01 1.39e+06 -1.0 3.67e+03 - 9.87e-01 2.42e-01f 1
31 -3.4821316e+04 7.56e-02 7.33e+05 -1.0 6.28e+03 - 9.66e-01 7.80e-01f 1
32 -3.5120625e+04 3.66e-02 3.43e+05 -1.0 4.46e+05 - 3.06e-01 5.16e-01f 1
33 -3.5394744e+04 2.33e-10 1.00e-06 -1.0 1.84e+05 - 1.00e+00 1.00e+00f 1
34 -3.5745287e+04 1.16e-10 2.38e+06 -5.7 1.25e+05 - 7.25e-01 9.80e-01f 1
35 -3.5768035e+04 1.16e-10 1.47e+06 -5.7 2.84e+05 - 4.03e-01 6.83e-01f 1
36 -3.5776924e+04 2.33e-10 7.36e+05 -5.7 8.60e+04 - 5.10e-01 7.98e-01f 1
37 -3.5780702e+04 1.16e-10 1.37e+05 -5.7 8.69e+04 - 8.13e-01 7.19e-01f 1
38 -3.5781582e+04 1.16e-10 3.22e+04 -5.7 2.16e+04 - 7.61e-01 5.99e-01f 1
39 -3.5782062e+04 1.16e-10 1.97e+03 -5.7 6.77e+03 - 9.38e-01 9.29e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -3.5782089e+04 2.33e-10 1.85e-11 -5.7 4.58e+02 - 1.00e+00 1.00e+00f 1
41 -3.5782097e+04 1.16e-10 9.38e-13 -7.0 2.00e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 41
(scaled) (unscaled)
Objective...............: -3.5782097337598009e+02 -3.5782097337598010e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 1.2667432573384219e-07 1.2667432573384218e-05
Overall NLP error.......: 1.2667432573384219e-07 1.2667432573384218e-05
Number of objective function evaluations = 42
Number of objective gradient evaluations = 42
Number of equality constraint evaluations = 42
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 42
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 41
Total CPU secs in IPOPT (w/o function evaluations) = 0.030
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 68759.47
Variable costs: 44273.62
Number on/offs: 2
Sum on/off ramps: 30.00
Sum nominal ramps: 361.44
Simulating time_step 2020-07-12 18:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.3132710e+04 2.91e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.3174789e+04 2.91e+05 9.90e+01 -1.0 1.74e+04 - 2.02e-04 1.94e-04h 1
2 -3.1810696e+04 2.91e+05 1.00e+02 -1.0 1.76e+04 - 2.15e-04 8.46e-04h 1
3 -2.8112168e+04 2.90e+05 1.00e+02 -1.0 1.52e+04 - 1.01e-03 1.79e-03h 1
4 -9.9897134e+03 2.88e+05 1.01e+02 -1.0 4.63e+03 - 1.68e-03 7.83e-03h 1
5 1.9460837e+04 2.84e+05 1.01e+02 -1.0 7.63e+03 - 9.06e-03 1.23e-02h 1
6 2.1463233e+04 2.84e+05 3.25e+02 -1.0 1.84e+05 - 1.44e-01 8.66e-04h 1
7 2.0956185e+06 2.84e+03 1.63e+02 -1.0 2.92e+04 - 2.60e-02 9.90e-01h 1
8 2.0785620e+06 2.81e+01 7.56e+02 -1.0 2.53e+03 - 2.52e-01 9.90e-01f 1
9 2.0472973e+06 1.41e+01 7.76e+03 -1.0 4.92e+03 - 4.27e-01 4.99e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.9434603e+06 1.16e-10 1.04e+05 -1.0 8.60e+03 - 4.82e-01 1.00e+00f 1
11 1.7637798e+06 1.16e-10 5.81e+06 -1.0 1.65e+04 - 4.11e-01 1.00e+00f 1
12 1.5401519e+06 1.16e-10 5.11e+06 -1.0 2.76e+04 - 1.21e-01 6.98e-01f 1
13 1.5340671e+06 1.16e-10 4.90e+06 -1.0 4.66e+04 - 4.03e-02 9.51e-03f 1
14 7.6668288e+05 1.16e-10 4.89e+06 -1.0 5.31e+04 - 2.38e-03 6.96e-01f 1
15 7.5818814e+05 1.16e-10 4.51e+06 -1.0 4.44e+04 - 7.66e-02 8.40e-03f 1
16 7.3469806e+05 1.16e-10 4.50e+06 -1.0 4.51e+04 - 3.02e-03 2.54e-02f 1
17 7.3431589e+05 1.16e-10 2.74e+06 -1.0 5.93e+04 - 3.91e-01 4.35e-04f 1
18 6.1282249e+05 1.75e-10 2.68e+06 -1.0 6.29e+04 - 2.16e-02 1.81e-01f 1
19 6.1158509e+05 2.33e-10 2.98e+05 -1.0 4.75e+04 - 8.89e-01 2.40e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 4.9241469e+05 1.16e-10 2.74e+05 -1.0 1.42e+05 - 7.96e-02 6.69e-01f 1
21 3.2758028e+05 2.33e-10 2.74e+05 -1.0 1.96e+05 - 9.66e-04 4.98e-01f 1
22 2.9637099e+05 1.16e-10 2.33e+05 -1.0 1.55e+06 - 1.48e-01 1.76e-02f 1
23 -2.7922062e+04 1.16e-10 1.14e+05 -1.0 1.25e+06 - 5.12e-01 2.28e-01f 1
24 -3.2091014e+04 2.33e-10 6.34e+03 -1.0 8.43e+03 - 9.44e-01 3.27e-01f 1
25 -3.4148813e+04 1.16e-10 1.56e+02 -1.0 2.68e+04 - 9.75e-01 1.00e+00f 1
26 -3.4463243e+04 1.16e-10 6.13e+05 -2.5 9.20e+03 - 9.37e-01 1.00e+00f 1
27 -3.4470817e+04 1.16e-10 6.87e+04 -2.5 8.46e+04 - 8.88e-01 1.00e+00f 1
28 -3.4479420e+04 1.16e-10 3.25e+04 -2.5 5.10e+05 - 5.27e-01 6.81e-01f 1
29 -3.4478465e+04 1.16e-10 9.30e+03 -2.5 1.44e+05 - 7.14e-01 5.00e-01f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -3.4479772e+04 2.33e-10 2.83e-08 -2.5 4.97e+04 - 1.00e+00 1.00e+00f 1
31 -3.4492803e+04 1.16e-10 1.10e+04 -5.7 3.75e+04 - 8.48e-01 8.87e-01f 1
32 -3.4494278e+04 1.16e-10 3.33e+02 -5.7 4.30e+03 - 9.39e-01 9.28e-01f 1
33 -3.4494369e+04 2.33e-10 2.54e+02 -5.7 2.57e+02 - 8.72e-01 9.32e-01f 1
34 -3.4494375e+04 2.33e-10 1.85e-11 -5.7 1.72e+01 - 1.00e+00 1.00e+00f 1
35 -3.4494384e+04 1.16e-10 9.24e-13 -7.0 1.88e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 35
(scaled) (unscaled)
Objective...............: -3.4494383573846943e+02 -3.4494383573846942e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 3.2350579638928646e-07 3.2350579638928645e-05
Overall NLP error.......: 3.2350579638928646e-07 3.2350579638928645e-05
Number of objective function evaluations = 40
Number of objective gradient evaluations = 36
Number of equality constraint evaluations = 40
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 36
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 35
Total CPU secs in IPOPT (w/o function evaluations) = 0.026
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 58783.30
Variable costs: 49194.37
Number on/offs: 1
Sum on/off ramps: 0.00
Sum nominal ramps: 207.89
Simulating time_step 2020-07-12 19:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.1894095e+04 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.1935752e+04 1.64e+05 9.90e+01 -1.0 6.50e+03 - 2.02e-04 1.94e-04h 1
2 -3.0920652e+04 1.64e+05 1.00e+02 -1.0 6.72e+03 - 2.15e-04 8.46e-04h 1
3 -2.7990252e+04 1.63e+05 1.00e+02 -1.0 6.62e+03 - 1.01e-03 2.09e-03h 1
4 -1.4031111e+04 1.62e+05 1.01e+02 -1.0 3.43e+03 - 2.39e-03 9.19e-03h 1
5 2.5103685e+04 1.58e+05 9.54e+01 -1.0 1.29e+03 - 4.78e-02 2.43e-02h 1
6 1.1780802e+05 1.49e+05 8.98e+01 -1.0 1.37e+03 - 5.78e-02 5.85e-02h 1
7 1.5921215e+06 1.49e+03 1.18e+02 -1.0 1.43e+03 - 3.26e-01 9.90e-01h 1
8 1.5894164e+06 8.63e+02 2.57e+02 -1.0 1.94e+03 - 1.90e-01 4.20e-01f 1
9 1.5734440e+06 8.46e+00 8.59e+02 -1.0 2.24e+03 - 5.39e-01 9.90e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.5279063e+06 1.16e-10 1.40e+05 -1.0 3.66e+03 - 2.62e-01 1.00e+00f 1
11 1.4696864e+06 2.33e-10 5.80e+06 -1.0 3.26e+03 - 4.17e-01 1.00e+00f 1
12 1.1599457e+06 1.16e-10 5.51e+06 -1.0 2.79e+04 - 5.08e-02 1.00e+00f 1
13 8.9436948e+05 1.16e-10 5.41e+06 -1.0 5.23e+04 - 1.75e-02 3.24e-01f 1
14 8.8932200e+05 1.16e-10 4.55e+06 -1.0 8.32e+04 - 1.60e-01 3.96e-03f 1
15 8.8518673e+05 1.16e-10 3.07e+06 -1.0 8.59e+04 - 3.24e-01 4.70e-03f 1
16 6.1252231e+05 1.16e-10 2.61e+06 -1.0 8.96e+04 - 1.52e-01 2.98e-01f 1
17 6.0946103e+05 5.82e-11 2.14e+05 -1.0 2.55e+04 - 9.18e-01 1.14e-02f 1
18 4.3704975e+05 1.16e-10 1.96e+05 -1.0 1.99e+05 - 8.30e-02 7.32e-01f 1
19 4.3109627e+05 1.16e-10 1.96e+05 -1.0 2.01e+05 - 1.12e-03 1.84e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 -2.8587202e+04 1.16e-10 1.61e+05 -1.0 8.55e+05 - 1.77e-01 4.77e-01f 1
21 -3.4031639e+04 1.16e-10 3.92e+03 -1.0 8.89e+03 - 9.76e-01 4.48e-01f 1
22 -3.5195127e+04 1.16e-10 9.44e+01 -1.0 5.34e+03 - 9.76e-01 1.00e+00f 1
23 -3.5511811e+04 1.16e-10 8.94e+05 -2.5 8.59e+03 - 9.08e-01 1.00e+00f 1
24 -3.5516790e+04 1.16e-10 2.97e+04 -2.5 7.48e+04 - 9.67e-01 1.00e+00f 1
25 -3.5519446e+04 1.16e-10 1.12e+01 -2.5 6.00e+04 - 1.00e+00 8.14e-01f 1
26 -3.5519843e+04 1.16e-10 2.83e-08 -2.5 2.44e+04 - 1.00e+00 1.00e+00f 1
27 -3.5532403e+04 5.82e-11 1.19e+03 -5.7 4.11e+04 - 8.47e-01 8.51e-01f 1
28 -3.5534398e+04 1.16e-10 1.43e+03 -5.7 5.24e+03 - 9.13e-01 9.44e-01f 1
29 -3.5534499e+04 1.16e-10 3.11e+02 -5.7 4.25e+02 - 8.71e-01 9.25e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -3.5534506e+04 1.16e-10 1.85e-11 -5.7 3.13e+01 - 1.00e+00 1.00e+00f 1
31 -3.5534515e+04 1.16e-10 9.24e-13 -7.0 1.88e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 31
(scaled) (unscaled)
Objective...............: -3.5534514522843079e+02 -3.5534514522843077e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 5.8207660913467407e-11 1.1641532182693481e-10
Complementarity.........: 3.2421316535381515e-07 3.2421316535381511e-05
Overall NLP error.......: 3.2421316535381515e-07 3.2421316535381511e-05
Number of objective function evaluations = 32
Number of objective gradient evaluations = 32
Number of equality constraint evaluations = 32
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 32
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 31
Total CPU secs in IPOPT (w/o function evaluations) = 0.024
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 61511.30
Variable costs: 51362.46
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 69.85
Simulating time_step 2020-07-12 20:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.2984624e+04 1.64e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.3025998e+04 1.64e+05 9.90e+01 -1.0 2.53e+04 - 2.02e-04 1.94e-04h 1
2 -3.1926609e+04 1.64e+05 1.00e+02 -1.0 2.48e+04 - 2.15e-04 8.46e-04h 1
3 -2.8556289e+04 1.63e+05 1.01e+02 -1.0 1.53e+04 - 7.93e-04 2.00e-03h 1
4 -4.9751290e+03 1.61e+05 1.01e+02 -1.0 1.41e+03 - 3.10e-03 1.26e-02h 1
5 2.4431300e+05 1.41e+05 1.03e+02 -1.0 1.36e+03 - 5.13e-02 1.27e-01h 1
6 3.6716378e+05 1.30e+05 7.88e+01 -1.0 2.44e+03 - 2.04e-01 7.37e-02h 1
7 1.9048648e+06 1.30e+03 4.27e+01 -1.0 3.07e+03 - 7.08e-01 9.90e-01h 1
8 1.8103398e+06 1.29e+01 8.90e+02 -1.0 1.04e+04 - 2.82e-01 9.90e-01f 1
9 1.6633209e+06 1.16e-10 9.71e+04 -1.0 1.26e+04 - 2.27e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.4642627e+06 1.16e-10 7.54e+06 -1.0 1.13e+04 - 2.43e-01 1.00e+00f 1
11 1.0220645e+06 8.73e-11 7.42e+06 -1.0 4.63e+04 - 1.69e-02 7.51e-01f 1
12 1.0200946e+06 1.16e-10 5.22e+06 -1.0 4.32e+04 - 2.96e-01 3.16e-03f 1
13 9.9347369e+05 1.16e-10 2.65e+06 -1.0 4.84e+04 - 4.92e-01 4.68e-02f 1
14 9.9261352e+05 1.16e-10 5.89e+05 -1.0 6.98e+04 - 7.78e-01 4.83e-03f 1
15 6.6203347e+05 1.16e-10 4.15e+05 -1.0 2.43e+05 - 2.95e-01 1.00e+00f 1
16 4.3266260e+05 1.16e-10 4.13e+05 -1.0 1.88e+05 - 4.20e-03 1.00e+00f 1
17 -2.9177882e+04 1.16e-10 4.07e+05 -1.0 1.67e+06 - 1.38e-02 2.42e-01f 1
18 -3.3797898e+04 1.16e-10 3.06e+04 -1.0 4.74e+04 - 9.25e-01 8.48e-02f 1
19 -3.3844176e+04 1.16e-10 5.60e+02 -1.0 1.56e+03 - 9.82e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 -3.4097173e+04 1.16e-10 9.05e+04 -1.7 3.15e+03 - 9.89e-01 1.00e+00f 1
21 -3.4074769e+04 1.16e-10 5.64e+04 -1.7 2.85e+05 - 3.77e-01 9.23e-01f 1
22 -3.4071416e+04 1.16e-10 2.00e-07 -1.7 7.18e+04 - 1.00e+00 1.00e+00f 1
23 -3.4167894e+04 2.33e-10 6.87e+05 -5.7 2.18e+05 - 6.52e-01 9.96e-01f 1
24 -3.4173663e+04 1.16e-10 1.79e+05 -5.7 7.85e+04 - 7.40e-01 7.71e-01f 1
25 -3.4174562e+04 1.16e-10 2.03e+04 -5.7 1.98e+04 - 8.84e-01 6.82e-01f 1
26 -3.4174943e+04 1.16e-10 7.30e+02 -5.7 6.08e+03 - 9.65e-01 9.98e-01f 1
27 -3.4174944e+04 1.16e-10 1.85e-11 -5.7 2.83e+01 - 1.00e+00 1.00e+00f 1
28 -3.4174952e+04 1.16e-10 9.24e-13 -7.0 1.88e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 28
(scaled) (unscaled)
Objective...............: -3.4174952402119277e+02 -3.4174952402119277e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 3.2337589396370780e-12 1.1641532182693481e-10
Complementarity.........: 1.2651429243459251e-07 1.2651429243459251e-05
Overall NLP error.......: 1.2651429243459251e-07 1.2651429243459251e-05
Number of objective function evaluations = 29
Number of objective gradient evaluations = 29
Number of equality constraint evaluations = 29
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 29
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 28
Total CPU secs in IPOPT (w/o function evaluations) = 0.027
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 62803.30
Variable costs: 48228.83
Number on/offs: 0
Sum on/off ramps: 0.00
Sum nominal ramps: 213.45
Simulating time_step 2020-07-12 21:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.1675458e+04 5.88e+05 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.1761622e+04 5.88e+05 9.90e+01 -1.0 3.28e+03 - 4.43e-04 4.08e-04h 1
2 -2.8202077e+04 5.81e+05 1.00e+02 -1.0 1.10e+03 - 4.87e-04 1.14e-02h 1
3 7.6978033e+04 4.60e+05 1.07e+02 -1.0 1.07e+03 - 7.00e-02 2.09e-01h 1
4 1.0599603e+05 4.21e+05 7.09e+01 -1.0 8.79e+02 - 2.62e-01 8.38e-02h 1
5 4.5593768e+05 4.21e+03 3.64e+01 -1.0 8.59e+02 - 7.27e-01 9.90e-01h 1
6 4.5044494e+05 7.79e+02 5.24e+02 -1.0 1.01e+03 - 4.40e-01 8.15e-01f 1
7 3.6901503e+05 7.21e+00 6.04e+03 -1.0 8.35e+03 - 1.90e-01 9.91e-01f 1
8 -2.1609604e+04 3.66e+00 2.89e+05 -1.0 7.99e+04 - 1.13e-01 4.93e-01f 1
9 -2.5515788e+04 3.63e+00 9.25e+05 -1.0 5.02e+04 - 8.91e-01 7.84e-03f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -2.5535118e+04 3.61e+00 2.11e+06 -1.0 7.90e+02 - 9.87e-01 4.75e-03f 2
11 -2.5479591e+04 1.16e-10 1.51e+04 -1.0 1.40e+03 - 9.86e-01 1.00e+00f 1
12 -2.5460273e+04 1.16e-10 2.90e+03 -1.0 9.54e+04 - 1.00e+00 1.00e+00f 1
13 -2.5417850e+04 1.16e-10 1.70e+03 -1.0 5.51e+05 - 4.15e-01 5.58e-01f 1
14 -2.5717944e+04 1.16e-10 2.00e-07 -1.7 8.53e+04 - 1.00e+00 1.00e+00f 1
15 -2.5815272e+04 1.16e-10 1.01e+06 -5.7 2.68e+05 - 3.44e-01 8.50e-01f 1
16 -2.5835540e+04 5.82e-11 9.23e+05 -5.7 1.09e+05 - 2.76e-01 9.08e-01f 1
17 -2.5838699e+04 5.82e-11 2.43e+05 -5.7 4.58e+04 - 7.40e-01 8.65e-01f 1
18 -2.5839336e+04 5.82e-11 1.41e+04 -5.7 1.00e+04 - 9.42e-01 9.63e-01f 1
19 -2.5839376e+04 1.16e-10 7.84e+02 -5.7 1.52e+03 - 9.45e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 -2.5839376e+04 5.82e-11 1.85e-11 -5.7 9.42e+00 - 1.00e+00 1.00e+00h 1
21 -2.5839386e+04 5.82e-11 9.38e-13 -7.0 1.74e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: -2.5839385877973632e+02 -2.5839385877973633e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 5.8207660913467407e-11
Complementarity.........: 1.4909404921377567e-07 1.4909404921377567e-05
Overall NLP error.......: 1.4909404921377567e-07 1.4909404921377567e-05
Number of objective function evaluations = 23
Number of objective gradient evaluations = 22
Number of equality constraint evaluations = 23
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 22
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 21
Total CPU secs in IPOPT (w/o function evaluations) = 0.035
Total CPU secs in NLP function evaluations = 0.003
EXIT: Optimal Solution Found.
Fixed costs: 53905.73
Variable costs: 53487.96
Number on/offs: 1
Sum on/off ramps: 0.00
Sum nominal ramps: 343.11
Simulating time_step 2020-07-12 22:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.3439676e+04 5.00e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.5805364e+04 4.95e+03 1.54e+01 -1.0 7.90e+00 - 8.48e-01 1.10e-02f 1
2 -2.5792923e+04 4.69e+03 4.48e+01 -1.0 7.55e+00 - 3.78e-02 5.14e-02f 1
3 -2.5551200e+04 4.69e+01 1.93e+02 -1.0 2.52e+00 - 2.15e-01 9.90e-01h 1
4 -2.5559517e+04 4.64e-01 1.70e+02 -1.0 2.70e+00 - 8.30e-01 9.90e-01h 1
5 -2.5537511e+04 2.32e-01 4.71e+04 -1.0 5.14e+00 - 9.43e-01 5.00e-01f 2
6 -2.5498141e+04 5.82e-11 2.08e+03 -1.0 8.94e+01 - 9.90e-01 1.00e+00f 1
7 -2.5478731e+04 5.82e-11 6.22e+04 -1.0 8.85e+03 - 9.94e-01 1.00e+00f 1
8 -2.5442053e+04 1.16e-10 2.99e+04 -1.0 3.90e+05 - 5.19e-01 4.71e-01f 1
9 -2.5407186e+04 1.75e-10 5.45e+00 -1.0 3.02e+05 - 1.00e+00 8.67e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -2.5770169e+04 1.16e-10 2.54e+06 -3.8 1.44e+05 - 7.09e-01 9.63e-01f 1
11 -2.5827425e+04 1.16e-10 2.80e+06 -3.8 3.16e+05 - 3.72e-02 1.00e+00f 1
12 -2.5835509e+04 1.16e-10 3.57e+05 -3.8 9.62e+04 - 8.72e-01 9.79e-01f 1
13 -2.5838459e+04 5.82e-11 6.36e+03 -3.8 5.05e+04 - 9.82e-01 9.35e-01f 1
14 -2.5838550e+04 5.82e-11 1.50e-09 -3.8 5.05e+03 - 1.00e+00 1.00e+00f 1
15 -2.5839366e+04 5.82e-11 2.72e+02 -5.7 1.52e+03 - 1.00e+00 9.82e-01f 1
16 -2.5839376e+04 5.82e-11 1.85e-11 -5.7 2.93e+01 - 1.00e+00 1.00e+00f 1
17 -2.5839386e+04 5.82e-11 9.24e-13 -7.0 1.74e+01 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: -2.5839385846304680e+02 -2.5839385846304678e+04
Dual infeasibility......: 9.2370555648813024e-13 9.2370555648813024e-11
Constraint violation....: 1.6168794698185390e-12 5.8207660913467407e-11
Complementarity.........: 6.6150751169050769e-07 6.6150751169050771e-05
Overall NLP error.......: 6.6150751169050769e-07 6.6150751169050771e-05
Number of objective function evaluations = 19
Number of objective gradient evaluations = 18
Number of equality constraint evaluations = 19
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 18
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.020
Total CPU secs in NLP function evaluations = 0.001
EXIT: Optimal Solution Found.
Fixed costs: 47822.72
Variable costs: 39147.49
Load shedding reported at t=1 - total= 365.74
Number on/offs: 1
Sum on/off ramps: 0.00
Sum nominal ramps: 566.68
Simulating time_step 2020-07-12 23:00
Solving SCED instance
Solving for LMPs
Ipopt 3.13.2: nlp_scaling_method=gradient-based
tol=1e-06
******************************************************************************
This program contains Ipopt, a library for large-scale nonlinear optimization.
Ipopt is released as open source code under the Eclipse Public License (EPL).
For more information visit http://projects.coin-or.org/Ipopt
This version of Ipopt was compiled from source code available at
https://github.com/IDAES/Ipopt as part of the Institute for the Design of
Advanced Energy Systems Process Systems Engineering Framework (IDAES PSE
Framework) Copyright (c) 2018-2019. See https://github.com/IDAES/idaes-pse.
This version of Ipopt was compiled using HSL, a collection of Fortran codes
for large-scale scientific computation. All technical papers, sales and
publicity material resulting from use of the HSL codes within IPOPT must
contain the following acknowledgement:
HSL, a collection of Fortran codes for large-scale scientific
computation. See http://www.hsl.rl.ac.uk.
******************************************************************************
This is Ipopt version 3.13.2, running with linear solver ma27.
Number of nonzeros in equality constraint Jacobian...: 609
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 383
variables with only lower bounds: 96
variables with lower and upper bounds: 275
variables with only upper bounds: 12
Total number of equality constraints.................: 347
Total number of inequality constraints...............: 0
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -2.3439676e+04 5.00e+03 9.90e+01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.3594881e+04 5.00e+03 9.91e+01 -1.0 2.70e+04 - 9.41e-04 7.97e-04h 1
2 3.9255341e+04 4.94e+03 1.00e+02 -1.0 2.80e+03 - 4.91e-04 1.21e-02h 1
3 9.5473587e+05 4.06e+03 8.03e+01 -1.0 2.33e+03 - 8.48e-01 1.77e-01h 1
4 2.8883842e+06 1.25e+03 2.45e+01 -1.0 1.53e+04 - 2.63e-01 6.92e-01h 1
5 2.3150580e+06 1.25e+01 3.57e+01 -1.0 1.79e+04 - 6.38e-01 9.90e-01f 1
6 2.5141463e+05 1.20e-01 7.76e+02 -1.0 1.92e+04 - 7.96e-01 9.90e-01f 1
7 1.6430257e+04 3.78e-03 2.78e+03 -1.0 2.22e+03 - 9.76e-01 9.69e-01f 1
8 1.5959195e+04 2.40e-03 3.42e+06 -1.0 4.93e+02 - 9.90e-01 3.66e-01f 1
9 1.5836993e+04 1.92e-03 3.09e+06 -1.0 2.30e+03 - 3.23e-01 1.98e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 1.5350025e+04 5.82e-11 1.00e-06 -1.0 1.72e+02 - 1.00e+00 1.00e+00f 1
11 1.3800146e+04 5.82e-11 4.37e+03 -5.7 5.62e+02 - 9.99e-01 1.00e+00f 1
12 1.3800019e+04 5.82e-11 3.07e+02 -5.7 1.03e-01 - 1.00e+00 9.30e-01f 1
13 1.3800022e+04 5.82e-11 1.85e-11 -5.7 5.02e-03 - 1.00e+00 1.00e+00f 1
14 1.3799998e+04 5.82e-11 9.38e-13 -7.0 8.43e-03 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 14
(scaled) (unscaled)
Objective...............: 1.3799998275500917e+02 1.3799998275500917e+04
Dual infeasibility......: 9.3791641120333225e-13 9.3791641120333225e-11
Constraint violation....: 5.8207660913467407e-11 5.8207660913467407e-11
Complementarity.........: 2.0971361462583905e-07 2.0971361462583904e-05
Overall NLP error.......: 2.0971361462583905e-07 2.0971361462583904e-05
Number of objective function evaluations = 15
Number of objective gradient evaluations = 15
Number of equality constraint evaluations = 15
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 15
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 14
Total CPU secs in IPOPT (w/o function evaluations) = 0.013
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Fixed costs: 37682.80
Variable costs: 38684.49
Load shedding reported at t=1 - total= 788.86
Number on/offs: 3
Sum on/off ramps: 0.00
Sum nominal ramps: 0.00
Saving bidding results to disk...
Saving tracking results to disk...
Simulation Complete
Total simulation time: 796.53 seconds
Analyze Results
First, we look at the results of the tracking problem i.e., whether the power sold to the grid matches with the power the nuclear plant is required to dispatch. These results are stored in tracker_detail.csv file in the newly created bidding_multiperiod_nuclear folder.
[9]:
# Add the new folder containing the results to the path
sys.path.append(str(pathlib.Path().resolve()) + "\\bidding_multiperiod_nuclear")
# Read the results and generate the plot
track_df = pd.read_csv("tracker_detail.csv")
hour = []
power_dispatch = []
power_output = []
for i in range(int(len(track_df["Power Dispatch [MW]"]) / tracking_horizon)):
hour.append(i)
power_dispatch.append(track_df["Power Dispatch [MW]"][tracking_horizon * i])
power_output.append(track_df["Power Output [MW]"][tracking_horizon * i])
plt.plot(hour, power_dispatch, color='blue',
drawstyle='steps', label="Dispatch")
plt.plot(hour, power_output, '--', color='red',
drawstyle='steps', label="Output")
plt.xlabel("Hour")
plt.ylabel("Power [MW]")
plt.legend(loc='upper center', bbox_to_anchor=(0.5, 1.2), ncol=2)
plt.show()
Clearly, integrating the nuclear power plant with a low temperature electrolysis unit increases the flexibility of the power output from the nuclear power plant to the grid. And, the integrated system is able to track the optimal dispatch profile. Next, we plot amount of hydrogen sold to the market as a function of time, and the variation of tank holdup as a function of time.
[10]:
track_df = pd.read_csv("tracking_model_detail.csv")
hour = []
h2_market = []
h2_storage = []
for i in range(int(len(track_df["Power to Grid [MW]"]) / tracking_horizon)):
hour.append(i)
h2_market.append(track_df["Hydrogen Market [kg/hr]"][tracking_horizon * i])
h2_storage.append(track_df["Final holdup [kg]"][tracking_horizon * i])
fig, (ax1, ax2) = plt.subplots(1, 2)
ax1.plot(hour, h2_market, color='red', drawstyle='steps')
ax1.set_title(f"Hydrogen market")
ax1.set_xlabel("Hour")
ax1.set_ylabel("Hydrogen Sold [kg/hr]")
ax2.plot(hour, h2_storage, color="blue")
ax2.set_title("Hydrogen Storage")
ax2.set_xlabel("Hour")
ax2.set_ylabel("Holdup [kg]")
fig.tight_layout()
plt.show()
Here, the rate of hydrogen production can be much higher than the rate at which it can be sold to the market. Therefore, the excess hydrogen produced during the periods of low LMP (locational marginal price) is stored in the tank, and sold to the market at a later time when the LMP is high.
The remaining results in the bidding_multiperiod_nuclear folder can be imported and analyzed in a similar manner.