You are not currently logged in.
Access JSTOR through your library or other 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
Stable URL: http://www.jstor.org/stable/3009968
Page Count: 8
You can always find the topics here!Topics: Cost functions, Optimal solutions, Linear programming, Objective functions, Mathematical problems, Quadratic programming, Goal programming, Operations research, Mathematical vectors, Mathematical functions
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
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.
The Journal of the Operational Research Society © 1998 Operational Research Society