Discrete solutions to engineering design problems

DOI10.1007/BF01535495zbMath0296.90030OpenAlexW2089343171MaRDI QIDQ1213829

Gary A. Kochenberger, John J. Dinkel

Publication date: 1975

Published in: Journal of Engineering Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Cutting-Plane Method for Solving Convex Programs
• Complementary Geometric Programming
• A linear programming approach to geometric programs
• An Algorithm for Separable Nonconvex Programming Problems
• Letter to the Editor—A Note on the Branch-and-Bound Principle
• Branch-and-Bound Methods: General Formulation and Properties
• Linearizing Geometric Programs

This page was built for publication: Discrete solutions to engineering design problems