A weakly monotonic backward induction algorithm on finite bounded subsets of vector lattices

Dragut, A.B.

doi:10.1016/j.cam.2003.11.007

Search citation statements

Order By: Relevance

Paper Sections

Select...

Data Points1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2008

2011

Publication Types

Select...

Other2

Article1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The process determines the performance characteristics of the new product, and optimal control policies have been devised for some of its particular cases, as in Dragut (2004). The computational efficiency of the representation model exposed in this paper led to the possibility of obtaining a variety of experimental results, enriching the insights provided by the analytical properties of the optimal policies.…”

Section: Data Pointsmentioning

confidence: 97%

A representation model for the solving-time distribution of a set of design tasks in new product development (NPD)

Dragut

Bertrand

2008

European Journal of Operational Research

View full text Add to dashboard Cite

Section: Data Pointsmentioning

confidence: 97%

A representation model for the solving-time distribution of a set of design tasks in new product development (NPD)

Dragut

Bertrand

2008

European Journal of Operational Research

View full text Add to dashboard Cite

Structured Optimal Policies forMarkov Decision Processes: Lattice Programming Techniques

Dragut

2011

Wiley Encyclopedia of Operations Research and Management Science

View full text Add to dashboard Cite

The structure (monotonicity, convexity, multimodularity, directional convexity and K‐convexity) of optimal policies is used to reduce the exponential growth with respect to the size of a sequential decision process and to compare different control systems. Monotonicity can be derived using Tattice programming techniques, sample path analysis or discrete events dynamic programming. We cover the discrete and continuous‐time MDP and POMDP models with Borel, countable‐and finite‐state and action spaces, as well nonstationary ones. Applications include admission/control of (networks of) queues, maintenance, inventory, production and innovation.

show abstract

A Markovian approach to the mathematical control of NPD projects

Dragut¹

2003

View full text Add to dashboard Cite

A weakly monotonic backward induction algorithm on finite bounded subsets of vector lattices

Cited by 3 publications

References 14 publications

A representation model for the solving-time distribution of a set of design tasks in new product development (NPD)

A representation model for the solving-time distribution of a set of design tasks in new product development (NPD)

Structured Optimal Policies forMarkov Decision Processes: Lattice Programming Techniques

A Markovian approach to the mathematical control of NPD projects

Contact Info

Product

Resources

About