tests/general_tests/linprog/linprog_zeros1.sce


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

// Check for elements all zeros
c=[-1,-1/3]'
A=[1,1;1,1/4;1,-1;-1/4,-1;-1,-1;-1,1]
b=[2,1,2,1,-1,2]
Aeq=[1,1/4]
beq=[1/2]

//Output
//Optimal Solution.
// lambda  =
// 
//   reduced_cost: 0
//   ineqlin: 0
//   eqlin: [0x0 constant]
// output  =
// 
//   Iterations: 4
//   constrviolation: 0
// exitflag  =
// 
//    0.  
// fopt  =
// 
//    0.  
// xopt  =
// 
//    0. 

[xopt,fopt,exitflag,output,lambda]=linprog(0,0,0)