Linearization approach to multi-objective quadratic set covering problem

This paper develops an enumerative technique for solving the multi-objective set covering problem with quadratic objective functions subject to linear constraints. The objective functions and constraints are assumed to be differentiable over the feasible set. The technique is based on the linearizat...

Full description

Saved in:
Bibliographic Details
Published in:Optimization Vol. 43; no. 2; pp. 145 - 156
Main Authors: Saxena, Ratnesh R., Arora, S.R.
Format: Journal Article
Language:English
Published: Gordon and Breach Science Publishers 01.01.1998
Subjects:
Efficient Solution
Integer Programming
Multi-Objective
Quadratic Programming
Set Covering
ISSN:0233-1934, 1029-4945
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper develops an enumerative technique for solving the multi-objective set covering problem with quadratic objective functions subject to linear constraints. The objective functions and constraints are assumed to be differentiable over the feasible set. The technique is based on the linearization approach to multi-objective programming problem and cutting plane approach which then construct all the efficient p-tuple prime covers. An example to illustrate the technique is also presented.
ISSN:0233-1934
1029-4945
DOI:10.1080/02331939808844379