Simple solution procedures for nonlinear programming problems that are derivative decomposable

DOI10.1016/0377-2217(87)90145-7zbMath0643.90080OpenAlexW2058552190MaRDI QIDQ1102204

Robert C. Carlson, James V. Jucker, James E. Hodder

Publication date: 1987

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(87)90145-7

zbMATH Keywords

derivative decomposability

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (1)

An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies

Cites Work

• A simple plant-location model for quantity-setting firms subject to price uncertainty
• Single‐period inventory models with demand uncertainty and quantity discounts: Behavioral implications and a new solution procedure
• Simple Ranking Methods for Allocation of One Resource
• Technical Note—Allocation of Effort Resources among Competing Activities
• Unnamed Item

This page was built for publication: Simple solution procedures for nonlinear programming problems that are derivative decomposable