Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations
From MaRDI portal
Publication:5857295
DOI10.1137/19M1308165zbMath1462.90136OpenAlexW3137881400MaRDI QIDQ5857295
Publication date: 31 March 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m1308165
convergence analysislinear fractional programmingbranch and bound algorithmdistributionally robust optimizationsecond order cone approximations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Fractional programming (90C32) Robustness in mathematical programming (90C17)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A practicable branch and bound algorithm for sum of linear ratios problem
- GLOMIQO: global mixed-integer quadratic optimizer
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- On the global optimization of sums of linear fractional functions over a convex set
- On functions representable as a difference of convex functions
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Image space analysis of generalized fractional programs
- A unified monotonic approach to generalized linear fractional programming
- Minimization of the sum of three linear fractional functions
- Identifying effective scenarios in distributionally robust stochastic programs with total variation distance
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Likelihood robust optimization for data-driven problems
- A branch-and-cut method for 0-1 mixed convex programming
- Distributionally robust optimization with decision dependent ambiguity sets
- Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models
- Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region
- Distributionally Robust Convex Optimization
- Fractional programming: The sum-of-ratios case
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion
- Ambiguous Risk Measures and Optimal Robust Portfolios
- A Cutting-Surface Method for Uncertain Linear Programs with Polyhedral Stochastic Dominance Constraints
- Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem
- On Maximizing a Sum of Ratios
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- The Concave-Convex Procedure
- Distributionally Robust Stochastic Programming
- On a Class of Minimax Stochastic Programs
- Pseudolinear Programming
- Minimax analysis of stochastic problems
- Risk-Averse Two-Stage Stochastic Program with Distributional Ambiguity
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
- Overlapping Batches for the Assessment of Solution Quality in Stochastic Programs
- Programming with linear fractional functionals
- Letter to the Editor—Linear Fractional Functionals Programming
- On Nonlinear Fractional Programming
- Cluster Analysis and Mathematical Programming
- A Class of Fractional Programming Problems
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
