The use of relaxation techniques to solve certain mathematical decision‐making problems

DOI10.1080/0020739800110110zbMath0428.90063OpenAlexW1992168793MaRDI QIDQ3865861

John M. Wilson

Publication date: 1980

Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020739800110110

zbMATH Keywords

surveydecision-makingrelaxation techniques

Mathematics Subject Classification ID

Nonlinear programming (90C30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Cites Work

• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Decomposition Principle for Linear Programs
• Integer programming approaches to the travelling salesman problem
• A Branch and Bound Procedure for a Class of Discrete Resource Allocation Problems with Several Constraints
• A tree-search algorithm for mixed integer programming problems