An algorithm for generating efficient solutions of multiobjective dynamic programming problems

Article Abstract:

The development of an algorithm for generating efficient solutions of multiobjective mathematical programming problem is examined. Optimality in dynamic programming is set as a condition for the development of such solutions and extends its nonlinear counterpart by removing convexity conditions. It is shown that a generalized functional equation can be derived for dynamic programming.

Optimization theory, Mathematical programming

---

Optimal stopping problem with double reservation value property

Article Abstract:

A case study of Ford and Daewoo deal is presented. Dynamic programming models to examine Double Reservation Value property of optimal stopping problem with recall cost and uncertain recall are presented.

Japan, Science & research, Research, Analysis, Acquisitions and mergers, Optimal stopping (Mathematical statistics)

---

Similar abstracts:

• Abstracts: Solutions for the constrained dynamic facility layout problem. A nonlinear optimization approach for solving facility layout problems
• Abstracts: Economic investment times for capacity expansion problems. A graph-theoretic heuristic for designing loop-layout manufacturing systems
• Abstracts: Design of tool magazine and operational areas for a multi-tool machine

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.