On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory
type: Item
instance of: scholarly article
title: On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory
zbMATH Open document ID: 1381.90081
author: Richard Oberdieck
author: Nikolaos A. Diangelakis
author: Styliani Avraamidou
author: Efstratios N. Pistikopoulos
published in: Journal of Global Optimization
publication date: 2017-12-07T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 6816342
zbMATH Keywords: unbounded problems
zbMATH Keywords: binary parameters
zbMATH Keywords: multi-parametric programming
zbMATH Keywords: mixed integer bilevel programming
describes a project that uses: PAROC
MaRDI profile type: Publication
full work available at URL: s10898-016-0463-z
OpenAlex ID: W2512619996
cites work: Every Continuous Nonlinear Control System Can be Obtained by Parametric Convex Programming
cites work: Q3989989
cites work: The explicit linear quadratic regulator for constrained systems
cites work: Q3151174
cites work: Dynamic programming for constrained optimal control of discrete-time linear hybrid systems
cites work: Pessimistic Bilevel Optimization
cites work: Discrete bilevel programming: application to a natural gas cash-out problem
cites work: A multi-parametric programming approach for multilevel hierarchical and decentralised optimisation problems
cites work: Parametric global optimisation for bilevel programming
cites work: An improved algorithm for combinatorial multi-parametric quadratic programming
cites work: Sensitivity analysis for nonlinear programming using penalty methods
cites work: Introduction to sensitivity and stability analysis in nonlinear programming
cites work: Q4331736
cites work: Global optimization of mixed-integer bilevel programming problems
cites work: A novel approach to multiparametric quadratic programming
cites work: Inverse Parametric Optimization With an Application to Hybrid System Control
cites work: Enumeration-based approach to solving parametric linear complementarity problems
cites work: Multiparametric linear programming with applications to control
cites work: A branch-and-bound multi-parametric programming approach for non-convex multilevel optimization with polyhedral constraints
cites work: Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
cites work: Parametric integer programming algorithm for bilevel mixed integer programs
cites work: Exponential distribution-based genetic algorithm for solving mixed-integer bilevel programming problems
cites work: Global solution of nonlinear mixed-integer bilevel programs
cites work: Global solution of bilevel programs with a nonconvex inner program
cites work: The Mixed Integer Linear Bilevel Programming Problem
cites work: Fully Inverse Parametric Linear/Quadratic Programming Problems via Convex Liftings
cites work: COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL INTEGER PROGRAMMING PROBLEMS
cites work: Explicit hybrid model-predictive control: the exact solution
cites work: A branch and bound method for the solution of multiparametric mixed integer linear programming problems
cites work: Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications
cites work: Resolution method for mixed integer bi-level linear problems based on decomposition technique
cites work: A class of algorithms for mixed-integer bilevel min-max optimization
cites work: A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
cites work: A simple tabu search method to solve the mixed-integer linear bilevel programming problem
cites work: An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
DOI: 10.1007/S10898-016-0463-Z
description: scientific article; zbMATH DE number 6816342