Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
Claim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Two-level problems of standardization under the condition of ambiguity of an optimal consumer choice

descriptionPublicationkeyboard_double_arrow_right Article Publisher:Russian Academy of Sciences - RAS (Rossiĭskaya Akademiya Nauk - RAN), Siberian Branch (Sibirskoe Otdelenie), Sobolev Insitute of Mathematics (Institut Matematiki Im. S. L. Soboleva), Novosibirsk
Authors: Gorbachevskaya, L. E.;

Two-level problems of standardization under the condition of ambiguity of an optimal consumer choice

Abstract

Integer linear two-level programming problems are considered. These problems make it possible to simulate a choice of listed products under the condition of ambiguity of an optimal consumer choice. Some results on the complexity of the problems under consideration are also obtained.

Keywords

linear two-level programming problem, optimal consumer choice, ambiguity of an optimal consumer choice, Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.), Abstract computational complexity for mathematical programming problems, complexity

Powered by OpenAIRE graph
Found an issue? Give us feedback