Pages that link to "Item:Q1177915"
From MaRDI portal
The following pages link to Parametric simplex algorithms for solving a special class of nonconvex minimization problems (Q1177915):
Displaying 50 items.
- Theoretical and computational results about optimality-based domain reductions (Q288410) (← links)
- A practicable branch and bound algorithm for sum of linear ratios problem (Q319186) (← links)
- Outcome space range reduction method for global optimization of sum of affine ratios problem (Q330338) (← links)
- A global optimization algorithm for sum of linear ratios problem (Q364313) (← links)
- An outer approximation method for minimizing the product of several convex functions on a convex set (Q686993) (← links)
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem (Q691453) (← links)
- Maximizing a linear fractional function on a Pareto efficient frontier (Q700704) (← links)
- On the global optimization of sums of linear fractional functions over a convex set (Q704748) (← links)
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs (Q711696) (← links)
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions (Q824489) (← links)
- A FPTAS for a class of linear multiplicative problems (Q849090) (← links)
- An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
- A deterministic global optimization algorithm (Q870181) (← links)
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem (Q881518) (← links)
- An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
- A sequential method for a class of pseudoconcave fractional problems (Q940830) (← links)
- An outcome space approach for generalized convex multiplicative programs (Q969745) (← links)
- A nonisolated optimal solution of general linear multiplicative programming problems (Q1010262) (← links)
- Global optimization for a class of fractional programming problems (Q1037364) (← links)
- Efficient algorithms for solving rank two and rank three bilinear programming problems (Q1186269) (← links)
- Polyhedral annexation, dualization and dimension reduction technique in global optimization (Q1200635) (← links)
- A parametric successive underestimation method for convex multiplicative programming problems (Q1200637) (← links)
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065) (← links)
- Linear multiplicative programming (Q1207311) (← links)
- Global minimization of a generalized convex multiplicative function (Q1315440) (← links)
- Image space analysis of generalized fractional programs (Q1315441) (← links)
- The simplex method as a global optimizer: A \(C\)-programming perspective (Q1315444) (← links)
- Strongly polynomial time algorithms for certain concave minimization problems on networks (Q1317011) (← links)
- Linear programs with an additional rank two reverse convex constraint (Q1327432) (← links)
- Branch-and-bound decomposition approach for solving quasiconvex-concave programs (Q1333350) (← links)
- Convex programs with an additional constraint on the product of several convex functions (Q1333464) (← links)
- Minimizing a linear multiplicative-type function under network flow constraints (Q1362518) (← links)
- Multiplicative programming problems: Analysis and efficient point search heuristic (Q1367730) (← links)
- Outcome-space cutting-plane algorithm for linear multiplicative programming (Q1579657) (← links)
- A reduced space branch and bound algorithm for a class of sum of ratios problems (Q1647365) (← links)
- Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← links)
- A global optimization approach for solving generalized nonlinear multiplicative programming problem (Q1724645) (← links)
- An effective algorithm for globally solving sum of linear ratios problems (Q1794234) (← links)
- Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions (Q1804585) (← links)
- A global optimization algorithm for linear fractional and bilinear programs (Q1890945) (← links)
- Finite algorithm for generalized linear multiplicative programming (Q1906745) (← links)
- A deterministic method for solving the sum of linear ratios problem (Q2004237) (← links)
- Underestimation functions for a rank-two partitioning method (Q2026521) (← links)
- Global optimization method for linear multiplicative programming (Q2355349) (← links)
- Solving a class of generalized fractional programming problems using the feasibility of linear programs (Q2360402) (← links)
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
- A global optimization algorithm for linear fractional programming (Q2378922) (← links)
- Global optimization of a rank-two nonconvex program (Q2379188) (← links)
- A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension (Q2450672) (← links)
- Solving sum of ratios fractional programs via concave minimization (Q2465451) (← links)
