C-programming and the minimization of pseudolinear and additive concave functions

DOI10.1016/0167-6377(86)90075-1zbMATH Open0624.90088OpenAlexW2071465658MaRDI QIDQ579142FDOQ579142

Moshe Sniedovich

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

zbMATH Keywords

parametric problemc-programmingconcave separable functionpseudolinear function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Nonlinear Fractional Programming
• Fractional programming
• Combinatorial Optimization with Rational Objective Functions
• Fractional Programming. II, On Dinkelbach's Algorithm
• Solving Bicriterion Mathematical Programs
• The shortest path problem with two objective functions
• Pseudo-Concave Programming and Lagrange Regularity
• The Direct Power of Adjacent Vertex Programming Methods
• Seven Kinds of Convexity
• On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
• C-programming. An outline
• A class of nonseparable dynamic programming problems
• A new look at fractional programming
• A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
• On mean-standard deviation ratio problems and beyond via c-programming
• Some Properties of Generalized Concave Functions
• C-programming problems: A class of non-linear optimization problems
• Analysis of a class of proxy problems

Cited In (14)

• A Solution Strategy for a Class of Nonlinear Knapsack Problems
• On mean-standard deviation ratio problems and beyond via c-programming
• HYPER SENSITIVITY ANALYSIS OF PORTFOLIO OPTIMIZATION PROBLEMS
• Fractional programming revisited
• On pseudolinear functions
• The simplex method as a global optimizer: A \(C\)-programming perspective
• Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times
• Solving a class of multiplicative programming problems via \(C\)- programming
• First and second order characterizations of pseudolinear functions
• Algorithmic and computational aspects of composite concave programming
• A fifth bibliography of fractional programming^*
• Solution strategies for variance minimization problems
• Experiments with dynamic programming algorithms for nonseparable problems
• Analysis of a class of fractional programming problems

   Recommendations

• Algorithms to solve some problems of concave programming with linear constraints 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Algorithmic and computational aspects of composite concave programming 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: C-programming and the minimization of pseudolinear and additive concave functions

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