Parameter-free convex equivalent and dual programs of fractional programming problems
From MaRDI portal
Publication:4042856
DOI10.1007/BF02026600zbMath0291.90067OpenAlexW1994623385WikidataQ59795295 ScholiaQ59795295MaRDI QIDQ4042856
Publication date: 1974
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02026600
Related Items
On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints, Classifying and characterizing efficiencies and inefficiencies in data development analysis, Parametric linear fractional programming for an unbounded feasible region, Rebalancing an investment portfolio in the presence of convex transaction costs, including market impact costs, Convex dual for quadratic concave fractional programs, Efficient algorithms for solving nonlinear fractional programming problems, A survey of hidden convex optimization, Pseudo-duality in mathematical programs with quotients and products, Optimising portfolio diversification and dimensionality, Robust sensitivity analysis for linear programming with ellipsoidal perturbation, An uncertain minimization problem: robust optimization versus optimization of robustness, Equivalence in linear fractional programming, Fractional programming: Applications and algorithms, Equivalence between a generalized Fenchel duality theorem and a saddle- point theorem for fractional programs, Conjugate duality for fractional programs, Cost-effective allocations of bounded and binary resources in polynomial time, Robust duality for fractional programming problems with constraint-wise data uncertainty, Robust fractional programming, The problem of possibilistic-probabilistic optimization, Efficient formulations for pricing under attraction demand models, Suboptimal robust synthesis for MIMO plant under coprime factor perturbations, Measuring the efficiency of decision making units, Iterative design of robust controllers under unknown bounded perturbation norms, Generalization of some duality theorems in nonlinear programming, Comparison of duality models in fractional linear programming, Fractional programming without differentiability, On the product line selection problem under attraction choice models of consumer behavior, Fractional programming with convex quadratic forms and functions, Unnamed Item, Maximizing perturbation radii for robust convex quadratically constrained quadratic programs, Allocation of resources according to a fractional objective, On robust duality for fractional programming with uncertainty data, On self-concordant barrier functions for conic hulls and fractional programming, Foundations of data envelopment analysis for Pareto-Koopmans efficient empirical production functions, Unnamed Item, Complex fractional programming and the Charnes-Cooper transformation, Bibliography in fractional programming, Experiments with linear fractional problems
Cites Work
- Unnamed Item
- Duality in quadratic programming
- A duality theorem for non-linear programming
- Programming with linear fractional functionals
- Pseudo-Convex Functions
- Programming with a Quadratic Constraint
- On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
- Strictly Concave Parametric Programming, Part I: Basic Theory
- On Nonlinear Fractional Programming
- Solving Bicriterion Mathematical Programs
- On duality in linear fractional functionals programming
- Duality for nonlinear fractional programs
- Duality in nonlinear fractional programming
