WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Scientific and Technical Information Processing
  2. Scientific and Technical Information Processing : Volume 38
  3. Scientific and Technical Information Processing : Volume 38, Issue 6, December 2011
  4. Reducing the Pareto set based on set-point information
Loading...

Please wait, while we are loading the content...

Scientific and Technical Information Processing : Volume 44
Scientific and Technical Information Processing : Volume 43
Scientific and Technical Information Processing : Volume 42
Scientific and Technical Information Processing : Volume 41
Scientific and Technical Information Processing : Volume 40
Scientific and Technical Information Processing : Volume 39
Scientific and Technical Information Processing : Volume 38
Scientific and Technical Information Processing : Volume 38, Issue 6, December 2011
J.S. Mill’s inductive methods in artificial intelligence systems. Part I
Visual knowledge processing techniques: A brief review
A method for compiling general concepts with the use of temporal decision trees
On the methodological foundations for the creation of expert systems for practical psychology
Distributed knowledge acquisition for the automatic construction of integrated expert systems
Reducing the Pareto set based on set-point information
Models and methods for decision making support in the negotiation process
Scientific and Technical Information Processing : Volume 38, Issue 5, December 2011
Scientific and Technical Information Processing : Volume 38, Issue 4, October 2011
Scientific and Technical Information Processing : Volume 38, Issue 3, July 2011
Scientific and Technical Information Processing : Volume 38, Issue 2, April 2011
Scientific and Technical Information Processing : Volume 38, Issue 1, February 2011
Scientific and Technical Information Processing : Volume 37
Scientific and Technical Information Processing : Volume 36
Scientific and Technical Information Processing : Volume 35
Scientific and Technical Information Processing : Volume 34

Similar Documents

...
Pareto-set reduction using compound information of a closed type

Article

...
Restriction of a pareto set based on information about a decision-maker’s preferences of the point-multiple type

Article

...
Reducing the pareto set algorithm based on an arbitrary finite set of information “quanta”

Article

...
An algorithm for Pareto set reduction using fuzzy information on decision-maker’s preference relation

Article

...
Reducing the pareto set on the basis of interrelated information patterns with fuzzy preference relation

Article

...
Pareto set reduction based on an axiomatic approach with application of some metrics

Article

...
Stepclass-based approach to multicriteria sorting

Article

...
Linear scalarization in multi-criterion optimization

Article

...
Reducing Resource Usage Based on User Hints and Policies

Article

Reducing the Pareto set based on set-point information

Content Provider Springer Nature Link
Author ghin, V. D.
Copyright Year 2011
Abstract An axiomatic approach to reducing the Pareto set in the problem of multicriteria choice based on an information set obtained from the decision maker is considered. The information reflects the degree up to which the decision maker is ready to lose values of one group of criteria to improve values of several other groups of criteria. It is proved that using this information one can eliminate a whole number of elements from the initial Pareto set, simplifying the subsequent choice.
Starting Page 435
Ending Page 439
Page Count 5
File Format PDF
ISSN 01476882
Journal Scientific and Technical Information Processing
Volume Number 38
Issue Number 6
e-ISSN 19348118
Language English
Publisher Allerton Press, Inc.
Publisher Date 2012-01-27
Publisher Place Heidelberg
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword multicriteria choice reducing the Pareto set axiomatic approach Computer Systems Organization and Communication Networks
Content Type Text
Resource Type Article
Subject Computer Science
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
I will try my best to help you...
Cite this Content
Loading...