Pages that link to "Item:Q1391442"

The following pages link to Solving long-term financial planning problems via global optimization (Q1391442):

Displaying 39 items.

• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
• A new hybrid method for solving global optimization problem (Q426339) (← links)
• Linear decomposition approach for a class of nonconvex programming problems (Q523884) (← links)
• Constant rebalanced portfolio optimization under nonlinear transaction costs (Q538327) (← links)
• A polynomial optimization approach to constant rebalanced portfolio selection (Q694522) (← links)
• An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
• \(\text{CO}_{2} \) emissions trading planning in combined heat and power production via multi-period stochastic optimization (Q853076) (← links)
• Linearization method for a class of multiplicative programming with exponent (Q864775) (← links)
• An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
• A new accelerating method for globally solving a class of nonconvex programming problems (Q923946) (← links)
• The stable non-Gaussian asset allocation: a comparison with the classical Gaussian approach (Q951337) (← links)
• Enhancing PSO methods for global optimization (Q984327) (← links)
• A nonisolated optimal solution of general linear multiplicative programming problems (Q1010262) (← links)
• Global optimization of higher order moments in portfolio selection (Q1029685) (← links)
• The optimal portfolio problem with coherent risk measure constraints. (Q1406490) (← links)
• Optimal deviations from an asset allocation. (Q1422358) (← links)
• Financial planning via multi-stage stochastic optimization. (Q1422378) (← links)
• Global minimization for generalized polynomial fractional program (Q1718667) (← links)
• A global optimization approach for solving generalized nonlinear multiplicative programming problem (Q1724645) (← links)
• Parameter estimation in stochastic scenario generation systems (Q1806616) (← links)
• On the use of optimization models for portfolio selection: A review and some computational results (Q1890889) (← links)
• Portfolio optimization for wealth-dependent risk preferences (Q1958620) (← links)
• Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
• A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems (Q2075981) (← links)
• Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems (Q2088876) (← links)
• Approximating a linear multiplicative objective in watershed management optimization (Q2098027) (← links)
• Global algorithm for solving linear multiplicative programming problems (Q2174910) (← links)
• QPLIB: a library of quadratic programming instances (Q2281448) (← links)
• Global optimization method for linear multiplicative programming (Q2355349) (← links)
• A method of acceleration for a class of multiplicative programming problems with exponent (Q2378273) (← links)
• Modifications of real code genetic algorithm for global optimization (Q2378969) (← links)
• Global optimization algorithm for a generalized linear multiplicative programming (Q2511121) (← links)
• A branch and bound algorithm for globally solving a class of nonconvex programming problems (Q2518145) (← links)
• An Outcome Space Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programming Problems (Q2942454) (← links)
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
• A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (Q2970402) (← links)
• An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489) (← links)
• Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound (Q6162508) (← links)