-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path_Problems-Klee-Minty-Cube.h
More file actions
130 lines (120 loc) · 6.12 KB
/
_Problems-Klee-Minty-Cube.h
File metadata and controls
130 lines (120 loc) · 6.12 KB
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
/*==============================================================================
Project: LiFe - New Linear Programming Solvers
Theme: Simplex (No MPI)
Module: _Problems-Klee-Minty-Cube.h (Problems from the LP-Klee-Minty-Cube Set)
Prefix: PP
Author: Leonid B. Sokolinsky
This include file is part of Problem-Parameters.h
Start vertex *_v.mtx for these problems was calculated by VeSP https://github.com/leonid-sokolinsky/VeSP
LP problems were obtained using Klee-Minty-Cube-Generator https://github.com/leonid-sokolinsky/Klee-Minty-Cube-Generator
LP problems are available in https://github.com/leonid-sokolinsky/Set-of-LP-Problems/tree/main/Klee-Minty-Cube
================================================================================*/
#pragma once
//============================== Problem Parameters ============================
// PP_OBJECTIVE_VECTOR_LENGTH - direct dependence on dimension PD_n.
// P_EPS_ZERO - inverse dependence on PP_OBJECTIVE_VECTOR_LENGTH.
//------------------------------------------------------------------------------
#define PP_EPS_ZERO 1E-11 // Accuracy for comparison with zero
#define PP_EPS_ON_HYPERPLANE 1E-11 // Accuracy of belonging to hyperplane
//-------------------------- Compilation Modes ---------------------------------
#define PP_GRADIENT
//------------------------------------------------------------------------------
/*============================== Klee-Minty5 LP problem ========================*
#define PP_PROBLEM_NAME "Klee-Minty5"
#define PP_D 5 // Space dimension
#define PP_M PP_D // Number of equations (number of rows in *.mtx)
#define PP_N (2*PP_D) // Number of variables (number of cols in *.mtx)
#define PP_MAX_OBJ_VALUE 3125
//------------------------------------------------------------------------------
// Elapsed time: 0
// Number of iterations: 1
// Computed objective value: 3125.00000000000045474735
// Maximal objective value: 3125
// Relative error = 1.46e-16
// Distance to polytope: 0
//------------------------------------------------------------------------------
/*============================== Klee-Minty6 LP problem ========================*
#define PP_PROBLEM_NAME "Klee-Minty6"
#define PP_D 6 // Space dimension
#define PP_M PP_D // Number of equations (number of rows in *.mtx)
#define PP_N (2*PP_D) // Number of variables (number of cols in *.mtx)
#define PP_MAX_OBJ_VALUE 15625
//------------------------------------------------------------------------------
// Elapsed time: 0
// Number of iterations: 1
// Computed objective value: 15625
// Maximal objective value: 15625
// Relative error = 0
// Distance to polytope: 0
//------------------------------------------------------------------------------
/*============================== Klee-Minty7 LP problem ========================*
#define PP_PROBLEM_NAME "Klee-Minty7"
#define PP_D 7 // Space dimension
#define PP_M PP_D // Number of equations (number of rows in *.mtx)
#define PP_N (2*PP_D) // Number of variables (number of cols in *.mtx)
#define PP_MAX_OBJ_VALUE 78125
//------------------------------------------------------------------------------
// Elapsed time: 0
// Number of iterations: 1
// Computed objective value: 78125
// Maximal objective value: 78125
// Relative error = 0
// Distance to polytope: 0
//------------------------------------------------------------------------------
/*============================== Klee-Minty8 LP problem ========================*
#define PP_PROBLEM_NAME "Klee-Minty8"
#define PP_D 8 // Space dimension
#define PP_M PP_D // Number of equations (number of rows in *.mtx)
#define PP_N (2*PP_D) // Number of variables (number of cols in *.mtx)
#define PP_MAX_OBJ_VALUE 390625
//------------------------------------------------------------------------------
// Elapsed time: 0
// Number of iterations: 1
// Computed objective value: 390624.999999999941792339
// Maximal objective value: 390625
// Relative error = 1.49e-16
// Distance to polytope: 0
//------------------------------------------------------------------------------
/*============================== Klee-Minty9 LP problem ========================*
#define PP_PROBLEM_NAME "Klee-Minty9"
#define PP_D 9 // Space dimension
#define PP_M PP_D // Number of equations (number of rows in *.mtx)
#define PP_N (2*PP_D) // Number of variables (number of cols in *.mtx)
#define PP_MAX_OBJ_VALUE 1953125
//------------------------------------------------------------------------------
// Elapsed time: 0
// Number of iterations: 1
// Computed objective value: 1953125
// Maximal objective value: 1953125
// Relative error = 0
// Distance to polytope: 0
//------------------------------------------------------------------------------
/*============================== Klee-Minty10 LP problem ========================*
#define PP_PROBLEM_NAME "Klee-Minty10"
#define PP_D 10 // Space dimension
#define PP_M PP_D // Number of equations (number of rows in *.mtx)
#define PP_N (2*PP_D) // Number of variables (number of cols in *.mtx)
#define PP_MAX_OBJ_VALUE 9765625
//------------------------------------------------------------------------------
// Elapsed time: 0
// Number of iterations: 1
// Computed objective value: 9765625
// Maximal objective value: 9765625
// Relative error = 0
// Distance to polytope: 0
//------------------------------------------------------------------------------
/*============================== Klee-Minty20 LP problem ========================*/
#define PP_PROBLEM_NAME "Klee-Minty20"
#define PP_D 20 // Space dimension
#define PP_M PP_D // Number of equations (number of rows in *.mtx)
#define PP_N (2*PP_D) // Number of variables (number of cols in *.mtx)
#define PP_MAX_OBJ_VALUE 95367431640625
//------------------------------------------------------------------------------
// Elapsed time: 0
// Number of iterations: 1
// Computed objective value: 95367431640625
// Maximal objective value: 95367431640625
// Relative error = 0
// Distance to polytope: 0
//------------------------------------------------------------------------------
/*==============================================================================*/