This paper deals with multiparametric nonlinear integer programming problems where the optimization variables belong to a finite set and where the cost function and the constraints depend in an arbitrary nonlinear fashion on the optimization variables and in a linear fashion on the parameters. We examine the main theoretical properties of the optimizer and of the optimum as a function of the parameters, and propose a solution algorithm. The methodology is employed to investigate properties of quantized optimal control laws and optimal performance, and to obtain their explicit representation as a function of the state vector
The multiparametric 0-1-Integer Programming (0-1-IP) problem relative to the objective function is...
AbstractQuantified constraints (i.e. first-order formulae over the real numbers) are often exposed t...
In this work, we study exact continuous reformulations of nonlinear integer programming problems. To...
AbstractMotivated by the recent developments of the Control Parametrization Enhancing Technique (CPE...
We consider a special nonlinear Programming problem depend-ing on integer parameters. For some value...
In many real world problems, dealing with uncertainty is a significant challenge for mathematical pr...
This thesis presents works in the research area of quantified constraint programming, which extends ...
In this paper we develop an algorithm to optimise a nonlinear utility function of multiple objective...
[[abstract]]In this paper, we present algorithms for solving families of nonlinear integer programmi...
In recognition of nonlinearity's academic significance in optimization and its importance in real wo...
We consider a special Nonlinear Programming problem depending on integer parameters. For some values...
This paper studies the Graver's optimality conditions for multi-objective non-linear integer program...
This paper presents properties of a control law which quantizes the unconstrained solution to a unit...
This paper presents properties of a control law which quantizes the unconstrained solution to a unit...
We propose a trust-region method that solves a sequence of linear integer programs to tackle integer...
The multiparametric 0-1-Integer Programming (0-1-IP) problem relative to the objective function is...
AbstractQuantified constraints (i.e. first-order formulae over the real numbers) are often exposed t...
In this work, we study exact continuous reformulations of nonlinear integer programming problems. To...
AbstractMotivated by the recent developments of the Control Parametrization Enhancing Technique (CPE...
We consider a special nonlinear Programming problem depend-ing on integer parameters. For some value...
In many real world problems, dealing with uncertainty is a significant challenge for mathematical pr...
This thesis presents works in the research area of quantified constraint programming, which extends ...
In this paper we develop an algorithm to optimise a nonlinear utility function of multiple objective...
[[abstract]]In this paper, we present algorithms for solving families of nonlinear integer programmi...
In recognition of nonlinearity's academic significance in optimization and its importance in real wo...
We consider a special Nonlinear Programming problem depending on integer parameters. For some values...
This paper studies the Graver's optimality conditions for multi-objective non-linear integer program...
This paper presents properties of a control law which quantizes the unconstrained solution to a unit...
This paper presents properties of a control law which quantizes the unconstrained solution to a unit...
We propose a trust-region method that solves a sequence of linear integer programs to tackle integer...
The multiparametric 0-1-Integer Programming (0-1-IP) problem relative to the objective function is...
AbstractQuantified constraints (i.e. first-order formulae over the real numbers) are often exposed t...
In this work, we study exact continuous reformulations of nonlinear integer programming problems. To...