{
  "id": "1205.0856",
  "version": "v1",
  "published": "2012-05-04T03:57:59.000Z",
  "updated": "2012-05-04T03:57:59.000Z",
  "title": "Global Optimal Solution to Discrete Value Selection Problem with Inequality Constraints",
  "authors": [
    "Ning Ruan",
    "David Yang Gao"
  ],
  "comment": "18 pages and 1 figure",
  "categories": [
    "math.OC",
    "cs.DM"
  ],
  "abstract": "This paper presents a canonical dual method for solving a quadratic discrete value selection problem subjected to inequality constraints. The problem is first transformed into a problem with quadratic objective and 0-1 integer variables. The dual problem of the 0-1 programming problem is thus constructed by using the canonical duality theory. Under appropriate conditions, this dual problem is a maximization problem of a concave function over a convex continuous space. Numerical simulation studies, including some large scale problems, are carried out so as to demonstrate the effectiveness and efficiency of the method proposed.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-05-04T03:57:59.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "global optimal solution",
      "inequality constraints",
      "quadratic discrete value selection problem",
      "dual problem"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 18,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1205.0856R"
    }
  }
}