Ranking in integer programming with bounded variables.

DOI10.1007/BF03398734MaRDI QIDQ2476433zbMATH OpenOpenAlexFDO

Authors Kalpana Dahiya, Vanita Verma

Publication date 19 March 2008

Published in Opsearch (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingrankinginteger programmingfractional programming

Mathematics Subject Classification ID

Fractional programming (90C32) Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Ranking in integer linear fractional programming problems
• Ranking in quadratic integer programming problems
• Integer quadratic fractional programming problems with bounded variables
• On ranking of feasible solutions of a bottleneck linear programming problem
• A ranking algorithm for bi-objective quadratic fractional integer programming problems

Cites work

• scientific article; zbMATH DE number 3704369 (Why is no real title available?)
• scientific article; zbMATH DE number 3501240 (Why is no real title available?)
• scientific article; zbMATH DE number 3523317 (Why is no real title available?)
• scientific article; zbMATH DE number 3284930 (Why is no real title available?)
• A note on integer linear fractional programming
• An Improved Branch and Bound Method for Mixed Integer Linear Fractional Programs
• Ranking in integer linear fractional programming problems
• SOME ASPECTS OF LINEAR FRACTIONAL FUNCTIONALS PROGRAMMING

Cited in

(5)

• Ranking in integer linear fractional programming problems
• Integer quadratic fractional programming problems with bounded variables
• Constrained integer fractional programming problem with box constraints
• Ranking in quadratic integer programming problems
• A ranking algorithm for bi-objective quadratic fractional integer programming problems

This page was built for publication: Ranking in integer programming with bounded variables.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476433)