Fractional programming without differentiability

DOI10.1007/BF01580396zbMATH Open0357.90054WikidataQ56936050 ScholiaQ56936050MaRDI QIDQ4133419FDOQ4133419

Authors: Jonathan M. Borwein 

Publication date: 1977

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Parameter-free convex equivalent and dual programs of fractional programming problems
• Duality for nonlinear fractional programs
• Convex Analysis
• Nonlinear maximal monotone operators in Banach space
• Duality in nonlinear fractional programming
• On the monotonicity of the gradient of a convex function
• Sufficient conditions for extremum, penalty functions and regularity
• A duality theorem for non-linear programming
• Seven Kinds of Convexity

Cited In (15)

• Second-order strong optimality and duality for nonsmooth multiobjective fractional programming with constraints
• A generalized Farkas lemma with applications to quasidifferentiable programming
• About differentiability of order one of quasiconvex functions on \(R^ n\).
• Optimality conditions and duality in subdifferentiable multiobjective fractional programming
• Optimality, duality and saddle point analysis for interval-valued nondifferentiable multiobjective fractional programming problems
• Generalized convexity in nondifferentiable programming
• Duality for minmax programming involving nonsmooth v-invex functions
• First- and second-order optimality conditions for multiobjective fractional programming
• Necessary and Sufficient Optimality Conditions for Fractional Interval-Valued Optimization Problems
• Equivalence between a generalized Fenchel duality theorem and a saddle- point theorem for fractional programs
• Second-order optimality conditions in locally Lipschitz multiobjective fractional programming problem with inequality constraints
• Bibliography in fractional programming
• Optimality conditions for vector mathematical programming via a theorem of the alternative
• Title not available (Why is that?)
• Constrained vector valued ratio games and generalized subdifferentiable multiobjective fractional minmax programming

This page was built for publication: Fractional programming without differentiability

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