This work presents a binary expansion (BE) solution approach to the problem of strategic bidding under uncertainty in short-term electricity markets. The BE scheme is used to transform the products of variables in the nonlinear bidding problem into a mixed integer linear programming formulation, which can be solved by commercially available computational systems. The BE scheme is applicable to pure price, pure quantity, or joint price/quantity bidding models. It is also possible to represent transmission networks, uncertainties (scenarios for price, quantity, plant availability, and load), financial instruments, capacity reinforcement decisions, and unit commitment. The application of the methodology is illustrated in case studies, with configurations derived from the 80-GW Brazilian system.
This paper presents a mixed integer linear programming solution approach for the equilibrium problem with equilibrium constraints (EPEC) problem of finding the Nash equilibrium (NE) in strategic bidding in short-term electricity markets. A binary expansion (BE) scheme is used to transform the nonlinear, nonconvex, NE problem into a mixed integer linear problem (MILP), which can be solved by commercially available computational systems. The BE scheme can be applicable to Cournot, Bertrand, or joint price/quantity bidding models. The approach is illustrated in case studies with configurations derived from the 95-GW Brazilian system, including unit-commitment decisions to the price-maker agents.
19 September 2007 in Computational Optimization and Applications
Problems of scheduling batch-processing machines to minimise the makespan are widely exploited in the literature, mainly motivated by real-world applications, such as burn-in tests in the semiconductor industry. These problems consist of grouping jobs in batches and scheduling them on machines. We consider problems where jobs have non-identical sizes and processing times, and the total size of each batch cannot exceed the machine capacity. The processing time of a batch is defined as the longest processing time among all jobs assigned to it. Jobs can also have non-identical release times, and in this case, a batch can only be processed when all jobs assigned to it are available. This paper discusses four different versions of batch scheduling problems, considering a single processing machine or parallel processing machines and considering jobs with or without release times. New mixed integer linear programming formulations are proposed as enhancements of formulations proposed in the literature, and symmetry breaking constraints are investigated to reduce the size of the feasible sets. Computational results show that the proposed formulations have a better performance than other models in the literature, being able to solve to optimality instances only considered before to be solved by heuristic procedures.