Simple solution procedures for nonlinear programming problems that are derivative decomposable

DOI10.1016/0377-2217(87)90145-7MaRDI QIDQ1102204zbMATH OpenOpenAlexFDO

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

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 methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• A PRACTICAL APPROACH TO DECOMPOSABLE NONLINEAR PROGRAMMING PROBLEMS
• On solving three classes of nonlinear programming problems via simple differentiable penalty functions
• An Exact Penalty Function and Relaxation Approach for Solving Decomposable Nonlinear Programs
• Linear decomposition approach for a class of nonconvex programming problems
• Method of solution of nonlinear programming problems

Cites work

• A simple plant-location model for quantity-setting firms subject to price uncertainty
• scientific article; zbMATH DE number 3601414 (Why is no real title available?)
• Simple Ranking Methods for Allocation of One Resource
• Single‐period inventory models with demand uncertainty and quantity discounts: Behavioral implications and a new solution procedure
• Technical Note—Allocation of Effort Resources among Competing Activities

Cited in

(2)

• An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies
• A simple canonical form for nonlinear programming problems and its use

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

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