A Dynamic Programming Algorithm for Solving Bi-Objective Fuzzy Knapsack Problem

DOI10.1007/978-81-322-2452-5_20zbMath1327.90268OpenAlexW1456007248MaRDI QIDQ3449428

No author found.

Publication date: 4 November 2015

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-81-322-2452-5_20

zbMATH Keywords

dynamic programmingtriangular fuzzy numberbi-objective fuzzy knapsack problemcompromise ratio methodpossibility index

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Dynamic programming (90C39)

Related Items (2)

Intuitionistic fuzzy knapsack problem trough the index matrices prism ⋮ Bi-level optimization based on fuzzy if-then rule

Cites Work

• Unnamed Item
• The 0-1 knapsack problem with fuzzy data
• Default reasoning and possibility theory
• Dynamic programming algorithms for the zero-one knapsack problem
• On comparing interval numbers
• DYNAMIC PROGRAMMING AND LAGRANGE MULTIPLIERS
• Fuzzy sets
• Decision-Making in a Fuzzy Environment
• Dynamical aspects in fuzzy decision making
• Using fuzzy numbers in knapsack problems

This page was built for publication: A Dynamic Programming Algorithm for Solving Bi-Objective Fuzzy Knapsack Problem