An Aggregate Constraint Method for Non-Linear Programming
From MaRDI portal
Publication:3984311
DOI10.1057/jors.1991.190zbMath0742.90070MaRDI QIDQ3984311
Publication date: 27 June 1992
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1991.190
90C30: Nonlinear programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Truncated aggregate homotopy method for nonconvex nonlinear programming, The aggregate constraint homotopy method for nonconvex nonlinear programming, Extension of a hybrid genetic algorithm for nonlinear programming problems with equality and inequality constraints., A gradient-based approach for discrete optimum design, An aggregate deformation homotopy method for min-max-min problems with max-min constraints, A smoothing method for zero--one constrained extremum problems, On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints, A truncated aggregate smoothing Newton method for minimax problems, Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method, Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions, Zero duality gap in surrogate constraint optimization: a concise review of models
