Skip to content
RDL
Network
Ecosystem
Switch app
TR
About
FAQ
Sign in
Get started
Lower subdifferentiability in minimax fractional programming<sup>*</sup> — C. Bajona-Xandri (1999) | RDL Network
Back
Cite
Save
Save for later
Share
Home
Publications
Lower subdifferentiability in minimax fractional programming<sup>*</sup>
JL
Shared by
Juan Enrique Martinez Legaz
Universitat Autónoma de Barcelona
Lower subdifferentiability in minimax fractional programming<sup>*</sup>
Article
1999
en
Authors
CB
C. Bajona-Xandri
JL
Juan Enrique Martinez Legaz
Universitat Autónoma de Barcelona
Abstract
1 min read
Minimax fractional programming problems are analyzed from the view- point of lower subdifferentiability, obtaining Kuhn-Tucker type optimality conditions. Multiobjective optimization problems with fractional objectives are also studied.
Discussion
(0)
Sign in
to like and join the discussion.
No comments yet. Be the first to comment.
Related publications
Book
2008
Introduction to Mathematical Optimization: From Linear Programming to Metaheuristics
Xin-she Yang
Article
1984
Nonlinear programming without computation
Leon O Chua
,
Gui-Nian Lin
Article
1984
On minimax robustness: A general approach and applications
Sergio Verdú
,
H Vincent Vincent Poort
Article
1983
Some minimax detection and estimation problems in a Hilbert space setting
H Vincent Vincent Poort
Article
2019
Enhancing Security of MME Handover via Fractional Programming and Firefly Algorithm
Quoc‐Tuan Vien
,
Tuan Anh Le
,
Xin-she Yang
,
Trung Q. Duong
IEEE Transactions on Communications
Discussion(0)
No comments yet. Be the first to comment.