An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set

DOI10.1016/J.ORL.2013.01.004MaRDI QIDQ1949686zbMATH OpenOpenAlexFDO

Authors Vineet Goyal, R. Ravi

Publication date 14 May 2013

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://figshare.com/articles/journal_contribution/An_FPTAS_for_Minimizing_a_Class_of_Low-Rank_Quasi-Concave_Functions_over_a_Convex_Set/6703709

zbMATH Keywords

non-convex programmingnon-linear programmingpolynomial approximation schemesquasi-concave programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An FPTAS for optimizing a class of low-rank functions over a polytope
• An FPTAS for minimizing the product of two non-negative linear cost functions
• A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
• A FPTAS for a class of linear multiplicative problems
• On minimizing the sum of a convex function and a concave function

Cited in

(15)

• Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
• Fractional 0-1 programming: applications and algorithms
• A PTAS for a class of binary non-linear programs with low-rank functions
• Solving a class of generalized fractional programming problems using the feasibility of linear programs
• An FPTAS for optimizing a class of low-rank functions over a polytope
• An FPTAS for minimizing indefinite quadratic forms over integers in polyhedra
• Graph cuts with interacting edge weights: examples, approximations, and algorithms
• Linear decomposition approach for a class of nonconvex programming problems
• Pricing toll roads under uncertainty
• A faster FPTAS for a supply chain scheduling problem to minimize holding costs with outsourcing
• A new Lagrangian-Benders approach for a concave cost supply chain network design problem
• An FPTAS for minimizing the product of two non-negative linear cost functions
• A normal fan projection algorithm for low-rank optimization
• Non-convex optimization problems with linear KKT subsystem
• A class of exponential neighbourhoods for the quadratic travelling salesman problem

This page was built for publication: An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949686)