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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Optimization Ročník 43; číslo 2; s. 145 - 156
Hlavní autoři: Saxena, Ratnesh R., Arora, S.R.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Gordon and Breach Science Publishers 01.01.1998
Témata:
Efficient Solution
Integer Programming
Multi-Objective
Quadratic Programming
Set Covering
ISSN:0233-1934, 1029-4945
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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