-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathglpapi01.c
1570 lines (1518 loc) · 51.7 KB
/
glpapi01.c
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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* glpapi01.c (problem creating and modifying routines) */
/***********************************************************************
* This code is part of GLPK (GNU Linear Programming Kit).
*
* Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008,
* 2009, 2010, 2011, 2013 Andrew Makhorin, Department for Applied
* Informatics, Moscow Aviation Institute, Moscow, Russia. All rights
* reserved. E-mail: <[email protected]>.
*
* GLPK is free software: you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* GLPK is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
* License for more details.
*
* You should have received a copy of the GNU General Public License
* along with GLPK. If not, see <http://www.gnu.org/licenses/>.
***********************************************************************/
#include "glpios.h"
/* CAUTION: DO NOT CHANGE THE LIMITS BELOW */
#define M_MAX 100000000 /* = 100*10^6 */
/* maximal number of rows in the problem object */
#define N_MAX 100000000 /* = 100*10^6 */
/* maximal number of columns in the problem object */
#define NNZ_MAX 500000000 /* = 500*10^6 */
/* maximal number of constraint coefficients in the problem object */
/***********************************************************************
* NAME
*
* glp_create_prob - create problem object
*
* SYNOPSIS
*
* glp_prob *glp_create_prob(void);
*
* DESCRIPTION
*
* The routine glp_create_prob creates a new problem object, which is
* initially "empty", i.e. has no rows and columns.
*
* RETURNS
*
* The routine returns a pointer to the object created, which should be
* used in any subsequent operations on this object. */
static void create_prob(glp_prob *lp)
{ lp->magic = GLP_PROB_MAGIC;
lp->pool = dmp_create_pool();
#if 0 /* 17/XI-2009 */
lp->cps = xmalloc(sizeof(struct LPXCPS));
lpx_reset_parms(lp);
#else
lp->parms = NULL;
#endif
lp->tree = NULL;
#if 0
lp->lwa = 0;
lp->cwa = NULL;
#endif
/* LP/MIP data */
lp->name = NULL;
lp->obj = NULL;
lp->dir = GLP_MIN;
lp->c0 = 0.0;
lp->m_max = 100;
lp->n_max = 200;
lp->m = lp->n = 0;
lp->nnz = 0;
lp->row = xcalloc(1+lp->m_max, sizeof(GLPROW *));
lp->col = xcalloc(1+lp->n_max, sizeof(GLPCOL *));
lp->r_tree = lp->c_tree = NULL;
/* basis factorization */
lp->valid = 0;
lp->head = xcalloc(1+lp->m_max, sizeof(int));
lp->bfcp = NULL;
lp->bfd = NULL;
/* basic solution (LP) */
lp->pbs_stat = lp->dbs_stat = GLP_UNDEF;
lp->obj_val = 0.0;
lp->it_cnt = 0;
lp->some = 0;
/* interior-point solution (LP) */
lp->ipt_stat = GLP_UNDEF;
lp->ipt_obj = 0.0;
/* integer solution (MIP) */
lp->mip_stat = GLP_UNDEF;
lp->mip_obj = 0.0;
return;
}
glp_prob *glp_create_prob(void)
{ glp_prob *lp;
lp = xmalloc(sizeof(glp_prob));
create_prob(lp);
return lp;
}
/***********************************************************************
* NAME
*
* glp_set_prob_name - assign (change) problem name
*
* SYNOPSIS
*
* void glp_set_prob_name(glp_prob *lp, const char *name);
*
* DESCRIPTION
*
* The routine glp_set_prob_name assigns a given symbolic name (1 up to
* 255 characters) to the specified problem object.
*
* If the parameter name is NULL or empty string, the routine erases an
* existing symbolic name of the problem object. */
void glp_set_prob_name(glp_prob *lp, const char *name)
{ glp_tree *tree = lp->tree;
if (tree != NULL && tree->reason != 0)
xerror("glp_set_prob_name: operation not allowed\n");
if (lp->name != NULL)
{ dmp_free_atom(lp->pool, lp->name, strlen(lp->name)+1);
lp->name = NULL;
}
if (!(name == NULL || name[0] == '\0'))
{ int k;
for (k = 0; name[k] != '\0'; k++)
{ if (k == 256)
xerror("glp_set_prob_name: problem name too long\n");
if (iscntrl((unsigned char)name[k]))
xerror("glp_set_prob_name: problem name contains invalid"
" character(s)\n");
}
lp->name = dmp_get_atom(lp->pool, strlen(name)+1);
strcpy(lp->name, name);
}
return;
}
/***********************************************************************
* NAME
*
* glp_set_obj_name - assign (change) objective function name
*
* SYNOPSIS
*
* void glp_set_obj_name(glp_prob *lp, const char *name);
*
* DESCRIPTION
*
* The routine glp_set_obj_name assigns a given symbolic name (1 up to
* 255 characters) to the objective function of the specified problem
* object.
*
* If the parameter name is NULL or empty string, the routine erases an
* existing name of the objective function. */
void glp_set_obj_name(glp_prob *lp, const char *name)
{ glp_tree *tree = lp->tree;
if (tree != NULL && tree->reason != 0)
xerror("glp_set_obj_name: operation not allowed\n");
if (lp->obj != NULL)
{ dmp_free_atom(lp->pool, lp->obj, strlen(lp->obj)+1);
lp->obj = NULL;
}
if (!(name == NULL || name[0] == '\0'))
{ int k;
for (k = 0; name[k] != '\0'; k++)
{ if (k == 256)
xerror("glp_set_obj_name: objective name too long\n");
if (iscntrl((unsigned char)name[k]))
xerror("glp_set_obj_name: objective name contains invali"
"d character(s)\n");
}
lp->obj = dmp_get_atom(lp->pool, strlen(name)+1);
strcpy(lp->obj, name);
}
return;
}
/***********************************************************************
* NAME
*
* glp_set_obj_dir - set (change) optimization direction flag
*
* SYNOPSIS
*
* void glp_set_obj_dir(glp_prob *lp, int dir);
*
* DESCRIPTION
*
* The routine glp_set_obj_dir sets (changes) optimization direction
* flag (i.e. "sense" of the objective function) as specified by the
* parameter dir:
*
* GLP_MIN - minimization;
* GLP_MAX - maximization. */
void glp_set_obj_dir(glp_prob *lp, int dir)
{ glp_tree *tree = lp->tree;
if (tree != NULL && tree->reason != 0)
xerror("glp_set_obj_dir: operation not allowed\n");
if (!(dir == GLP_MIN || dir == GLP_MAX))
xerror("glp_set_obj_dir: dir = %d; invalid direction flag\n",
dir);
lp->dir = dir;
return;
}
/***********************************************************************
* NAME
*
* glp_add_rows - add new rows to problem object
*
* SYNOPSIS
*
* int glp_add_rows(glp_prob *lp, int nrs);
*
* DESCRIPTION
*
* The routine glp_add_rows adds nrs rows (constraints) to the specified
* problem object. New rows are always added to the end of the row list,
* so the ordinal numbers of existing rows remain unchanged.
*
* Being added each new row is initially free (unbounded) and has empty
* list of the constraint coefficients.
*
* RETURNS
*
* The routine glp_add_rows returns the ordinal number of the first new
* row added to the problem object. */
int glp_add_rows(glp_prob *lp, int nrs)
{ glp_tree *tree = lp->tree;
GLPROW *row;
int m_new, i;
/* determine new number of rows */
if (nrs < 1)
xerror("glp_add_rows: nrs = %d; invalid number of rows\n",
nrs);
if (nrs > M_MAX - lp->m)
xerror("glp_add_rows: nrs = %d; too many rows\n", nrs);
m_new = lp->m + nrs;
/* increase the room, if necessary */
if (lp->m_max < m_new)
{ GLPROW **save = lp->row;
while (lp->m_max < m_new)
{ lp->m_max += lp->m_max;
xassert(lp->m_max > 0);
}
lp->row = xcalloc(1+lp->m_max, sizeof(GLPROW *));
memcpy(&lp->row[1], &save[1], lp->m * sizeof(GLPROW *));
xfree(save);
/* do not forget about the basis header */
xfree(lp->head);
lp->head = xcalloc(1+lp->m_max, sizeof(int));
}
/* add new rows to the end of the row list */
for (i = lp->m+1; i <= m_new; i++)
{ /* create row descriptor */
lp->row[i] = row = dmp_get_atom(lp->pool, sizeof(GLPROW));
row->i = i;
row->name = NULL;
row->node = NULL;
#if 1 /* 20/IX-2008 */
row->level = 0;
row->origin = 0;
row->klass = 0;
if (tree != NULL)
{ switch (tree->reason)
{ case 0:
break;
case GLP_IROWGEN:
xassert(tree->curr != NULL);
row->level = tree->curr->level;
row->origin = GLP_RF_LAZY;
break;
case GLP_ICUTGEN:
xassert(tree->curr != NULL);
row->level = tree->curr->level;
row->origin = GLP_RF_CUT;
break;
default:
xassert(tree != tree);
}
}
#endif
row->type = GLP_FR;
row->lb = row->ub = 0.0;
row->ptr = NULL;
row->rii = 1.0;
row->stat = GLP_BS;
#if 0
row->bind = -1;
#else
row->bind = 0;
#endif
row->prim = row->dual = 0.0;
row->pval = row->dval = 0.0;
row->mipx = 0.0;
}
/* set new number of rows */
lp->m = m_new;
/* invalidate the basis factorization */
lp->valid = 0;
#if 1
if (tree != NULL && tree->reason != 0) tree->reopt = 1;
#endif
/* return the ordinal number of the first row added */
return m_new - nrs + 1;
}
/***********************************************************************
* NAME
*
* glp_add_cols - add new columns to problem object
*
* SYNOPSIS
*
* int glp_add_cols(glp_prob *lp, int ncs);
*
* DESCRIPTION
*
* The routine glp_add_cols adds ncs columns (structural variables) to
* the specified problem object. New columns are always added to the end
* of the column list, so the ordinal numbers of existing columns remain
* unchanged.
*
* Being added each new column is initially fixed at zero and has empty
* list of the constraint coefficients.
*
* RETURNS
*
* The routine glp_add_cols returns the ordinal number of the first new
* column added to the problem object. */
int glp_add_cols(glp_prob *lp, int ncs)
{ glp_tree *tree = lp->tree;
GLPCOL *col;
int n_new, j;
if (tree != NULL && tree->reason != 0)
xerror("glp_add_cols: operation not allowed\n");
/* determine new number of columns */
if (ncs < 1)
xerror("glp_add_cols: ncs = %d; invalid number of columns\n",
ncs);
if (ncs > N_MAX - lp->n)
xerror("glp_add_cols: ncs = %d; too many columns\n", ncs);
n_new = lp->n + ncs;
/* increase the room, if necessary */
if (lp->n_max < n_new)
{ GLPCOL **save = lp->col;
while (lp->n_max < n_new)
{ lp->n_max += lp->n_max;
xassert(lp->n_max > 0);
}
lp->col = xcalloc(1+lp->n_max, sizeof(GLPCOL *));
memcpy(&lp->col[1], &save[1], lp->n * sizeof(GLPCOL *));
xfree(save);
}
/* add new columns to the end of the column list */
for (j = lp->n+1; j <= n_new; j++)
{ /* create column descriptor */
lp->col[j] = col = dmp_get_atom(lp->pool, sizeof(GLPCOL));
col->j = j;
col->name = NULL;
col->node = NULL;
col->kind = GLP_CV;
col->type = GLP_FX;
col->lb = col->ub = 0.0;
col->coef = 0.0;
col->ptr = NULL;
col->sjj = 1.0;
col->stat = GLP_NS;
#if 0
col->bind = -1;
#else
col->bind = 0; /* the basis may remain valid */
#endif
col->prim = col->dual = 0.0;
col->pval = col->dval = 0.0;
col->mipx = 0.0;
}
/* set new number of columns */
lp->n = n_new;
/* return the ordinal number of the first column added */
return n_new - ncs + 1;
}
/***********************************************************************
* NAME
*
* glp_set_row_name - assign (change) row name
*
* SYNOPSIS
*
* void glp_set_row_name(glp_prob *lp, int i, const char *name);
*
* DESCRIPTION
*
* The routine glp_set_row_name assigns a given symbolic name (1 up to
* 255 characters) to i-th row (auxiliary variable) of the specified
* problem object.
*
* If the parameter name is NULL or empty string, the routine erases an
* existing name of i-th row. */
void glp_set_row_name(glp_prob *lp, int i, const char *name)
{ glp_tree *tree = lp->tree;
GLPROW *row;
if (!(1 <= i && i <= lp->m))
xerror("glp_set_row_name: i = %d; row number out of range\n",
i);
row = lp->row[i];
if (tree != NULL && tree->reason != 0)
{ xassert(tree->curr != NULL);
xassert(row->level == tree->curr->level);
}
if (row->name != NULL)
{ if (row->node != NULL)
{ xassert(lp->r_tree != NULL);
avl_delete_node(lp->r_tree, row->node);
row->node = NULL;
}
dmp_free_atom(lp->pool, row->name, strlen(row->name)+1);
row->name = NULL;
}
if (!(name == NULL || name[0] == '\0'))
{ int k;
for (k = 0; name[k] != '\0'; k++)
{ if (k == 256)
xerror("glp_set_row_name: i = %d; row name too long\n",
i);
if (iscntrl((unsigned char)name[k]))
xerror("glp_set_row_name: i = %d: row name contains inva"
"lid character(s)\n", i);
}
row->name = dmp_get_atom(lp->pool, strlen(name)+1);
strcpy(row->name, name);
if (lp->r_tree != NULL)
{ xassert(row->node == NULL);
row->node = avl_insert_node(lp->r_tree, row->name);
avl_set_node_link(row->node, row);
}
}
return;
}
/***********************************************************************
* NAME
*
* glp_set_col_name - assign (change) column name
*
* SYNOPSIS
*
* void glp_set_col_name(glp_prob *lp, int j, const char *name);
*
* DESCRIPTION
*
* The routine glp_set_col_name assigns a given symbolic name (1 up to
* 255 characters) to j-th column (structural variable) of the specified
* problem object.
*
* If the parameter name is NULL or empty string, the routine erases an
* existing name of j-th column. */
void glp_set_col_name(glp_prob *lp, int j, const char *name)
{ glp_tree *tree = lp->tree;
GLPCOL *col;
if (tree != NULL && tree->reason != 0)
xerror("glp_set_col_name: operation not allowed\n");
if (!(1 <= j && j <= lp->n))
xerror("glp_set_col_name: j = %d; column number out of range\n"
, j);
col = lp->col[j];
if (col->name != NULL)
{ if (col->node != NULL)
{ xassert(lp->c_tree != NULL);
avl_delete_node(lp->c_tree, col->node);
col->node = NULL;
}
dmp_free_atom(lp->pool, col->name, strlen(col->name)+1);
col->name = NULL;
}
if (!(name == NULL || name[0] == '\0'))
{ int k;
for (k = 0; name[k] != '\0'; k++)
{ if (k == 256)
xerror("glp_set_col_name: j = %d; column name too long\n"
, j);
if (iscntrl((unsigned char)name[k]))
xerror("glp_set_col_name: j = %d: column name contains i"
"nvalid character(s)\n", j);
}
col->name = dmp_get_atom(lp->pool, strlen(name)+1);
strcpy(col->name, name);
if (lp->c_tree != NULL && col->name != NULL)
{ xassert(col->node == NULL);
col->node = avl_insert_node(lp->c_tree, col->name);
avl_set_node_link(col->node, col);
}
}
return;
}
/***********************************************************************
* NAME
*
* glp_set_row_bnds - set (change) row bounds
*
* SYNOPSIS
*
* void glp_set_row_bnds(glp_prob *lp, int i, int type, double lb,
* double ub);
*
* DESCRIPTION
*
* The routine glp_set_row_bnds sets (changes) the type and bounds of
* i-th row (auxiliary variable) of the specified problem object.
*
* Parameters type, lb, and ub specify the type, lower bound, and upper
* bound, respectively, as follows:
*
* Type Bounds Comments
* ------------------------------------------------------
* GLP_FR -inf < x < +inf Free variable
* GLP_LO lb <= x < +inf Variable with lower bound
* GLP_UP -inf < x <= ub Variable with upper bound
* GLP_DB lb <= x <= ub Double-bounded variable
* GLP_FX x = lb Fixed variable
*
* where x is the auxiliary variable associated with i-th row.
*
* If the row has no lower bound, the parameter lb is ignored. If the
* row has no upper bound, the parameter ub is ignored. If the row is
* an equality constraint (i.e. the corresponding auxiliary variable is
* of fixed type), only the parameter lb is used while the parameter ub
* is ignored. */
void glp_set_row_bnds(glp_prob *lp, int i, int type, double lb,
double ub)
{ GLPROW *row;
if (!(1 <= i && i <= lp->m))
xerror("glp_set_row_bnds: i = %d; row number out of range\n",
i);
row = lp->row[i];
row->type = type;
switch (type)
{ case GLP_FR:
row->lb = row->ub = 0.0;
if (row->stat != GLP_BS) row->stat = GLP_NF;
break;
case GLP_LO:
row->lb = lb, row->ub = 0.0;
if (row->stat != GLP_BS) row->stat = GLP_NL;
break;
case GLP_UP:
row->lb = 0.0, row->ub = ub;
if (row->stat != GLP_BS) row->stat = GLP_NU;
break;
case GLP_DB:
row->lb = lb, row->ub = ub;
if (!(row->stat == GLP_BS ||
row->stat == GLP_NL || row->stat == GLP_NU))
row->stat = (fabs(lb) <= fabs(ub) ? GLP_NL : GLP_NU);
break;
case GLP_FX:
row->lb = row->ub = lb;
if (row->stat != GLP_BS) row->stat = GLP_NS;
break;
default:
xerror("glp_set_row_bnds: i = %d; type = %d; invalid row ty"
"pe\n", i, type);
}
return;
}
/***********************************************************************
* NAME
*
* glp_set_col_bnds - set (change) column bounds
*
* SYNOPSIS
*
* void glp_set_col_bnds(glp_prob *lp, int j, int type, double lb,
* double ub);
*
* DESCRIPTION
*
* The routine glp_set_col_bnds sets (changes) the type and bounds of
* j-th column (structural variable) of the specified problem object.
*
* Parameters type, lb, and ub specify the type, lower bound, and upper
* bound, respectively, as follows:
*
* Type Bounds Comments
* ------------------------------------------------------
* GLP_FR -inf < x < +inf Free variable
* GLP_LO lb <= x < +inf Variable with lower bound
* GLP_UP -inf < x <= ub Variable with upper bound
* GLP_DB lb <= x <= ub Double-bounded variable
* GLP_FX x = lb Fixed variable
*
* where x is the structural variable associated with j-th column.
*
* If the column has no lower bound, the parameter lb is ignored. If the
* column has no upper bound, the parameter ub is ignored. If the column
* is of fixed type, only the parameter lb is used while the parameter
* ub is ignored. */
void glp_set_col_bnds(glp_prob *lp, int j, int type, double lb,
double ub)
{ GLPCOL *col;
if (!(1 <= j && j <= lp->n))
xerror("glp_set_col_bnds: j = %d; column number out of range\n"
, j);
col = lp->col[j];
col->type = type;
switch (type)
{ case GLP_FR:
col->lb = col->ub = 0.0;
if (col->stat != GLP_BS) col->stat = GLP_NF;
break;
case GLP_LO:
col->lb = lb, col->ub = 0.0;
if (col->stat != GLP_BS) col->stat = GLP_NL;
break;
case GLP_UP:
col->lb = 0.0, col->ub = ub;
if (col->stat != GLP_BS) col->stat = GLP_NU;
break;
case GLP_DB:
col->lb = lb, col->ub = ub;
if (!(col->stat == GLP_BS ||
col->stat == GLP_NL || col->stat == GLP_NU))
col->stat = (fabs(lb) <= fabs(ub) ? GLP_NL : GLP_NU);
break;
case GLP_FX:
col->lb = col->ub = lb;
if (col->stat != GLP_BS) col->stat = GLP_NS;
break;
default:
xerror("glp_set_col_bnds: j = %d; type = %d; invalid column"
" type\n", j, type);
}
return;
}
/***********************************************************************
* NAME
*
* glp_set_obj_coef - set (change) obj. coefficient or constant term
*
* SYNOPSIS
*
* void glp_set_obj_coef(glp_prob *lp, int j, double coef);
*
* DESCRIPTION
*
* The routine glp_set_obj_coef sets (changes) objective coefficient at
* j-th column (structural variable) of the specified problem object.
*
* If the parameter j is 0, the routine sets (changes) the constant term
* ("shift") of the objective function. */
void glp_set_obj_coef(glp_prob *lp, int j, double coef)
{ glp_tree *tree = lp->tree;
if (tree != NULL && tree->reason != 0)
xerror("glp_set_obj_coef: operation not allowed\n");
if (!(0 <= j && j <= lp->n))
xerror("glp_set_obj_coef: j = %d; column number out of range\n"
, j);
if (j == 0)
lp->c0 = coef;
else
lp->col[j]->coef = coef;
return;
}
/***********************************************************************
* NAME
*
* glp_set_mat_row - set (replace) row of the constraint matrix
*
* SYNOPSIS
*
* void glp_set_mat_row(glp_prob *lp, int i, int len, const int ind[],
* const double val[]);
*
* DESCRIPTION
*
* The routine glp_set_mat_row stores (replaces) the contents of i-th
* row of the constraint matrix of the specified problem object.
*
* Column indices and numeric values of new row elements must be placed
* in locations ind[1], ..., ind[len] and val[1], ..., val[len], where
* 0 <= len <= n is the new length of i-th row, n is the current number
* of columns in the problem object. Elements with identical column
* indices are not allowed. Zero elements are allowed, but they are not
* stored in the constraint matrix.
*
* If the parameter len is zero, the parameters ind and/or val can be
* specified as NULL. */
void glp_set_mat_row(glp_prob *lp, int i, int len, const int ind[],
const double val[])
{ glp_tree *tree = lp->tree;
GLPROW *row;
GLPCOL *col;
GLPAIJ *aij, *next;
int j, k;
/* obtain pointer to i-th row */
if (!(1 <= i && i <= lp->m))
xerror("glp_set_mat_row: i = %d; row number out of range\n",
i);
row = lp->row[i];
if (tree != NULL && tree->reason != 0)
{ xassert(tree->curr != NULL);
xassert(row->level == tree->curr->level);
}
/* remove all existing elements from i-th row */
while (row->ptr != NULL)
{ /* take next element in the row */
aij = row->ptr;
/* remove the element from the row list */
row->ptr = aij->r_next;
/* obtain pointer to corresponding column */
col = aij->col;
/* remove the element from the column list */
if (aij->c_prev == NULL)
col->ptr = aij->c_next;
else
aij->c_prev->c_next = aij->c_next;
if (aij->c_next == NULL)
;
else
aij->c_next->c_prev = aij->c_prev;
/* return the element to the memory pool */
dmp_free_atom(lp->pool, aij, sizeof(GLPAIJ)), lp->nnz--;
/* if the corresponding column is basic, invalidate the basis
factorization */
if (col->stat == GLP_BS) lp->valid = 0;
}
/* store new contents of i-th row */
if (!(0 <= len && len <= lp->n))
xerror("glp_set_mat_row: i = %d; len = %d; invalid row length "
"\n", i, len);
if (len > NNZ_MAX - lp->nnz)
xerror("glp_set_mat_row: i = %d; len = %d; too many constraint"
" coefficients\n", i, len);
for (k = 1; k <= len; k++)
{ /* take number j of corresponding column */
j = ind[k];
/* obtain pointer to j-th column */
if (!(1 <= j && j <= lp->n))
xerror("glp_set_mat_row: i = %d; ind[%d] = %d; column index"
" out of range\n", i, k, j);
col = lp->col[j];
/* if there is element with the same column index, it can only
be found in the beginning of j-th column list */
if (col->ptr != NULL && col->ptr->row->i == i)
xerror("glp_set_mat_row: i = %d; ind[%d] = %d; duplicate co"
"lumn indices not allowed\n", i, k, j);
/* create new element */
aij = dmp_get_atom(lp->pool, sizeof(GLPAIJ)), lp->nnz++;
aij->row = row;
aij->col = col;
aij->val = val[k];
/* add the new element to the beginning of i-th row and j-th
column lists */
aij->r_prev = NULL;
aij->r_next = row->ptr;
aij->c_prev = NULL;
aij->c_next = col->ptr;
if (aij->r_next != NULL) aij->r_next->r_prev = aij;
if (aij->c_next != NULL) aij->c_next->c_prev = aij;
row->ptr = col->ptr = aij;
/* if the corresponding column is basic, invalidate the basis
factorization */
if (col->stat == GLP_BS && aij->val != 0.0) lp->valid = 0;
}
/* remove zero elements from i-th row */
for (aij = row->ptr; aij != NULL; aij = next)
{ next = aij->r_next;
if (aij->val == 0.0)
{ /* remove the element from the row list */
if (aij->r_prev == NULL)
row->ptr = next;
else
aij->r_prev->r_next = next;
if (next == NULL)
;
else
next->r_prev = aij->r_prev;
/* remove the element from the column list */
xassert(aij->c_prev == NULL);
aij->col->ptr = aij->c_next;
if (aij->c_next != NULL) aij->c_next->c_prev = NULL;
/* return the element to the memory pool */
dmp_free_atom(lp->pool, aij, sizeof(GLPAIJ)), lp->nnz--;
}
}
return;
}
/***********************************************************************
* NAME
*
* glp_set_mat_col - set (replace) column of the constraint matrix
*
* SYNOPSIS
*
* void glp_set_mat_col(glp_prob *lp, int j, int len, const int ind[],
* const double val[]);
*
* DESCRIPTION
*
* The routine glp_set_mat_col stores (replaces) the contents of j-th
* column of the constraint matrix of the specified problem object.
*
* Row indices and numeric values of new column elements must be placed
* in locations ind[1], ..., ind[len] and val[1], ..., val[len], where
* 0 <= len <= m is the new length of j-th column, m is the current
* number of rows in the problem object. Elements with identical column
* indices are not allowed. Zero elements are allowed, but they are not
* stored in the constraint matrix.
*
* If the parameter len is zero, the parameters ind and/or val can be
* specified as NULL. */
void glp_set_mat_col(glp_prob *lp, int j, int len, const int ind[],
const double val[])
{ glp_tree *tree = lp->tree;
GLPROW *row;
GLPCOL *col;
GLPAIJ *aij, *next;
int i, k;
if (tree != NULL && tree->reason != 0)
xerror("glp_set_mat_col: operation not allowed\n");
/* obtain pointer to j-th column */
if (!(1 <= j && j <= lp->n))
xerror("glp_set_mat_col: j = %d; column number out of range\n",
j);
col = lp->col[j];
/* remove all existing elements from j-th column */
while (col->ptr != NULL)
{ /* take next element in the column */
aij = col->ptr;
/* remove the element from the column list */
col->ptr = aij->c_next;
/* obtain pointer to corresponding row */
row = aij->row;
/* remove the element from the row list */
if (aij->r_prev == NULL)
row->ptr = aij->r_next;
else
aij->r_prev->r_next = aij->r_next;
if (aij->r_next == NULL)
;
else
aij->r_next->r_prev = aij->r_prev;
/* return the element to the memory pool */
dmp_free_atom(lp->pool, aij, sizeof(GLPAIJ)), lp->nnz--;
}
/* store new contents of j-th column */
if (!(0 <= len && len <= lp->m))
xerror("glp_set_mat_col: j = %d; len = %d; invalid column leng"
"th\n", j, len);
if (len > NNZ_MAX - lp->nnz)
xerror("glp_set_mat_col: j = %d; len = %d; too many constraint"
" coefficients\n", j, len);
for (k = 1; k <= len; k++)
{ /* take number i of corresponding row */
i = ind[k];
/* obtain pointer to i-th row */
if (!(1 <= i && i <= lp->m))
xerror("glp_set_mat_col: j = %d; ind[%d] = %d; row index ou"
"t of range\n", j, k, i);
row = lp->row[i];
/* if there is element with the same row index, it can only be
found in the beginning of i-th row list */
if (row->ptr != NULL && row->ptr->col->j == j)
xerror("glp_set_mat_col: j = %d; ind[%d] = %d; duplicate ro"
"w indices not allowed\n", j, k, i);
/* create new element */
aij = dmp_get_atom(lp->pool, sizeof(GLPAIJ)), lp->nnz++;
aij->row = row;
aij->col = col;
aij->val = val[k];
/* add the new element to the beginning of i-th row and j-th
column lists */
aij->r_prev = NULL;
aij->r_next = row->ptr;
aij->c_prev = NULL;
aij->c_next = col->ptr;
if (aij->r_next != NULL) aij->r_next->r_prev = aij;
if (aij->c_next != NULL) aij->c_next->c_prev = aij;
row->ptr = col->ptr = aij;
}
/* remove zero elements from j-th column */
for (aij = col->ptr; aij != NULL; aij = next)
{ next = aij->c_next;
if (aij->val == 0.0)
{ /* remove the element from the row list */
xassert(aij->r_prev == NULL);
aij->row->ptr = aij->r_next;
if (aij->r_next != NULL) aij->r_next->r_prev = NULL;
/* remove the element from the column list */
if (aij->c_prev == NULL)
col->ptr = next;
else
aij->c_prev->c_next = next;
if (next == NULL)
;
else
next->c_prev = aij->c_prev;
/* return the element to the memory pool */
dmp_free_atom(lp->pool, aij, sizeof(GLPAIJ)), lp->nnz--;
}
}
/* if j-th column is basic, invalidate the basis factorization */
if (col->stat == GLP_BS) lp->valid = 0;
return;
}
/***********************************************************************
* NAME
*
* glp_load_matrix - load (replace) the whole constraint matrix
*
* SYNOPSIS
*
* void glp_load_matrix(glp_prob *lp, int ne, const int ia[],
* const int ja[], const double ar[]);
*
* DESCRIPTION
*
* The routine glp_load_matrix loads the constraint matrix passed in
* the arrays ia, ja, and ar into the specified problem object. Before
* loading the current contents of the constraint matrix is destroyed.
*
* Constraint coefficients (elements of the constraint matrix) must be
* specified as triplets (ia[k], ja[k], ar[k]) for k = 1, ..., ne,
* where ia[k] is the row index, ja[k] is the column index, ar[k] is a
* numeric value of corresponding constraint coefficient. The parameter
* ne specifies the total number of (non-zero) elements in the matrix
* to be loaded. Coefficients with identical indices are not allowed.
* Zero coefficients are allowed, however, they are not stored in the
* constraint matrix.
*
* If the parameter ne is zero, the parameters ia, ja, and ar can be
* specified as NULL. */
void glp_load_matrix(glp_prob *lp, int ne, const int ia[],
const int ja[], const double ar[])
{ glp_tree *tree = lp->tree;
GLPROW *row;
GLPCOL *col;
GLPAIJ *aij, *next;
int i, j, k;
if (tree != NULL && tree->reason != 0)
xerror("glp_load_matrix: operation not allowed\n");
/* clear the constraint matrix */
for (i = 1; i <= lp->m; i++)
{ row = lp->row[i];
while (row->ptr != NULL)
{ aij = row->ptr;
row->ptr = aij->r_next;
dmp_free_atom(lp->pool, aij, sizeof(GLPAIJ)), lp->nnz--;
}
}
xassert(lp->nnz == 0);
for (j = 1; j <= lp->n; j++) lp->col[j]->ptr = NULL;
/* load the new contents of the constraint matrix and build its
row lists */
if (ne < 0)
xerror("glp_load_matrix: ne = %d; invalid number of constraint"
" coefficients\n", ne);
if (ne > NNZ_MAX)
xerror("glp_load_matrix: ne = %d; too many constraint coeffici"
"ents\n", ne);
for (k = 1; k <= ne; k++)
{ /* take indices of new element */
i = ia[k], j = ja[k];
/* obtain pointer to i-th row */
if (!(1 <= i && i <= lp->m))
xerror("glp_load_matrix: ia[%d] = %d; row index out of rang"
"e\n", k, i);
row = lp->row[i];
/* obtain pointer to j-th column */
if (!(1 <= j && j <= lp->n))