Критерии создания регламента проверки контрагентов
Пошаговая подготовка внутреннего документа.
Details
FGBOU VO "LITERATURNY HIGHER EDUCATION INSTITUTION NAMED AFTER A. M. GORKOGO"
Moscow
OGRN: 1027739212324
TIN: 7703035708
Active
Profile views
2,372
+9 last week
Subscribers
0
+0 last week
Company-related news
52
-30 last week
OKVED2 85.22 Total: 11
Higher education
Monitoring Notes Reports Contact information
100
Reliability Score
JavaScript chart by amCharts 3.21.1
Chancellor
Varlamov Aleksei Nikolaevich
27
years
Established
August 15, 1997
City Moscow
Revenue
No data
115
Connections
+0 last week
Employees
No data

Complaints to the FAS

A complaint to the FAS is a document in which a participant in the procedure disputes the decisions of the state customer or electronic platform that conducted the tender. The most common reasons for appeals are violations of procurement rules and restriction of competition.

Stats Over Time

Total Over the last year
Submitted by the company ▒▒▒▒▒ ▒▒▒▒▒
Submitted against the company ▒▒▒▒▒ ▒▒▒▒▒
  • ▒▒▒▒▒▒▒▒▒▒ ▒▒ ▒▒▒▒▒▒▒▒▒▒ ▒▒▒▒
  • ▒▒▒▒▒▒▒▒▒▒ ▒▒ ▒▒▒▒▒▒▒▒▒ ▒▒▒▒
  • ▒▒▒▒▒▒▒▒▒▒ ▒▒ ▒▒▒▒▒▒▒▒▒ ▒▒▒▒▒▒▒▒▒ ▒▒▒▒
Status
×

Closed complaints

Complaints filed against the organization (9)
Data sources Information about the companies' complaints to the FAS is collected from open sources.

Accurate binding to a company can be created only if the information source contains its TIN and OGRN values. If identification details are not specified, the binding is created by using linguistic algorithms. Although these algorithms are being constantly improved, some information may be absent.

If you have noticed an error or lack of information, please let us know about it. Let's improve Seldon.Basis together!

Data sources Information about the companies' complaints to the FAS is collected from open sources.

Accurate binding to a company can be created only if the information source contains its TIN and OGRN values. If identification details are not specified, the binding is created by using linguistic algorithms. Although these algorithms are being constantly improved, some information may be absent.

If you have noticed an error or lack of information, please let us know about it. Let's improve Seldon.Basis together!

Mo
Tu
We
Th
Fr
Sa
Su
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
4
Clear
Mo
Tu
We
Th
Fr
Sa
Su
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
4
Clear