Simplex/Problem-Data.h at main · leonid-sokolinsky/Simplex · GitHub

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
/*==============================================================================
Project: LiFe - New Linear Programming Solvers
Theme: Simplex
Module: Problem-Data.h (Problem Data)
Prefix: PD
Author: Leonid B. Sokolinsky
This source code has been produced with using BSF-skeleton
================================================================================*/
#include "Problem-Types.h"		// Problem Parameters
using namespace std;
//========================== Algorithm-independent data ========================
static int PD_m;					// Total number of constraints
static int PD_n;					// Space dimension
static PT_matrix_T PD_A;			// Matrix of constraint coefficients
static PT_bitscale_T PD_isEquation;	// Constraint is equation
static PT_column_T PD_b;			// Column of constant terms (right-hand parts)
static PT_vector_T PD_c;			// Gradient of Objective Function
//========================== Algorithm variables ===============================
static int PD_subspaceDim;	// Dimension of of support subspace (PD_n = PD_subspaceDim + PD_meq_basis)
static int PD_iterNo;		// Number of iterations
static double PD_objF_v;	// Objective function value in curerent point
static double PD_relativeError;
//========================== Algorithm structures ==============================
static PT_vector_T PD_v;				// Current vertex
static PT_vector_T PD_hi;				// Higher bound
static PT_vector_T PD_lo;				// Lower bound
static PT_column_T PD_norm_a;			// Column of norms of matrix rows

static int PD_eqHyperplanes[PP_MM];		// Index of all base hyperplanes (correcpond to equations)
static int PD_meq;						// Number of all base hyperplanes (correcpond to inequalities)
static int PD_meq_basis;				// Number of base hyperplanes included into basis

static int PD_neHyperplanes[PP_MM];		// Index of all boundary hyperplanes
static int PD_mne;						// Number of all boundary hyperplanes

static int PD_neHyperplanes_v[PP_MM];	// Index of boundary hyperplanes that include vertex v
static int PD_mne_v;					// Number of boundary hyperplanes that include vertex v
static int PD_basis_v[PP_N];			// Randome basis in vertex v

static double PD_A0[PP_N][PP_N];		// A_basis_v * v = basis_b
static double PD_A0I[PP_N][PP_N];		// AI_basis_v is the inverse matrix to A_basis_v
static PT_column_T PD_u;				// Dual point

static PT_matrix_T PD_D;				// Auxiliary matrix used in function Matrix_Rank(*)
//========================== Input/Output =====================================
static string PD_problemName;