DSpace Repository

A NEW SMOOTHING FUNCTION TECHNIQUE FOR SOLVING MINIMAX PROBLEMS

Show simple item record

dc.creator YILMAZ, Nurullah
dc.date 2025-01-01T00:00:00Z
dc.date.accessioned 2025-02-25T10:38:06Z
dc.date.available 2025-02-25T10:38:06Z
dc.identifier c74e2a18-891c-4467-975e-a7ded7ee6a4c
dc.identifier 10.11948/20240361
dc.identifier https://avesis.sdu.edu.tr/publication/details/c74e2a18-891c-4467-975e-a7ded7ee6a4c/oai
dc.identifier.uri http://acikerisim.sdu.edu.tr/xmlui/handle/123456789/101322
dc.description In this study, we consider non-smooth finite minimax problems. A new approach for solving minimax problems is developed, employing indicator functions and smoothing functions. First, the formulation of minimax problems is revised using indicator functions. Then, a new generation smoothing technique is used for the revised formulation. An algorithm is developed to solve the revised and smoothed problems numerically. The efficiency of the algorithm is demonstrated on several test problems, and a comparison is conducted between the numerical results achieved and those of alternative approaches. Finally, the portfolio planning problem is considered as a real-life application, and satisfactory results are obtained.
dc.language eng
dc.rights info:eu-repo/semantics/closedAccess
dc.title A NEW SMOOTHING FUNCTION TECHNIQUE FOR SOLVING MINIMAX PROBLEMS
dc.type info:eu-repo/semantics/article


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account