Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Handling Soft Constraints via Composite Concave Programming

A. Byrne, M. Sniedovich and L. Churilov
The Journal of the Operational Research Society
Vol. 49, No. 8 (Aug., 1998), pp. 870-877
DOI: 10.2307/3009968
Stable URL: http://www.jstor.org/stable/3009968
Page Count: 8
  • Subscribe ($19.50)
  • Cite this Item
Handling Soft Constraints via Composite Concave Programming
Preview not available

Abstract

In this discussion we propose a method for handling soft constraints in situations where the decision-maker can associate a cost function with the `right-hand side' values of these constraints that satisfies the usual economies of scale property of decreasing marginal costs. The method constitutes a natural application of composite concave programming, and seems to be particularly suited for situations where the underlying problem is of the linear/quadratic programming type.

Page Thumbnails

  • Thumbnail: Page 
[870]
    [870]
  • Thumbnail: Page 
871
    871
  • Thumbnail: Page 
872
    872
  • Thumbnail: Page 
873
    873
  • Thumbnail: Page 
874
    874
  • Thumbnail: Page 
875
    875
  • Thumbnail: Page 
876
    876
  • Thumbnail: Page 
877
    877