Parametric simplex algorithms for solving a special class of nonconvex minimization problems
From MaRDI portal
Publication:1177915
DOI10.1007/BF00120666zbMath0746.90056MaRDI QIDQ1177915
Yasutoshi Yajima, Hiroshi Konno, Tomomi Matsui
Publication date: 26 June 1992
Published in: Journal of Global Optimization (Search for Journal in Brave)
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31) Fractional programming (90C32) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (75)
Linear programs with an additional rank two reverse convex constraint ⋮ Solving a class of generalized fractional programming problems using the feasibility of linear programs ⋮ The optimal level solution method applied to a non linear programming problem with exponential objective function ⋮ Regional division and reduction algorithm for minimizing the sum of linear fractional functions ⋮ Branch-and-bound decomposition approach for solving quasiconvex-concave programs ⋮ Convex programs with an additional constraint on the product of several convex functions ⋮ Theoretical and computational results about optimality-based domain reductions ⋮ A global optimization algorithm for linear fractional and bilinear programs ⋮ A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming ⋮ A global optimization algorithm for linear fractional programming ⋮ Global optimization of a rank-two nonconvex program ⋮ A practicable branch and bound algorithm for sum of linear ratios problem ⋮ A FPTAS for a class of linear multiplicative problems ⋮ An outcome-space finite algorithm for solving linear multiplicative programming ⋮ A reduced space branch and bound algorithm for a class of sum of ratios problems ⋮ Outcome space range reduction method for global optimization of sum of affine ratios problem ⋮ Minimizing a linear multiplicative-type function under network flow constraints ⋮ Finite algorithm for generalized linear multiplicative programming ⋮ Multiplicative programming problems: Analysis and efficient point search heuristic ⋮ A deterministic global optimization algorithm ⋮ A global optimization algorithm for sum of linear ratios problem ⋮ Global optimization algorithm for solving linear multiplicative programming problems ⋮ A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem ⋮ Global algorithm for a class of multiplicative programs using piecewise linear approximation technique ⋮ An efficient algorithm and complexity result for solving the sum of general affine ratios problem ⋮ A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem ⋮ A new deterministic global computing algorithm for solving a kind of linear fractional programming ⋮ A potential practical algorithm for minimizing the sum of affine fractional functions ⋮ An efficient algorithm for globally solving generalized linear multiplicative programming ⋮ Effective algorithm and computational complexity for solving sum of linear ratios problem ⋮ Unnamed Item ⋮ The optimal level solutions method ⋮ Global optimization for generalized linear multiplicative programming using convex relaxation ⋮ A global optimization approach for solving generalized nonlinear multiplicative programming problem ⋮ A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension ⋮ A sequential method for a class of pseudoconcave fractional problems ⋮ Efficient algorithms for solving rank two and rank three bilinear programming problems ⋮ Solving sum of ratios fractional programs via concave minimization ⋮ On linear multiplicative programming. ⋮ An outer approximation method for minimizing the product of several convex functions on a convex set ⋮ Polyhedral annexation, dualization and dimension reduction technique in global optimization ⋮ A parametric successive underestimation method for convex multiplicative programming problems ⋮ Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial ⋮ Global optimization for sum of generalized fractional functions ⋮ An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem ⋮ Minimizing the sum of a convex function and a specially structured nonconvex function ⋮ Linear multiplicative programming ⋮ A deterministic method for solving the sum of linear ratios problem ⋮ An outcome space approach for generalized convex multiplicative programs ⋮ Maximizing a linear fractional function on a Pareto efficient frontier ⋮ Unnamed Item ⋮ On the global optimization of sums of linear fractional functions over a convex set ⋮ Global optimization for sum of linear ratios problem with coefficients ⋮ Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs ⋮ Optimizing of sums and products of linear fractional functions under linear constraints ⋮ Underestimation functions for a rank-two partitioning method ⋮ Global optimization of nonlinear sums of ratios ⋮ Global optimization algorithm for the nonlinear sum of ratios problem ⋮ An effective algorithm for globally solving sum of linear ratios problems ⋮ Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems ⋮ Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions ⋮ A nonisolated optimal solution of general linear multiplicative programming problems ⋮ Global optimization for a class of fractional programming problems ⋮ Fast Algorithms for Rank-1 Bimatrix Games ⋮ \(NP\)-hardness of linear multiplicative programming and related problems ⋮ Outcome-space cutting-plane algorithm for linear multiplicative programming ⋮ Level set algorithm for solving convex multiplicative programming problems ⋮ A branch and bound algorithm to globally solve the sum of several linear ratios ⋮ Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations ⋮ A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems ⋮ Global minimization of a generalized convex multiplicative function ⋮ Image space analysis of generalized fractional programs ⋮ The simplex method as a global optimizer: A \(C\)-programming perspective ⋮ Strongly polynomial time algorithms for certain concave minimization problems on networks ⋮ Global optimization method for linear multiplicative programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
- A finite crisscross method for oriented matroids
- On a class of quadratic programs
- A finite conformal-elimination free algorithm over oriented matroid programming
- Constrained global optimization: algorithms and applications
- Linear multiplicative programming
- Generalized linear multiplicative and fractional programming
- Complementary pivot theory of mathematical programming
- The Criss-Cross Method for Solving Linear Programming Problems
- A convergent criss-cross method
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- Bimatrix Equilibrium Points and Mathematical Programming
This page was built for publication: Parametric simplex algorithms for solving a special class of nonconvex minimization problems
