Decomposition of satisficing decision problems

DOI10.1016/S0020-0255(80)80005-3MaRDI QIDQ1148772zbMATH OpenOpenAlexFDO

Authors Shinzo Takatsu

Publication date 1980

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0255(80)80005-3

zbMATH Keywords

decompositionhierarchical systemslarge-scale satisficing problemssatisficing decision problems

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Decision theory (91B06)

Cites work

• scientific article; zbMATH DE number 3795695 (Why is no real title available?)
• scientific article; zbMATH DE number 3319498 (Why is no real title available?)
• scientific article; zbMATH DE number 3327714 (Why is no real title available?)
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• Algebraic properties of satisficing decision criterion
• Characterization of satisficing decision criterion
• Convex Analysis
• Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• On a qualitative theory o f satisfactory control

Cited in

(4)

• MULTIPLE‐OBJECTIVE SATISFICING DECISION PROBLEMS
• EXISTENCE OF SATISFICING SOLUTIONS
• Satisficing games
• Latent satisficing decision criterion

This page was built for publication: Decomposition of satisficing decision problems

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