Optimization of Polynomial Fractional Functions

Authors:
Hoang Tuy;Phan Thien Thach;Hiroshi Konno
Affiliations:
Institute of Mathematics, 18 Hoang Quoc Viet Road, 10307, Hanoi, Vietnam (e-mail: htuy@math.ac.vn);Institute of Mathematics, 18 Hoang Quoc Viet Road, 10307, Hanoi, Vietnam;Department of Industrial Engineering and Management, Tokyo Institute of Technology, Tokyo
Venue:
Journal of Global Optimization
Year:
2004

Citing 8
Cited 3

Maximization of the Ratio of Two Convex Quadratic Functions over a Polytope

Computational Optimization and Applications
Monotonic Optimization: Problems and Solution Approaches

SIAM Journal on Optimization
Global Optimization with Polynomials and the Problem of Moments

SIAM Journal on Optimization
Global Optimization of Nonconvex Polynomial Programming Problems HavingRational Exponents

Journal of Global Optimization
A New Approach to Optimization Under Monotonic Constraint

Journal of Global Optimization
A Branch and Bound Algorithm for Solving Low Rank Linear Multiplicative and Fractional Programming Problems

Journal of Global Optimization
Semidefinite Programming vs. LP Relaxations for Polynomial Programming

Mathematics of Operations Research
New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems

Operations Research Letters

A review of recent advances in global optimization

Journal of Global Optimization
$${{\mathcal {D}(\mathcal {C})}}$$-optimization and robust global optimization

Journal of Global Optimization
Global optimization for the generalized polynomial sum of ratios problem

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new approach is proposed for optimizing a polynomial fractional function under polynomial constraints, or more generally, a synomial fractional function under synomial constraints. The approach is based on reformulating the problem as the optimization of an increasing function under monotonic constraints.