## Design of survey networks using non-linear programming |

### From inside the book

4 pages matching **probability density function** in this book

#### Page iv

Where's the rest of this book?

Results 1-3 of 4

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Development of Statistical Methods Needed | 8 |

Control Surveys 17 | 17 |

Distances | 29 |

Copyright | |

1 other sections not shown

### Common terms and phrases

accuracy added adjusted directions approximation artificial variables assumption AX+V=L basic feasible solution basic solution Chapter coefficients concave functions constant constraint equations converged convex combination convex functions convex set coordinates covariance matrix Creusen curve defined derivative determined developed diagonal matrix direction observations discussion distance measured distance observation equal error ellipse extreme point finite number geodetic control networks given global optimum inverse iteration least squares estimator Linear Equation linear manifold linear programming problem main diagonal elements maximum likelihood estimate minimize minimum variance multivariate normal distribution non-linear programming problem non-negative normal distribution number of pointings objective function Observation Equations obtained off-diagonal elements positive definite probability density function probability function probable error quadratic form random variable restricted basis entry sample problems separable programming set of directions set of feasible simplex algorithm simplex method simply singular solution set solved station adjustment statistical subspace theory triangulation variance-covariance matrix vector yield zero