Generalized fractional minimax programming with B - ( p , r ) -invexity

Optimality conditions are proved for a class of generalized fractional minimax programming problems involving B - ( p , r ) -invexity functions. Subsequently, these optimality conditions are utilized as a basis for constructing various duality models for this type of fractional programming problems...

Full description

Saved in:
Bibliographic Details
Published in:Computers & mathematics with applications (1987) 2008-09, Vol.56 (6), p.1505-1525
Main Author: Antczak, Tadeusz
Format: Article
Language:English
Subjects:
[formula omitted]-invex function
Computer simulation
Construction
Duality
Duality theorem
Fractional programming
Mathematical analysis
Mathematical models
Minimax technique
Optimality conditions
Optimization
Programming
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Optimality conditions are proved for a class of generalized fractional minimax programming problems involving B - ( p , r ) -invexity functions. Subsequently, these optimality conditions are utilized as a basis for constructing various duality models for this type of fractional programming problems and proving appropriate duality theorems.
ISSN:0898-1221
1873-7668
DOI:10.1016/j.camwa.2008.02.039