Qualitative analysis of basic notions in parametric rough convex programming (parameters in the objective function and feasible region is a rough set)

DOI10.1007/S12597-017-0300-2zbMath1391.90671OpenAlexW2587834741MaRDI QIDQ724391

Mohamed H. Eid, Mohamed A. Elsisy, Mohamed Sayed Ali Osman

Publication date: 25 July 2018

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-017-0300-2

zbMATH Keywords

rough setnonlinear optimization problemsolvability setstability set of the first kindstability set of the third kind

Mathematics Subject Classification ID

Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Related Items (1)

MIN-MAX SOLUTIONS FOR PARAMETRIC CONTINUOUS STATIC GAME UNDER ROUGHNESS (PARAMETERS IN THE COST FUNCTION AND FEASIBLE REGION IS A ROUGH SET)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory and practice of uncertain programming
• Characterizing solutions of rough programming problems
• Mathematical programming in rough environment
• Rough sets

This page was built for publication: Qualitative analysis of basic notions in parametric rough convex programming (parameters in the objective function and feasible region is a rough set)