A new concave reformulation and its application in solving DC programming globally under uncertain environment | Zendy

Yanjun Wang | Zendy; Kaiji Shen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A new concave reformulation and its application in solving DC programming globally under uncertain environment

Author(s) -

Yanjun Wang,

Kaiji Shen

Publication year - 2019

Publication title -

journal of industrial and management optimization

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.325

H-Index - 32

eISSN - 1553-166X

pISSN - 1547-5816

DOI - 10.3934/jimo.2019057

Subject(s) - mathematical optimization , convex hull , simplex algorithm , simplex , cvar , feasible region , regular polygon , computer science , relaxation (psychology) , global optimization , set (abstract data type) , convex optimization , robust optimization , linear programming , sequence (biology) , constraint (computer aided design) , mathematics , combinatorics , psychology , social psychology , expected shortfall , geometry , management , economics , programming language , risk management , biology , genetics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research