Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

Sufficient optimality criterion for linearly constrained, separable concave minimization problems

Illes, T. and Nagy, Á.B. (2005) Sufficient optimality criterion for linearly constrained, separable concave minimization problems. Journal of Optimization Theory and Applications, 125 (3). pp. 559-575. ISSN 0022-3239

Full text not available in this repository. (Request a copy from the Strathclyde author)

Abstract

A sufficient optimality criterion for linearly-constrained concave minimization problems is given in this paper. Our optimality criterion is based on the sensitivity analysis of the relaxed linear programming problem. The main result is similar to that of Phillips and Rosen (Ref. 1); however, our proofs are simpler and constructive. In the Phillips and Rosen paper (Ref. 1), they derived a sufficient optimality criterion for a slightly different linearly-constrained concave minimization problem using exponentially many linear programming problems. We introduce special test points and, using these for several cases, we are able to show optimality of the current basic solution. The sufficient optimality criterion described in this paper can be used as a stopping criterion for branch-and-bound algorithms developed for linearly-constrained concave minimization problems.

Item type: Article
ID code: 9233
Keywords: separable concave minimization problems, linear relaxation, sensitivity analysis, Management. Industrial Management, Control and Optimization, Management Science and Operations Research, Applied Mathematics
Subjects: Social Sciences > Industries. Land use. Labor > Management. Industrial Management
Department: Strathclyde Business School > Management Science
Related URLs:
    Depositing user: Strathprints Administrator
    Date Deposited: 30 Mar 2010 12:00
    Last modified: 04 Sep 2014 19:54
    URI: http://strathprints.strath.ac.uk/id/eprint/9233

    Actions (login required)

    View Item