Heuristic methods for linear multiplicative programming

DOI10.1023/A:1008308913266MaRDI QIDQ1567074zbMATH OpenOpenAlexFDO

Authors N. Delaunay

Publication date 20 August 2001

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008308913266

zbMATH Keywords

heuristic methodparametric linear programlinear multiplicative programming

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Linear multiplicative programming
• On linear multiplicative programming.
• Multiplicative programming problems: Analysis and efficient point search heuristic
• A finite branch-and-bound algorithm for linear multiplicative programming
• A parametric method for solving linear multiplicative programming problem

Cited in

(34)

• A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
• A nonisolated optimal solution of general linear multiplicative programming problems
• A FPTAS for a class of linear multiplicative problems
• Global optimization algorithm for solving linear multiplicative programming problems
• A new linearization method for generalized linear multiplicative programming
• An outcome-space finite algorithm for solving linear multiplicative programming
• Global optimization algorithm for a generalized linear multiplicative programming
• Linearization method for a class of multiplicative programming with exponent
• Quadratic factorization heuristics for copositive programming
• Theoretical and computational results about optimality-based domain reductions
• Global optimization method for linear multiplicative programming
• A convex analysis approach for convex multiplicative programming
• A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
• Linear multiplicative programming
• Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs
• Multiplicative programming problems: Analysis and efficient point search heuristic
• On linear multiplicative programming.
• An efficient algorithm for globally solving generalized linear multiplicative programming
• A method of acceleration for a class of multiplicative programming problems with exponent
• An out space accelerating algorithm for generalized affine multiplicative programs problem
• Solving a class of generalized fractional programming problems using the feasibility of linear programs
• A global optimization approach for solving generalized nonlinear multiplicative programming problem
• An outcome space branch-and-bound algorithm for a class of linear multiplicative programming problems
• A method based on parametric convex programming for solving convex multiplicative programming problem
• Nonlinear 0–1 programming: I. Linearization techniques
• An efficient algorithm for computing a class of multiplicative optimization problem
• Duality for linear multiplicative programs
• Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
• An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
• Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
• Range division and linearization algorithm for a class of linear ratios optimization problems
• scientific article; zbMATH DE number 3984564 (Why is no real title available?)
• A branch and bound algorithm for globally solving a class of nonconvex programming problems
• On duality for a class of quasiconcave multiplicative programs

This page was built for publication: Heuristic methods for linear multiplicative programming

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