YoVDO

Some Approaches for Solving the Discretely-Constrained Mixed Complementarity Problem (DC-MCP)

Offered By: GERAD Research Center via YouTube

Tags

Discrete Optimization Courses Energy Systems Courses Algorithms Courses Numerical Methods Courses Integer Programming Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 36-minute seminar from the "Un chercheur du GERAD vous parle!" series, presented by Steven A. Gabriel from the University of Maryland. Delve into the world of discretely-constrained mixed complementarity problems (DC-MCP), a class of equilibrium problems combining integer restrictions with MCP systems. Discover the applications of DC-MCP in energy and transportation sectors, considering equity aspects while maintaining player autonomy. Gain insights into both theoretical foundations and numerical results supporting various approaches to solve these challenging problems. Learn about the motivation behind DC-MCP and its significance in real-world scenarios.

Syllabus

Some Approaches for Solving the Discretely-Constrained Mixed Complementarity Problem (DC-MCP)


Taught by

GERAD Research Center

Related Courses

Information Theory
The Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera