Lecture

Power System Economics Fundamentals

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

EE-570: Power system restructuring and deregulation

This course presents different types and mechanisms of electricity markets. It addresses in particular their impacts on power/distribution systems operation and consequently the appropriate strategies capable to ensure a secure and reliable functioning. ...

Description

This lecture covers the fundamentals of power system economics, focusing on the Cournot model of competition and Nash equilibrium points. It explains how generating companies maximize profit by adjusting their output and the calculations involved. The lecture also delves into the optimization problems for generators A and B, emphasizing the importance of system security and ancillary services in power systems.

Instructor

Sidi-Rachid Cherkaoui

Rachid Cherkaoui received the M.S. degree in electrical engineering and the Ph.D. degree from Swiss Federal Institute of Technology (EPFL), Lausanne, in 1983 and 1992 respectively. From 1983 to 1987, he worked at Entreprises Electriques Fribourgeoises (Swiss electrical utility) developing a state estimator and security analysis tools for the HV transmission system of that company. From 1987 to 1992, he joined the power system laboratory of EPFL where he achieved his Ph.D. thesis in the field of optimal operation topologies for distribution systems. In this respect, he was the recipient of the ABB Swiss Award83. Since 1993, he is leading the research activities in the field of optimization and simulation techniques applied to electrical power and distribution systems. Presently his main research topics are electricity market deregulation, distributed generation and storage, and, power system vulnerability mitigation. He is senior member of IEEE, member of technical program committees of various conferences, member of CIGRE task forces C5-2, and IEEE Swiss Chapter officer since 2005. He serves regularly as reviewer for different journals and conferences. Dr. Cherkaoui is the author or co-author of more than 50 scientific publications.

Official source

Ontological neighbourhood

Economics

Macroeconomics: Competition

Related concepts (32)

Optimization problem

In mathematics, computer science and economics, an optimization problem is the problem of finding the best solution from all feasible solutions. Optimization problems can be divided into two categories, depending on whether the variables are continuous or discrete: An optimization problem with discrete variables is known as a discrete optimization, in which an object such as an integer, permutation or graph must be found from a countable set.

Mathematical optimization

Mathematical optimization (alternatively spelled optimisation) or mathematical programming is the selection of a best element, with regard to some criterion, from some set of available alternatives. It is generally divided into two subfields: discrete optimization and continuous optimization. Optimization problems arise in all quantitative disciplines from computer science and engineering to operations research and economics, and the development of solution methods has been of interest in mathematics for centuries.

Combinatorial optimization

Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the set of feasible solutions is discrete or can be reduced to a discrete set. Typical combinatorial optimization problems are the travelling salesman problem ("TSP"), the minimum spanning tree problem ("MST"), and the knapsack problem. In many such problems, such as the ones previously mentioned, exhaustive search is not tractable, and so specialized algorithms that quickly rule out large parts of the search space or approximation algorithms must be resorted to instead.

Oligopoly

An oligopoly () is a market in which control over an industry lies in the hands of a few large sellers who own a dominant share of the market. Oligopolistic markets have homogenous products, few market participants, and inelastic demand for the products in those industries. As a result of their significant market power, firms in oligopolistic markets can influence prices through manipulating the supply function. Firms in an oligopoly are also mutually interdependent, as any action by one firm is expected to affect other firms in the market and evoke a reaction or consequential action.

Convex optimization

Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets (or, equivalently, maximizing concave functions over convex sets). Many classes of convex optimization problems admit polynomial-time algorithms, whereas mathematical optimization is in general NP-hard.

Related lectures (64)

Bidding Strategies: Game Theory & Market Power

Covers bidding strategies, Game Theory, Nash equilibrium, system security, ancillary services, and market power in power systems.

Transmission Pricing & Congestion Management

Explores transmission pricing, congestion management, and redispatching techniques in power systems to optimize costs and ensure fair transactions.

Optimal Dispatch of Power Generation Units

Explores the optimal dispatch of power generation units and the economics of power systems in deregulated environments.

Electricity Market Liberalization

Explores the transition to market competition in electricity supply, promoting efficiency and lower prices.

Transient Stability in Power Systems