The Perspective Reformulation (PR) of a Mixed-Integer NonLinear Program with semi-continuous variables is obtained by replacing each term in the (separable) objective function with its convex envelope. Solving the corresponding continuous relaxation requires appropriate techniques. Under some rather restrictive assumptions, the Projected PR (P^2R) can be defined where the integer variables are eliminated by projecting the solution set onto the space of the continuous variables only. This approach produces a simple piecewise-convex problem with the same structure as the original one; however, this prevents the use of general-purpose solvers, in that some variables are then only implicitly represented in the formulation. We show how to constr...
Our study is motivated by the solution of Mixed-Integer Non-Linear Programming (MINLP) problems with...
The Sequential Convex MINLP (SC-MINLP) technique is a solution method for nonconvex Mixed-Integer No...
International audienceWe aim at generalizing formulations for non-convex piecewise-linear problems t...
International audienceThe perspective reformulation (PR) of a Mixed-Integer NonLinear Program with s...
The perspective reformulation (PR) of a Mixed-Integer NonLinear Program with semi-continuous variabl...
The Perspective Reformulation (PR) of a Mixed-Integer NonLinear Program with semi-continuous variabl...
We propose an improvement of the Approximated Projected Perspective Reformulation (AP2R) for dealing...
We propose an improvement of the Approximated Projected Perspective Reformulation (AP^2R) of [Frangi...
The Perspective Reformulation is a general approach for constructing tight approximations to MINLP p...
The Perspective Relaxation (PR) is a general approach for constructing tight approximations to Mixed...
The Sequential Convex MINLP (SC-MINLP) technique is a solution method for nonconvex Mixed-Integer No...
Abstract. In this paper we survey recent work on the perspective reformulation approach that generat...
The Perspective Relaxation (PR) is a general approach for constructing tight approximations to Mixed...
We propose an improvement of the Approximated Projected Perspective Reformulation (AP2R)of [1] for t...
Our study is motivated by the solution of Mixed-Integer Non-Linear Programming (MINLP) problems with...
Our study is motivated by the solution of Mixed-Integer Non-Linear Programming (MINLP) problems with...
The Sequential Convex MINLP (SC-MINLP) technique is a solution method for nonconvex Mixed-Integer No...
International audienceWe aim at generalizing formulations for non-convex piecewise-linear problems t...
International audienceThe perspective reformulation (PR) of a Mixed-Integer NonLinear Program with s...
The perspective reformulation (PR) of a Mixed-Integer NonLinear Program with semi-continuous variabl...
The Perspective Reformulation (PR) of a Mixed-Integer NonLinear Program with semi-continuous variabl...
We propose an improvement of the Approximated Projected Perspective Reformulation (AP2R) for dealing...
We propose an improvement of the Approximated Projected Perspective Reformulation (AP^2R) of [Frangi...
The Perspective Reformulation is a general approach for constructing tight approximations to MINLP p...
The Perspective Relaxation (PR) is a general approach for constructing tight approximations to Mixed...
The Sequential Convex MINLP (SC-MINLP) technique is a solution method for nonconvex Mixed-Integer No...
Abstract. In this paper we survey recent work on the perspective reformulation approach that generat...
The Perspective Relaxation (PR) is a general approach for constructing tight approximations to Mixed...
We propose an improvement of the Approximated Projected Perspective Reformulation (AP2R)of [1] for t...
Our study is motivated by the solution of Mixed-Integer Non-Linear Programming (MINLP) problems with...
Our study is motivated by the solution of Mixed-Integer Non-Linear Programming (MINLP) problems with...
The Sequential Convex MINLP (SC-MINLP) technique is a solution method for nonconvex Mixed-Integer No...
International audienceWe aim at generalizing formulations for non-convex piecewise-linear problems t...