Bibliography in fractional programming

DOI10.1007/BF01917115zbMath0494.90076OpenAlexW1964192645MaRDI QIDQ3958287

Siegfried Schaible

Publication date: 1982

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01917115

zbMATH Keywords

bibliographyfractional programming

Mathematics Subject Classification ID

Fractional programming (90C32) Bibliographies for mathematics in general (00A15)

Related Items

Time variant multi-objective linear fractional interval-valued transportation problem, Some characterizations of robust optimal solutions for uncertain fractional optimization and applications, Multiobjective fractional programming duality. a Lagrangian approach, An interior-point method for multifractional programs with convex constraints, Optimality conditions and duality for a class of continuous-time generalized fractional programming problems, On fractional programming containing support functions, Optimality conditions and duality models for a class of nonsmooth constrained fractional optimal control problems, A simplex algorithm for piecewise-linear fractional programming problems, On polynomiality of the method of analytic centers for fractional problems, Dual method of centers for solving generalized fractional programs, Convergence of a Dinkelbach-type algorithm in generalized fractional programming, Dinkelbach Type Approximation Algorithms for Nonlinear Fractional Optimization Problems, A Goal Programming Method for Solving Fractional Programming Problems via Dynamic Programming, A simplex algorithm for network flow problems with piecewise linear fractional objective function, Continuous-time multiobjective fractional programming, Efficiency Criteria and Duality Models for Multiobjective Fractional Programming Problems Containing Locall'y Subdifferentiable and ρ-Convex Functions, Continuous-time generalized fractional programming, Algorithms for generalized fractional programming, Fractional programming, Robust fractional programming, Fractional programming, Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions, Proper efficiency and duality for a class of multiobjective fractional variational problems containing arbitrary norms, Vector-valued lagrangian and multiobjective fractional programming duality, Duality in generalized linear fractional programming, Duality for generalized fractional programs involving n-set functions, An interior-point method for fractional programs with convex constraints, The principle and models of dynamic programming. II, Equivalence of various linearization algorithms for linear fractional programming, A transposition theorem with applications to constrained optimal control problems, Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems, Saddle-point type optimality criteria, duality and a new approach for solving nonsmooth fractional continuous-time programming problems, An algorithm for generalized fractional programs, Symmetric dual fractional programming, Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions, Optimality conditions and duality models for a class of nonsmooth constrained fractional variational problems, Application of Fuzzy Programming Method for Solving Nonlinear Fractional Programming Problems with Fuzzy Parameters, Modified ratio objective approach in mathematical programming, First- and second-order optimality conditions for multiobjective fractional programming

Cites Work

• Airport noise modelling and aircraft scheduling so as to minimize community annoyance
• Enumerative technique for an extreme point fractional program
• Location of a discrete resource and its allocation according to a fractional objective
• Linear programming with uncertain objective function: Minimax solution for relative loss
• On duality in linear fractional programming
• Efficiency in certain nonlinear fractional vector maximization problems
• The set covering problem with linear fractional functional
• Extension of simplex technique for solving fractional programming problem
• A game theoretic approach to measuring efficiency
• Bicriteria linear fractional programming
• Fractional programming: Applications and algorithms
• On a certain linear fractional programming problem
• Equivalence between a generalized Fenchel duality theorem and a saddle- point theorem for fractional programs
• The sheaf of \(H^ p-\)functions in product domains
• On a discrete non-linear fractional programming problem
• The sum of a linear and linear fractional function and a three dimensional transportation problem
• Goal programming with linear fractional criteria
• On search over rationals
• Minimization of ratios
• On the solution of an operator equation in the class of entire functions
• Markov ratio decision processes
• Strong pseudo-convex programming in Banach space
• A duality theorem for a homogeneous fractional programming problem
• Allocation of resources according to a fractional objective
• A set partitioning problem with linear fractional objective function
• Goal programming and multiple objective optimizations. Part I
• Linear fractional functional complementary programming with extreme point optimization
• Rational search
• On a class of quadratic fractional programming problems
• Extensions and special cases of transportation problem: A survey
• A note on duality theory for a pseudoconvex functional programming problem
• Duality in a class of nonlinear fractional programming problems
• A parametric method for solving certain nonconcave maximization problems
• A note on quasi convex programming
• On varying all the parameters in a linear fractional functionals programming problem
• Parametric linear fractional functionals programming
• Analysis of the solution to a linear fractional functionals programming
• Stationary values of the ratio of quadratic forms subject to linear constraints
• Upper bound problem in linear fractional functionals programming
• Indefinite quadratic fractional functional programming
• Strong pseudo-convex programming
• A decomposition principle for fractional programming
• A dual-linear program
• A generalized upper bounded technique for a linear fractional program
• Feasible direction approach to fractional programming problems
• An existence theorem for a fractional control problem
• The dual of a fractional linear program
• General parametric linear fractional programming
• Mathematical Optimization and Economic Theory
• On Sequential Decisions and Markov Chains
• Non-Linear Programming—A Survey
• Duality in generalized linear fractional programming
• A duality theorem for a nondifferentiable nonlinear fractional programming problem
• On Duality for Fractional Programming
• Technical Note—Decomposition Techniques for the Chebyshev Problem
• A note on mathematical programming with fractional objective functions
• A Simple Class of Parametric Linear Fractional Functionals Programming
• Combinatorial Optimization with Rational Objective Functions
• An Improved Branch and Bound Method for Mixed Integer Linear Fractional Programs
• A note on integer linear fractional programming
• Fractional programming duality via geometric programming duality
• El problema de la seleccion de la cartera cuando las rentas tienen distribuciones estables
• Parametrization of a generalized linear and piece-wise linear programme
• A decomposition principle for a generalized linear and piece-wise linear program
• A Parametric Linear Complementarity Technique for Optimal Portfolio Selection with a Risk-Free Asset
• Fractional knapsack problems
• Second order characterizations of pseudoconvex functions
• A Class of Nondifferentiable Fractional Programming Problems
• Generalization of dual structural optimization problems in terms of fractional programming
• Multicriteria Programming for Financial Planning
• Maximizing the sum of certain quasiconcave functions using generalized benders decomposition
• Sufficiency of Kuhn-Tucker optimality conditions for a fractional programming problem
• A note on duality in homogeneous fractional programming
• Convex-concave fractional programming—Evaluation of solutions and optimality conditions
• Pseudo-monotonic interval programming
• A PRIMAL CUTTING PLANE ALGORITHM FOR INTEGER FRACTIONAL PROGRAMMING PROBLEMS
• Quality in Mixed Integer Nonconvex and Nondifferentiable Programming
• Linear Fractional Functional Programming in Complex Space
• Technical Note—The Optimal Dual Solution in Linear Fractional Decomposition Problems
• Fractional Programming with Homogeneous Functions
• Resource Planning in University Management by Goal Programming
• Extreme point linear fractional functional programming
• A primal-like algorithm for zero-one integer Fractional Programming Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Die Maximierung eines Quotienten zweier linearer Funktionen unter linearen Nebenbedingungen
• A Stochastic Programming Model
• Programming with fractional linear objective functions
• Programming with linear fractional functionals
• Hyperbolic programming
• Letter to the Editor—Linear Fractional Functionals Programming
• The Direct Power of Adjacent Vertex Programming Methods
• On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
• A Maximization Problem Suggested by Baker Vs. Carr
• Fractional Programming with Non‐linear Constraints
• Some Aspects of Duality for Linear Fractional Functionals Programming
• On Nonlinear Fractional Programming
• Errata
• Algorithmic Equivalence in Linear Fractional Programming
• Markov Renewal Programming by Linear Fractional Programming
• On the capacity of a discrete, constant channel
• Duality in fractional programming
• Stability of the Solution to a Linear Fractional Functional Programming Problem
• SOME ASPECTS OF LINEAR FRACTIONAL FUNCTIONALS PROGRAMMING
• Letter to the Editor—Fractional Functionals Programming with a Quadratic Constraint
• Programming Problems with Convex Fractional Functions
• Non‐linear fractional functional programming with non‐linear constraints
• Programming with linear fractional functionals
• Stochastic Programming with Aspiration or Fractile Criteria
• Solving Bicriterion Mathematical Programs
• Duality in fractional and indefinite programming
• Maximization of Signal-to-Noise Ratio in an Optical Filter
• Approximate Method of Solution for Non‐linear Fractional Programming
• Maximization of the transmission rate of a discrete, constant channel
• Linear Programming Solutions to Ratio Games
• The Procedure for Local Separable Programming
• Programming with a special class of nonlinear functionals
• Basic feasible solutions and decomposition principle for linear fractional functionals programming problem
• Duality in mathematical programming and some problems of convex analysis
• (0, 1) hyperbolic programming problems
• A Goal Programming Model for Academic Resource Allocation
• The fractional fixed-charge problem
• On parametric linear fractional functionals programming
• An Algorithm for the Minimum-Risk Problem of Stochastic Programming
• Optimal Time-Cost Trade-Offs in GERT Networks
• On duality in linear fractional functionals programming
• Ratios in Planning-Budgeting and Bounds on Resource Requirements
• On Hyperbolic Programming with a Single Constraint and Upper-Bounded Variables
• Properties of Optimal Allocations of Resources According to a Fractional Objective
• Global saddle-point duality for quasi-concave programs
• Duality in Homogeneous Fractional Programming
• Note—On “An Interpretation of Fractional Objectives in Goal Programming as Related to Papers by Awerbuch et al., and Hannan”
• A Branch and Bound Method for Integer Nonlinear Fractional Programs
• Multiple Objective Linear Fractional Programming
• On Algorithmic Equivalence in Linear Fractional Programming
• A Bi-Extremal Principle for Frontier Estimation and Efficiency Evaluations
• The Linear Fractional Portfolio Selection Problem
• Note—An Interpretation of Fractional Objectives in Goal Programming as Related to Papers by Awerbuch, et al., and Hannan
• Experiments with linear fractional problems
• Parameter-free convex equivalent and dual programs of fractional programming problems
• Calculation of Investment Portfolios with Risk Free Borrowing and Lending
• Dualitätstheorie für hyperboiisehe und stückweise lineare konvexe optimierungsprobleme
• On Duality in Non-Linear Fractional Programming Problems
• Nonlinear fractional programming
• Zur Extremwertannahme und Dualität bei Optimierungsproblemen mit linearem und gebrochen linearem Zielfunktionsanteil
• A note on fractional interval programming
• An Operator Theory for a Class of Linear Fractional Programming Problems — I
• Rein ganzzahlige lineare quotientenoptimierung nach dem schnittverfahren von gomory¹
• Mathematical Models for Optimal Timing of Drilling on Multilayer Oil and Gas Fields
• On fractional programming and equivalence
• A Duality Theorem for Complex Fractional Programming
• A Note on Returns to Scale in Linear Fractional Programming
• Duality Theorems for Non‐Linear Fractional Programs
• A Linear Fractional Max-Min Problem
• Complex Fractional Functionals Programming with Nonlinear Constraints
• A Decomposition Method for Interval Linear Fractional Programming
• Note—A Note: Hidden Nonlinearities in the Application of Goal Programming
• Solving a (0, 1) hyperbolic program by branch and bound
• Fractional Programming. I, Duality
• On Solving Fractional (0, 1) Programs By Implicit Enumeration
• Fractional Programming. II, On Dinkelbach's Algorithm
• Duality in Fractional Programming: A Unified Approach
• A Duality Theorem for a Nondifferentiable Fractional Programming Problem
• ALGORITHMS FOR QUADRATIC FRACTIONAL PROGRAMMING PROBLEMS
• An Operator Theory for a Class of Linear Fractional Programming Problems II
• Limiting Distributions in a Linear Fractional Flow Model
• An Algorithm for Linear Fractional Functionals Programming Problems
• Decomposition Method and Transportation Type Problems with a Fractional Objective Function
• An Alternate Method on Integer Solutions to Linear Fractional Functionals by a Branch and Bound Technique
• Generalization of some duality theorems in nonlinear programming
• Comparison of duality models in fractional linear programming
• A note on explicit solution in linear fractional programming
• Fractional programming without differentiability
• Duality and Sensitivity Analysis for Fractional Programs
• Über eine Klasse nichtkonvexer Optimierungsprobleme
• Lexicographic quasiconcave multiobjective programming
• On automorphism groups of quaternion Kähler manifolds
• Enumeration Technique for the Set Covering Problem with a Linear Fractional Functional as its Objective Function
• Gemischt ganzzahlige lineare quotientenoptimierung nach dem schnittverfahren von gomory
• Minimal ratio spanning trees
• Cutting Plane Technique for the Set Covering Problem with Linear Fractional Functional
• Note—Effects of Substituting a Linear Goal for a Fractional Goal in the Goal Programming Problem
• Duality for a Special Class of Quasi-Convex Programming Problems
• Sensitivity reducing observers for optimal feedback control
• Convex-concave fractional programming with each variable occurring in a single constraint
• Parametrische hyperbolische optimierungsprobleme mit parameters in der zielfunktion
• A note on the sum of a linear and linear-fractional function
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Dual Fractional Program
• An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
• Duality for nonlinear fractional programs
• A Linear Fractional Functional Program with a Two Parameter Objective Function
• Duality in fractional programming
• A Note on the Economic Interpretation of the Dual Variables in Linear Fractional Programming
• An Example of the Application of Nonlinear Programming to Chemical-Process Optimization
• A Class of Fractional Programming Problems
• Linear Programming with a Fractional Objective Function
• Best Rational Approximation and Strict Quasi-Convexity
• Hyperbolic integer programming
• Transportation technique in non-linear fractional programming
• Decomposition Procedure for Linear Fractional Programs with Upper Bounds
• Duality in nonlinear fractional programming
• An explicit general solution in linear fractional programming
• Quasi-convexity, strictly quasi-convexity and pseudo-convexity of composite objective functions
• Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
• Stochastic Games
• On the Radiative Equilibrium of a Stellar Atmosphere. IV.
• Efficiency and Linear Vector Maximum Value Problem
• The Use of Cuts in Linear Fractional Functional Complementary Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item