2015
DOI: 10.1016/j.amc.2015.04.040
|View full text |Cite
|
Sign up to set email alerts
|

Global optimality conditions and optimization methods for constrained polynomial programming problems

Abstract: a b s t r a c tThe general constrained polynomial programming problem (GPP) is considered in this paper. Problem (GPP) has a broad range of applications and is proved to be NP-hard. Necessary global optimality conditions for problem (GPP) are established. Then, a new local optimization method for this problem is proposed by exploiting these necessary global optimality conditions. A global optimization method is proposed for this problem by combining this local optimization method together with an auxiliary fun… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 24 publications
(40 reference statements)
0
1
0
Order By: Relevance
“…Therefore, it is necessary to improve the reliability and the forecasting accuracy of smart grids [18][19][20]. Reliable EL forecasting is able to decrease energy consumption and reduce environmental pollution [21][22][23][24].…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, it is necessary to improve the reliability and the forecasting accuracy of smart grids [18][19][20]. Reliable EL forecasting is able to decrease energy consumption and reduce environmental pollution [21][22][23][24].…”
Section: Introductionmentioning
confidence: 99%