Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment
From MaRDI portal
Publication:5963234
DOI10.1007/s11590-015-0880-9zbMath1343.90073OpenAlexW2077378401MaRDI QIDQ5963234
Yan Zhang, Nikolaos V. Sahinidis
Publication date: 4 March 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0880-9
Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (3)
Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models ⋮ A bicriteria perspective on \(L\)-penalty approaches -- a corrigendum to Siddiqui and Gabriel's \(L\)-penalty approach for solving MPECs ⋮ Preface to the special issue ``Recent developments in non-linear and global optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Risk aversion and CO\(_{2}\) regulatory uncertainty in power generation investment: policy and modeling implications
- A polyhedral branch-and-cut approach to global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- BARON: A general purpose global optimization software package
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Global optimization of nonconvex problems with multilinear intermediates
- Incorporating oligopoly, CO\(_{2}\) emissions trading and green certificates into a power generation expansion model
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Nonlinear Programming
- Global optimization of general non-convex problems with intermediate bilinear substructures
- Global Optimization and Constraint Satisfaction
- Complementarity: applications, algorithms and extensions. Papers from the international conference on complementarity (ICCP 99), Madison, WI, USA, June 9--12, 1999
This page was built for publication: Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment