In this chapter, we investigate the smooth representation of the (weakly) efficient solution set of a piecewise linear parametric multiobjective program. We show that if the data of a piecewise linear multiobjective program are smooth functions of a parameter then the (weakly) efficient solution set of the problem can be locally represented as a union of finitely many polyhedra whose vertices and directions are smooth functions of the parameter.Department of Applied Mathematic
We develop explicit, piecewise-linear formulations of functions f(x):ℝn{mapping}ℝ, n ≤ 3, that are d...
This paper shows the relationship between degeneracy degrees and multiple solutions in linear progra...
This note brings together two fundamental topics: polyhedral projection and parametric linear progra...
In this paper, the Pareto solution set of a piecewise linear multiobjective optimization problem in ...
The aim of this paper is to obtain the range set for a given multiobjective linear programming probl...
Introduction Piecewise linear algorithms, also referred to in the literature as simplicial algorith...
We consider multi-objective convex optimal control problems. First we state a relationship between t...
This thesis is a study of convex parametric programs on regions of stability. The main tools are com...
An approach to generating all efficient solutions of multiple objective programs with piecewise line...
Several optimization-based control design techniques can be cast in the form of parametric optimizat...
International audienceConvex polyhedra capture linear relations between variables. They are used in ...
In this paper we study piecewise linear multicriteria programs, that is, multicriteria programs with...
We consider a linear programming problem, with two parameters in the objective function, and present...
Motivated by the successful application of mathematical programming techniques to difficult machine ...
This paper shows the relationship between degeneracy degrees and multiple solutions in linear progra...
We develop explicit, piecewise-linear formulations of functions f(x):ℝn{mapping}ℝ, n ≤ 3, that are d...
This paper shows the relationship between degeneracy degrees and multiple solutions in linear progra...
This note brings together two fundamental topics: polyhedral projection and parametric linear progra...
In this paper, the Pareto solution set of a piecewise linear multiobjective optimization problem in ...
The aim of this paper is to obtain the range set for a given multiobjective linear programming probl...
Introduction Piecewise linear algorithms, also referred to in the literature as simplicial algorith...
We consider multi-objective convex optimal control problems. First we state a relationship between t...
This thesis is a study of convex parametric programs on regions of stability. The main tools are com...
An approach to generating all efficient solutions of multiple objective programs with piecewise line...
Several optimization-based control design techniques can be cast in the form of parametric optimizat...
International audienceConvex polyhedra capture linear relations between variables. They are used in ...
In this paper we study piecewise linear multicriteria programs, that is, multicriteria programs with...
We consider a linear programming problem, with two parameters in the objective function, and present...
Motivated by the successful application of mathematical programming techniques to difficult machine ...
This paper shows the relationship between degeneracy degrees and multiple solutions in linear progra...
We develop explicit, piecewise-linear formulations of functions f(x):ℝn{mapping}ℝ, n ≤ 3, that are d...
This paper shows the relationship between degeneracy degrees and multiple solutions in linear progra...
This note brings together two fundamental topics: polyhedral projection and parametric linear progra...