C-programming and the minimization of pseudolinear and additive concave functions
From MaRDI portal
Publication:579142
DOI10.1016/0167-6377(86)90075-1zbMath0624.90088OpenAlexW2071465658MaRDI QIDQ579142
Publication date: 1986
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(86)90075-1
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)
Related Items (13)
Experiments with dynamic programming algorithms for nonseparable problems ⋮ First and second order characterizations of pseudolinear functions ⋮ A fifth bibliography of fractional programming* ⋮ Solving a class of multiplicative programming problems via \(C\)- programming ⋮ Fractional programming revisited ⋮ Analysis of a class of fractional programming problems ⋮ Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times ⋮ On pseudolinear functions ⋮ HYPER SENSITIVITY ANALYSIS OF PORTFOLIO OPTIMIZATION PROBLEMS ⋮ A Solution Strategy for a Class of Nonlinear Knapsack Problems ⋮ On mean-standard deviation ratio problems and beyond via c-programming ⋮ The simplex method as a global optimizer: A \(C\)-programming perspective ⋮ Solution strategies for variance minimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- C-programming problems: A class of non-linear optimization problems
- Analysis of a class of proxy problems
- C-programming. An outline
- A class of nonseparable dynamic programming problems
- The shortest path problem with two objective functions
- A new look at fractional programming
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
- Combinatorial Optimization with Rational Objective Functions
- Fractional Programming. II, On Dinkelbach's Algorithm
- On mean-standard deviation ratio problems and beyond via c-programming
- The Direct Power of Adjacent Vertex Programming Methods
- On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
- Pseudo-Concave Programming and Lagrange Regularity
- On Nonlinear Fractional Programming
- Seven Kinds of Convexity
- Solving Bicriterion Mathematical Programs
- Some Properties of Generalized Concave Functions
- Fractional programming
This page was built for publication: C-programming and the minimization of pseudolinear and additive concave functions