## Computing Methods in Optimization Problems: 2; PapersLotfi Asker Zadeh, Lucien W. Neustadt, A. V. Balakrishnan |

### What people are saying - Write a review

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

### Contents

Nuclear Reactor Systems and their Associated Variational | 13 |

Optimal Solution for a Gass of Assignment and Transportation | 35 |

Penalty Functions and Nonconvex Continuous Optimal Control | 55 |

Copyright | |

21 other sections not shown

### Other editions - View all

### Common terms and phrases

adjoint admissible algorithm allocation applied approximation assignment assume assumption chromosomes coefficients conjugate gradient conjugate gradient method consider constraints convergence convex convex function convex set corresponding cost function defined definition denote determined differential equations dimensional discontinuous Dynamic Programming elements estimate example exists feasible finite number formulate given gradient method graph theory Hence Hilbert space Huffman Coding initial input integral iteration labels linear program mapping Mathematical matrix maximum minimization minimum neutron Newton-Raphson method Newton's method nodes obtained optimal control problem optimal path optimization problem paper parameters penalty functions procedure proof properties pseudo-manifold quadratic quadratic assignment problem reactor satisfy sequence shown simplex solution solving space Sperner's Lemma step subdivision subproblem subset synthesis Table technique terminal Theorem theory tion trajectory trial functions variable vector vertex vertices zero