Characterizing solutions of rough programming problems
From MaRDI portal
Recommendations
- Mathematical programming in rough environment
- Rough multiple objective programming
- Qualitative analysis of basic notions in parametric rough convex programming (parameters in the objective function and feasible region is a rough set)
- Rough posynomial geometric programming and its algorithm
- Linear programming with rough interval coefficients
Cites work
- scientific article; zbMATH DE number 3976764 (Why is no real title available?)
- scientific article; zbMATH DE number 108581 (Why is no real title available?)
- scientific article; zbMATH DE number 1927340 (Why is no real title available?)
- scientific article; zbMATH DE number 967938 (Why is no real title available?)
- scientific article; zbMATH DE number 972613 (Why is no real title available?)
- Information granulation and rough set approximation
- ROUGH FUZZY SETS AND FUZZY ROUGH SETS*
Cited in
(8)- Mathematical programming in rough environment
- Rough multiple objective programming
- A class of expected value bilevel programming problems with random coefficients based on rough approximation and its application to a production-inventory system
- A class of rough multiple objective programming and its application to solid transportation problem
- Min-max solutions for parametric continuous static game under roughness (parameters in the cost function and feasible region is a rough set)
- On bottleneck-rough cost interval integer transportation problems
- A probability maximization model based on rough approximation and its application to the inventory problem
- Qualitative analysis of basic notions in parametric rough convex programming (parameters in the objective function and feasible region is a rough set)
This page was built for publication: Characterizing solutions of rough programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2569090)
