Some Approaches for Solving the Discretely-Constrained Mixed Complementarity Problem (DC-MCP)
GERAD Research Center via YouTube
Build with Azure OpenAI, Copilot Studio & Agentic Frameworks — Microsoft Certified
Get 20% off all career paths from fullstack to AI
Overview
Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
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