- Title
- Global optimality conditions for some classes of polynomial integer programming problems
- Creator
- Quan, Jing; Wu, Zhiyou; Li, Guoquan
- Date
- 2011
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/32340
- Identifier
- vital:3840
- Identifier
- ISSN:1547-5816
- Abstract
- In 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.
- Relation
- Journal of Industrial and Management Optimization Vol. 7, no. 1 (2011), p. 67-78
- Rights
- Open Access
- Rights
- This metadata is freely available under a CCO license
- Subject
- Abstract convexity; Global optimality conditions; Polynomial integer programming problem
- Full Text
- Reviewed
- Hits: 529
- Visitors: 603
- Downloads: 94
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCE1 | Published | 310 KB | Adobe Acrobat PDF | View Details Download |