A goal programming approach to solve linear fractional multi-objective set covering problem.

DOI10.1007/BF03398721zbMath1160.90588OpenAlexW2771616860MaRDI QIDQ2476423

Neelam Malhotra, Ravi Shanker, Sant R. Arora

Publication date: 19 March 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398721

zbMATH Keywords

goal programmingfractional programmingmulti-objectiveset-covering problem

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29) Fractional programming (90C32)

Related Items (1)

An approach to find redundant objective function(s) and redundant constraint(s) in multi-objective nonlinear stochastic fractional programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Goal programming with linear fractional criteria
• Linear approach to linear fractional goal programming
• Cutting planes from conditional bounds: A new approach to set covering
• A Greedy Heuristic for the Set-Covering Problem
• Programming with linear fractional functionals
• Computer Solutions to Minimum-Cover Problems
• Set Covering and Involutory Bases
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
• Linear Programming with a Fractional Objective Function

This page was built for publication: A goal programming approach to solve linear fractional multi-objective set covering problem.