### Table 5. Computational results for the general case: f(y) = kya/b.

in A STRONG CONIC QUADRATIC REFORMULATION FOR MACHINE-JOB ASSIGNMENT WITH CONTROLLABLE PROCESSING TIMES

2007

"... In PAGE 12: ... In Table 4 we report average size of the conic formulations for instances with 200 jobs. We report the summary results for the rational exponent case in Table5 . As... ..."

### Table 1: Summary of applications of various configurations of conics

2004

"... In PAGE 6: ... The algorithms are simple and do not require correspondences of a large number of conics or the solution of multivariate polynomial equations. A summary of the results is shown in Table1 . Extensions to these methods which handle over determined sets of equations, obtained due to the presence of more than two coplanar conics, need to be explored.... ..."

Cited by 4

### Table 2: Duality for closed conic convex programs

"... In PAGE 23: ...d #03 = inf 8 #3E #3C #3E : s 5 #0C #0C #0C #0C #0C #0C #0C 2 6 4 0 1 0 1 s 2 s 5 = p 2 0 s 5 = p 2 0 3 7 5 #17 0 9 #3E = #3E ; = 1: Finally, the possibility of the entries in Table2 where weak infeasibility is not involved, can be demonstrated by a 2-dimensional linear programming problem: Example 5 Let n =2,c2#3C 2 ,K=K #03 =#3C 2 + and A = f#28x 1 ;x 2 #29jx 1 =0g; A ? =f#28s 1 ;s 2 #29js 2 =0g: We see that #28P#29 is strongly feasible if c 1 #3E 0,weakly feasible if c 1 =0and strongly infeasible if c 1 #3C 0. Similarly, #28D#29 is strongly feasible if c 2 #3E 0,weakly feasible if c 2 =0and strongly infeasible if c 2 #3C 0.... In PAGE 27: ... #0F The regularizedprogram CP#28b; c; A; K 0 #29 is dual strongly infeasible if and only if F D = ;. Combining Theorem 8 with Table2 , we see that the regularized conic convex program is in perfect duality: Corollary 7 Assume the same setting as in Theorem 8. Then there holds #0F If d #03 = 1, then the regularized primal CP#28b; c; A; K 0 #29 is either infeasible or unbounded.... ..."

### Table 3: Material properties for conical extrusion

### Table I. Basic terms and notation for linear (LP), semidefinite (SDP), and conic programming. Term LP SDP Conic Notation

2005

Cited by 11

### Table 3: The computed for each pair of conics Ci and C0 j, Ci is a conic of the rst image and C0 j a conic of the second image.

1995

"... In PAGE 16: ... The closeness of the set of the conics generated in the second image can be deduced from Figure 3 in which four of them are displayed. Table3 shows the computed for each pair of conics. The absolute value of increases with the increasing discrepancy of conic pairs.... ..."

Cited by 4

### Table 5: The reconstruction results of the three conics of the wooden house images.

1995

"... In PAGE 18: ... The raw entries correspond to the conics of the rst image and the column entries to those of the second image. The reconstruction results are illustrated in Table5 . To have an idea of the reconstruction results, each plane equation is put under the form (nT; ?d) where nT is the unit normal direction vector of the plane and d is the distance of the origin to the plane.... ..."

Cited by 4

### TABLE V The reconstruction results of the three conics of the wooden house images.

1996

Cited by 29

### TABLE VII The reconstruction results of the three conics of the breakfast images.

1996

Cited by 29