AbstractA maximization problem with linear inequality constraints and different kinds of nonconcave objective functions is considered. By means of parametric quadratic programming, the solution of the original problem is reduced to the determination of the absolute maximum of a continuous function of one variable on a bounded interval
The non-linear programming problem seeks to maximize a function f(x) where the n component vector x ...
In this paper we study the problem of parametric minimization of convex piecewise quadratic function...
AbstractBy using the theory of parametric semi-infinite programming, we show that the solution of a ...
AbstractA maximization problem with linear inequality constraints and different kinds of nonconcave ...
In this paper, we present a nonparametric linear programming estimation method of unique unknown obj...
The aim of this paper is to show how a wide class of generalized quadratic programs can be solved, i...
In this paper, a method for solving constrained convex optimization problems is introduced. The prob...
The content of this work is a presentation of algorithms solving optimization problems with a max-se...
An algorithm is described for determining the optimal solution of parametric linear and quadratic pr...
ABSTRACT In this paper, we consider the problem of minimization of an objective function having cont...
Abstract In this paper, the nonlinear minimax problems with inequality constraints are discussed. Ba...
This paper addresses itself to the maximization of a convex quadratic function subject to linear con...
This paper describes a method of minimizing a strictly convex quadratic functional of several variab...
In this paper, we present an effective algorithm for globally solving quadratic programs with quadra...
We consider a linear programming problem, with two parameters in the objective function, and present...
The non-linear programming problem seeks to maximize a function f(x) where the n component vector x ...
In this paper we study the problem of parametric minimization of convex piecewise quadratic function...
AbstractBy using the theory of parametric semi-infinite programming, we show that the solution of a ...
AbstractA maximization problem with linear inequality constraints and different kinds of nonconcave ...
In this paper, we present a nonparametric linear programming estimation method of unique unknown obj...
The aim of this paper is to show how a wide class of generalized quadratic programs can be solved, i...
In this paper, a method for solving constrained convex optimization problems is introduced. The prob...
The content of this work is a presentation of algorithms solving optimization problems with a max-se...
An algorithm is described for determining the optimal solution of parametric linear and quadratic pr...
ABSTRACT In this paper, we consider the problem of minimization of an objective function having cont...
Abstract In this paper, the nonlinear minimax problems with inequality constraints are discussed. Ba...
This paper addresses itself to the maximization of a convex quadratic function subject to linear con...
This paper describes a method of minimizing a strictly convex quadratic functional of several variab...
In this paper, we present an effective algorithm for globally solving quadratic programs with quadra...
We consider a linear programming problem, with two parameters in the objective function, and present...
The non-linear programming problem seeks to maximize a function f(x) where the n component vector x ...
In this paper we study the problem of parametric minimization of convex piecewise quadratic function...
AbstractBy using the theory of parametric semi-infinite programming, we show that the solution of a ...
DOI
Add to ORKG