Quasi-convex functions and static minmax problems

Quasi-convex functions and static minmax problems

0.00 Avg rating0 Votes
Article ID: iaor1989737
Country: India
Volume: 26
Issue: 3
Start Page Number: 192
End Page Number: 196
Publication Date: Sep 1989
Journal: OPSEARCH
Authors: , ,
Keywords: optimization
Abstract:

Sufficient optimality criterion for static minmax problems have been derived under quasi-convexity assumption on the objective together with quasi-concavity strictly/pseudo-concavity assumptions on the constraint functions. The authors also give some sufficient optimality criteria for a multi-objective programming problem under such weaker convexity assumptions.

Reviews

Required fields are marked *. Your email address will not be published.