Add to ORKGIn this paper, some verifiable necessary global optimality conditions and sufficient global optimality conditions for some classes of polynomial integer programming problems are established. The relationships between these necessary global optimality conditions and these sufficient global optimality conditions are also discussed. The main theoretical tool for establishing these optimality conditions is abstract convexity
In this paper we derive necessary and sufficient conditions for some problems of global minimization...
Minimizing a polynomial function over a region defined by polynomial inequalities models broad class...
The class of POP (Polynomial Optimization Problems) covers a wide rang of optimization problems such...
Abstract In this paper, we develop necessary conditions for global optimality that apply to non-line...
The general constrained polynomial programming problem (GPP) is considered in this paper. Problem (G...
In this paper, some necessary and some suffcient global optimality conditions for a class of mixed i...
In this paper, we first establish some sufficient and some necessary global optimality conditions fo...
This paper is concerned with the general polynomial programming problem with box constraints, includ...
The polynomial programming problem which has a polynomial objective function, either with no constra...
In this paper we present necessary conditions for global optimality for polyno-mial problems over bo...
We establish new necessary and sufficient optimality conditions for global optimization problems. In...
In this article, by using the Lagrangian function, we investigate the sufficient global optimality c...
This paper studies the Graver's optimality conditions for multi-objective non-linear integer program...
This paper studies the Graver's optimality conditions for multi-objective non-linear integer program...
In this paper, we propose an algorithm for constrained global optimization of mixed-integer nonlinea...
In this paper we derive necessary and sufficient conditions for some problems of global minimization...
Minimizing a polynomial function over a region defined by polynomial inequalities models broad class...
The class of POP (Polynomial Optimization Problems) covers a wide rang of optimization problems such...
Abstract In this paper, we develop necessary conditions for global optimality that apply to non-line...
The general constrained polynomial programming problem (GPP) is considered in this paper. Problem (G...
In this paper, some necessary and some suffcient global optimality conditions for a class of mixed i...
In this paper, we first establish some sufficient and some necessary global optimality conditions fo...
This paper is concerned with the general polynomial programming problem with box constraints, includ...
The polynomial programming problem which has a polynomial objective function, either with no constra...
In this paper we present necessary conditions for global optimality for polyno-mial problems over bo...
We establish new necessary and sufficient optimality conditions for global optimization problems. In...
In this article, by using the Lagrangian function, we investigate the sufficient global optimality c...
This paper studies the Graver's optimality conditions for multi-objective non-linear integer program...
This paper studies the Graver's optimality conditions for multi-objective non-linear integer program...
In this paper, we propose an algorithm for constrained global optimization of mixed-integer nonlinea...
In this paper we derive necessary and sufficient conditions for some problems of global minimization...
Minimizing a polynomial function over a region defined by polynomial inequalities models broad class...
The class of POP (Polynomial Optimization Problems) covers a wide rang of optimization problems such...