Simplex-method/normalize.h at main · duythanh22/Simplex-method · 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
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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
#pragma once
#include <iostream>
#include <vector>
#include <cstdio>
#include "var.h"
using namespace std;

// bien doi bai toan
void normalize() {

	// lay them bien phu ( de dua bai toan ve dang chinh tac)
    x_num_ = x_num;   //
    for (size_t i=0; i<st_num; ++i) {
        switch (eql[i]) {
        case 1:
        case 3:  // neu rang buoc nho hon 0 => tang them 1 bien cho rang buoc
            x_num++;
            break;
        case 2:
            x_num += 2;  // neu rang buoc lon hon 0 => tang them 2 bien cho rang buoc
            break;
        }
    }

    // reset lai kich thuoc cac vecto
    c.resize(x_num);
    for (size_t i=0; i<st_num; ++i) {
        a[i].resize(x_num);
    }

	// doi dau ham muc tieu
    if (min_max == 2)
        for (size_t i=0; i<x_num_; ++i){
        	c[i] *= -1;
		}

	// dua bai toan ve dang chinh tac
    for (size_t i=0; i<st_num; ++i) {
        switch (eql[i]) {	// xet cac rang buoc
        case 1:
            break;	// neu da o dang chinh tac thi dung
        case 2: 	// truong hop rang buoc >= 0
            add_num++;
            c[x_num_+add_num-1]=0;
            for(size_t j=x_num_; j<x_num; j++){
            	if(j==x_num_+add_num-1){
            		a[i][x_num_+add_num-1]=-1;
				}
			}
            break;
        case 3:	// truong hop rang buox <= 0
            add_num++;
            ba_num++;
            c[x_num_+add_num-1]=0;
            base_id[ba_num-1] = x_num_ + add_num;
            for(size_t j=x_num_; j<x_num; j++){
            	if(j==x_num_+add_num-1){
            		a[i][j]=1;
				}
			}
            break;
        }
    }

	// them bien gia
    for (size_t i=0; i<st_num; ++i) {
        switch (eql[i]) {
        	// vi chua co vecto don vi nen ta them cac bien gia
        case 1:
            add_num++;
            ba_num++;
            ar_num++;
            c[x_num_+add_num-1] = 0;
            base_id[ba_num-1] = ar_id[ar_num-1] = x_num_ + add_num;
            for(size_t j=x_num_; j<x_num; j++){
            	if(j==x_num_+add_num-1){
            		a[i][j] = 1;
				}
			}
            break;
        case 2:
            add_num++;
            ba_num++;
            ar_num++;
            c[x_num_+add_num-1]=0;
            base_id[ba_num-1] = ar_id[ar_num-1] = x_num_ + add_num;   // tong so bien
            for(size_t j=x_num_;j<x_num;j++){
            	if(j==x_num_+add_num-1){
            		a[i][j] = 1;
				}
			}
            break;
        case 3:  // do khi chuyen doi ve dang chinh tac ( <= 0) thi da co vecto don vi
            break;
        }

		// them vecto luu vecto J cua PACB ban dau
        vector<size_t> base_id_;
        for (size_t i=0; i<st_num; ++i) {
            for (size_t j=0; j<ba_num; ++j){
            	if (a[i][base_id[j]-1] == 1){
            		base_id_.push_back(base_id[j]);
				}
			}
        }
        base_id = base_id_;
    }

    cout << "Bai toan dua ve chinh tac (them cac bien phu va bien gia): " << endl;
    if (min_max == 1){
    	cout << "Max z = ";
	}
    else{
    	cout << "Min z = ";
	}
    if (c[0]==1){
    	cout << "x[1]";
	}
    else if(c[0]==-1){
    	cout << "-x[1]";
	}
    else if(c[0]!=0){
    	cout << " " << c[0] << "x[1]";
	}
    for (size_t i=1; i<x_num; ++i) {
        if(c[i]==1){
        	cout << " + x[" << i+1 << "]";
		}
        else if (c[i]==-1){
        	cout << " - x[" << i+1 << "]";
		}
        else if (c[i]>0){
        	cout << " + " << c[i] << "x[" << i+1 << "]";
		}
        else if (c[i]<0){
        	cout << " - " << -c[i] << "x[" << i+1 << "]";
		}
    }

    cout << endl << "Cac rang buoc: " << endl;
    for (size_t i=0; i<st_num; ++i) {
        for (size_t j=0; j<x_num; ++j) {
            if (a[i][j] != 0) {
                if (a[i][j]==1 && j==0){
                	cout << " x[" << j+1 << "]";
				}
                else if (a[i][j]==1 && j!=0){
                	cout << " + x[" << j+1 << "]";
				}
                else if (a[i][j]==-1 && j==0){
                	cout << " -x[" << j+1 << "]";
				}
                else if (a[i][j]==-1 && j!=0){
                	cout << " - x[" << j+1 << "]";
				}
                else if (a[i][j]>0 && j==0){
                	cout << " " << a[i][j] << "x[" << j+1 << "]";
				}
                else if (a[i][j]>0 && j!=0){
                	cout << " + " << a[i][j] << "x[" << j+1 << "]";
				}
                else if (a[i][j]<0 && j==0){
                	cout << " " << a[i][j] << "x[" << j+1 << "]";
				}
                else if (a[i][j]<0 && j!=0){
                	cout << " - " << -a[i][j] << "x[" << j+1 << "]";
				}
            }
        }
        cout << " = " << b[i] << endl;
    }
    cout << " x[1]~x[" << x_num << "] >= 0" << endl << endl;
}