-
Notifications
You must be signed in to change notification settings - Fork 2.2k
/
Copy pathModelBuilderExpr.cs
707 lines (629 loc) · 18.6 KB
/
ModelBuilderExpr.cs
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
// Copyright 2010-2024 Google LLC
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
namespace Google.OrTools.ModelBuilder
{
using Google.OrTools.Util;
using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Runtime.CompilerServices;
using Google.Protobuf.Collections;
internal static class HelperExtensions
{
// [MethodImpl(MethodImplOptions.AggressiveInlining)]
// public static void AddOrIncrement(this SortedDictionary<int, double> dict, int key, double increment)
// {
// #if NET6_0_OR_GREATER
// System.Runtime.InteropServices.CollectionsMarshal.GetValueRefOrAddDefault(dict, key, out _) += increment;
// #else
// if (dict.TryGetValue(key, out var value))
// {
// dict[key] = value + increment;
// }
// else
// {
// dict.Add(key, increment);
// }
// #endif
// }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
internal static void TrySetCapacity<TField, TValues>(this RepeatedField<TField> field, IEnumerable<TValues> values)
{
if (values is ICollection<TValues> collection)
{
field.Capacity = collection.Count;
}
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
internal static void TryEnsureCapacity<TValue, TValues>(this List<TValue> list, IEnumerable<TValues> values)
{
// Check for ICollection as the generic version is not covariant and TValues could be LinearExpr, Variable, ...
if (values is ICollection collection)
{
list.Capacity = Math.Max(list.Count + collection.Count, list.Capacity);
}
}
#if NETFRAMEWORK
[MethodImpl(MethodImplOptions.AggressiveInlining)]
internal static bool TryDequeue<T>(this Queue<T> queue, out T value)
{
if (queue.Count > 0)
{
value = queue.Dequeue();
return true;
}
value = default;
return false;
}
#endif
}
// Holds a term (expression * coefficient)
public struct Term
{
public LinearExpr expr;
public double coefficient;
public Term(LinearExpr e, double c)
{
this.expr = e;
this.coefficient = c;
}
}
/**
* <summary>
* Holds a linear expression: <c>sum (ai * xi) + b</c>.
* </summary>
*/
public class LinearExpr
{
/** <summary> Creates <c>Sum(exprs)</c>.</summary> */
public static LinearExpr Sum(IEnumerable<LinearExpr> exprs)
{
return NewBuilder(0).AddSum(exprs);
}
/** <summary> Creates <c>Sum(exprs[i] * coeffs[i])</c>.</summary> */
public static LinearExpr WeightedSum(IEnumerable<LinearExpr> exprs, IEnumerable<int> coeffs)
{
return NewBuilder(0).AddWeightedSum(exprs, coeffs);
}
/** <summary> Creates <c>Sum(exprs[i] * coeffs[i])</c>.</summary> */
public static LinearExpr WeightedSum(IEnumerable<LinearExpr> exprs, IEnumerable<double> coeffs)
{
return NewBuilder(0).AddWeightedSum(exprs, coeffs);
}
/** <summary> Creates <c>expr * coeff</c>.</summary> */
public static LinearExpr Term(LinearExpr expr, double coeff)
{
return Prod(expr, coeff);
}
/** <summary> Creates <c>expr * coeff + offset</c>.</summary> */
public static LinearExpr Affine(LinearExpr expr, double coeff, double offset)
{
if (offset == 0)
{
return Prod(expr, coeff);
}
return NewBuilder().AddTerm(expr, coeff).Add(offset);
}
/** <summary> Creates a constant expression.</summary> */
public static LinearExpr Constant(double value)
{
return NewBuilder(0).Add(value);
}
/** <summary> Creates a builder class for linear expression.</summary> */
public static LinearExprBuilder NewBuilder(int sizeHint = 2)
{
return new LinearExprBuilder(sizeHint);
}
public static LinearExpr operator +(LinearExpr a, LinearExpr b)
{
return NewBuilder().Add(a).Add(b);
}
public static LinearExpr operator +(LinearExpr a, double v)
{
return NewBuilder().Add(a).Add(v);
}
public static LinearExpr operator +(double v, LinearExpr a)
{
return NewBuilder().Add(a).Add(v);
}
public static LinearExpr operator -(LinearExpr a, LinearExpr b)
{
return NewBuilder().Add(a).AddTerm(b, -1);
}
public static LinearExpr operator -(LinearExpr a, double v)
{
return NewBuilder().Add(a).Add(-v);
}
public static LinearExpr operator -(double v, LinearExpr a)
{
return NewBuilder().AddTerm(a, -1).Add(v);
}
public static LinearExpr operator *(LinearExpr a, double v)
{
return Prod(a, v);
}
public static LinearExpr operator *(double v, LinearExpr a)
{
return Prod(a, v);
}
public static LinearExpr operator -(LinearExpr a)
{
return Prod(a, -1);
}
public static BoundedLinearExpression operator ==(LinearExpr a, LinearExpr b)
{
return new BoundedLinearExpression(a, b, true);
}
public static BoundedLinearExpression operator !=(LinearExpr a, LinearExpr b)
{
return new BoundedLinearExpression(a, b, false);
}
public static BoundedLinearExpression operator ==(LinearExpr a, double v)
{
return new BoundedLinearExpression(a, v, true);
}
public static BoundedLinearExpression operator !=(LinearExpr a, double v)
{
return new BoundedLinearExpression(a, v, false);
}
public static BoundedLinearExpression operator >=(LinearExpr a, double v)
{
return new BoundedLinearExpression(v, a, Double.PositiveInfinity);
}
public static BoundedLinearExpression operator >=(double v, LinearExpr a)
{
return a <= v;
}
public static BoundedLinearExpression operator <=(LinearExpr a, double v)
{
return new BoundedLinearExpression(Double.NegativeInfinity, a, v);
}
public static BoundedLinearExpression operator <=(double v, LinearExpr a)
{
return a >= v;
}
public static BoundedLinearExpression operator >=(LinearExpr a, LinearExpr b)
{
return new BoundedLinearExpression(0, a - b, Double.PositiveInfinity);
}
public static BoundedLinearExpression operator <=(LinearExpr a, LinearExpr b)
{
return new BoundedLinearExpression(Double.NegativeInfinity, a - b, 0);
}
internal static LinearExpr Prod(LinearExpr e, double v)
{
if (v == 0)
{
return NewBuilder(0);
}
else if (v == 1)
{
return e;
}
else
{
return NewBuilder(1).AddTerm(e, v);
}
}
internal static double GetVarValueMap(LinearExpr e, SortedDictionary<int, double> dict, Queue<Term> terms)
{
double constant = 0;
double coefficient = 1;
LinearExpr expr = e;
terms.Clear();
do
{
switch (expr)
{
case LinearExprBuilder builder:
constant += coefficient * builder.Offset;
if (coefficient == 1)
{
foreach (Term sub in builder.Terms)
{
terms.Enqueue(sub);
}
}
else
{
foreach (Term sub in builder.Terms)
{
terms.Enqueue(new Term(sub.expr, sub.coefficient * coefficient));
}
}
break;
case Variable var:
if (dict.TryGetValue(var.Index, out var c))
{
dict[var.Index] = c + coefficient;
}
else
{
dict.Add(var.Index, coefficient);
}
break;
default:
throw new ArgumentException("Cannot evaluate '" + expr + "' in an expression");
}
if (!terms.TryDequeue(out var term))
{
break;
}
expr = term.expr;
coefficient = term.coefficient;
} while (true);
return constant;
}
}
/** <summary> A builder class for linear expressions.</summary> */
public sealed class LinearExprBuilder : LinearExpr
{
public LinearExprBuilder(int sizeHint = 2)
{
terms_ = new List<Term>(sizeHint);
offset_ = 0;
}
/** <summary> Adds <c>expr</c> to the builder.</summary> */
public LinearExprBuilder Add(LinearExpr expr)
{
return AddTerm(expr, 1);
}
/** <summary> Adds <c>constant</c> to the builder.</summary> */
public LinearExprBuilder Add(double constant)
{
offset_ += constant;
return this;
}
/** <summary> Adds <c>expr * coefficient</c> to the builder.</summary> */
public LinearExprBuilder AddTerm(LinearExpr expr, double coefficient)
{
terms_.Add(new Term(expr, coefficient));
return this;
}
/** <summary> Adds <c>sum(exprs)</c> to the builder.</summary> */
public LinearExprBuilder AddSum(IEnumerable<LinearExpr> exprs)
{
terms_.TryEnsureCapacity(exprs);
foreach (LinearExpr expr in exprs)
{
AddTerm(expr, 1);
}
return this;
}
/** <summary> Adds <c>sum(exprs[i] * coeffs[i])</c> to the builder.</summary> */
public LinearExprBuilder AddWeightedSum(IEnumerable<LinearExpr> exprs, IEnumerable<double> coefficients)
{
terms_.TryEnsureCapacity(exprs);
foreach (var p in exprs.Zip(coefficients, (e, c) => new { Expr = e, Coeff = c }))
{
AddTerm(p.Expr, p.Coeff);
}
return this;
}
/** <summary> Adds <c>sum(exprs[i] * coeffs[i])</c> to the builder.</summary> */
public LinearExprBuilder AddWeightedSum(IEnumerable<LinearExpr> exprs, IEnumerable<long> coefficients)
{
terms_.TryEnsureCapacity(exprs);
foreach (var p in exprs.Zip(coefficients, (e, c) => new { Expr = e, Coeff = c }))
{
AddTerm(p.Expr, p.Coeff);
}
return this;
}
/** <summary> Adds <c>sum(exprs[i] * coeffs[i])</c> to the builder.</summary> */
public LinearExprBuilder AddWeightedSum(IEnumerable<LinearExpr> exprs, IEnumerable<int> coefficients)
{
terms_.TryEnsureCapacity(exprs);
foreach (var p in exprs.Zip(coefficients, (e, c) => new { Expr = e, Coeff = c }))
{
AddTerm(p.Expr, p.Coeff);
}
return this;
}
public override string ToString()
{
string result = "";
foreach (Term term in terms_)
{
bool first = String.IsNullOrEmpty(result);
if (term.expr is null || term.coefficient == 0)
{
continue;
}
if (term.coefficient == 1)
{
if (!first)
{
result += " + ";
}
result += term.expr.ToString();
}
else if (term.coefficient > 0)
{
if (!first)
{
result += " + ";
}
result += String.Format("{0} * {1}", term.coefficient, term.expr.ToString());
}
else if (term.coefficient == -1)
{
if (!first)
{
result += String.Format(" - {0}", term.expr.ToString());
}
else
{
result += String.Format("-{0}", term.expr.ToString());
}
}
else
{
if (!first)
{
result += String.Format(" - {0} * {1}", -term.coefficient, term.expr.ToString());
}
else
{
result += String.Format("{0} * {1}", term.coefficient, term.expr.ToString());
}
}
}
if (offset_ > 0)
{
if (!String.IsNullOrEmpty(result))
{
result += String.Format(" + {0}", offset_);
}
else
{
result += String.Format("{0}", offset_);
}
}
else if (offset_ < 0)
{
if (!String.IsNullOrEmpty(result))
{
result += String.Format(" - {0}", -offset_);
}
else
{
result += String.Format("{0}", offset_);
}
}
return result;
}
public double Offset
{
get {
return offset_;
}
}
public List<Term> Terms
{
get {
return terms_;
}
}
private double offset_;
private List<Term> terms_;
}
/**
* <summary>
* Holds a variable.
* </summary>
* <remarks>
* This class must be constructed from the CpModel class.
* </remarks>
*/
public class Variable : LinearExpr
{
public Variable(ModelBuilderHelper helper, double lb, double ub, bool isIntegral, string name)
{
helper_ = helper;
index_ = helper_.AddVar();
helper_.SetVarLowerBound(index_, lb);
helper_.SetVarUpperBound(index_, ub);
helper_.SetVarIntegrality(index_, isIntegral);
if (!string.IsNullOrEmpty(name))
{
helper_.SetVarName(index_, name);
}
}
public Variable(ModelBuilderHelper helper, int index)
{
helper_ = helper;
index_ = index;
}
/** Returns the index of the variable in the underlying ModelBuilderHelper. */
public int Index
{
get {
return index_;
}
}
/** The underlying VariableProto. */
public ModelBuilderHelper Helper
{
get {
return helper_;
}
}
/** Returns the domain of the variable. */
public double LowerBound
{
get {
return helper_.VarLowerBound(index_);
}
set {
helper_.SetVarLowerBound(index_, value);
}
}
public double UpperBound
{
get {
return helper_.VarUpperBound(index_);
}
set {
helper_.SetVarUpperBound(index_, value);
}
}
public override string ToString()
{
string name = helper_.VarName(index_);
return string.IsNullOrEmpty(name) ? String.Format("var_{0}", index_) : name;
}
/** Returns the name of the variable given upon creation. */
public string Name
{
get {
return helper_.VarName(index_);
}
}
protected readonly int index_;
protected ModelBuilderHelper helper_;
}
/**
* <summary>
* Holds a linear constraint: <c> expression ∈ domain</c>
* </summary>
* <remarks>
* This class must be constructed from the CpModel class or from the comparison operators.
* </remarks>
*/
public sealed class BoundedLinearExpression
{
public enum Type
{
BoundExpression,
VarEqVar,
VarDiffVar,
VarEqCst,
VarDiffCst,
}
public BoundedLinearExpression(double lb, LinearExpr expr, double ub)
{
left_ = expr;
right_ = null;
lb_ = lb;
ub_ = ub;
type_ = Type.BoundExpression;
}
public BoundedLinearExpression(LinearExpr left, LinearExpr right, bool equality)
{
left_ = left;
right_ = right;
lb_ = 0;
ub_ = 0;
type_ = equality ? Type.VarEqVar : Type.VarDiffVar;
}
public BoundedLinearExpression(LinearExpr left, double v, bool equality)
{
left_ = left;
right_ = null;
lb_ = v;
ub_ = 0;
type_ = equality ? Type.VarEqCst : Type.VarDiffCst;
}
bool IsTrue()
{
if (type_ == Type.VarEqVar)
{
return (object)left_ == (object)right_;
}
else if (type_ == Type.VarDiffVar)
{
return (object)left_ != (object)right_;
}
return false;
}
public static bool operator true(BoundedLinearExpression ble)
{
return ble.IsTrue();
}
public static bool operator false(BoundedLinearExpression ble)
{
return !ble.IsTrue();
}
public override string ToString()
{
switch (type_)
{
case Type.BoundExpression:
return String.Format("{0} <= {1} <= {2}", lb_, left_, ub_);
case Type.VarEqVar:
return String.Format("{0} == {1}", left_, right_);
case Type.VarDiffVar:
return String.Format("{0} != {1}", left_, right_);
case Type.VarEqCst:
return String.Format("{0} == {1}", left_, lb_);
case Type.VarDiffCst:
return String.Format("{0} != {1}", left_, lb_);
default:
throw new ArgumentException("Wrong mode in BoundedLinearExpression.");
}
}
public static BoundedLinearExpression operator <=(BoundedLinearExpression a, double v)
{
if (a.CtType != Type.BoundExpression || a.Ub != Double.PositiveInfinity)
{
throw new ArgumentException("Operator <= not supported for this BoundedLinearExpression");
}
return new BoundedLinearExpression(a.Lb, a.Left, v);
}
public static BoundedLinearExpression operator >=(BoundedLinearExpression a, double v)
{
if (a.CtType != Type.BoundExpression || a.Lb != Double.NegativeInfinity)
{
throw new ArgumentException("Operator >= not supported for this BoundedLinearExpression");
}
return new BoundedLinearExpression(v, a.Left, a.Ub);
}
public LinearExpr Left
{
get {
return left_;
}
}
public LinearExpr Right
{
get {
return right_;
}
}
public double Lb
{
get {
return lb_;
}
}
public double Ub
{
get {
return ub_;
}
}
public Type CtType
{
get {
return type_;
}
}
private LinearExpr left_;
private LinearExpr right_;
private double lb_;
private double ub_;
private Type type_;
}
} // namespace Google.OrTools.ModelBuilder