Project selection with discounted returns and multiple constraints

Article Abstract:

The problem of choosing a subset of N projects under multiple sequence-dependent resource constraints is considered. Known as the project selection problem, it is a nonlinear (0-1) integer problem that seeks to maximize the net present value of total returns. To solve it, two heuristics that converge to near solutions within O(N3K) and O(N4K) time are described. The first refines a feasible solution derived by a greedy procedure while the second combines it with steps zero and one of the M heuristic.

Case studies, Integer programming

---

Stock cutting to minimize cutting length

Article Abstract:

The problem of minimizing the cutting sequence length or total time required for making guillotine cuts of a given convex shape from a given piece of material of a different convex design is investigated. Specifically, a dynamic programming-based polynomial approximation for deriving optimal solutions in the algebraic extension of the input data field is introduced. Its application to the case of non-convex polygons is also studied.

Cases, Cutting, Stochastic approximation

---

Similar abstracts:

• Abstracts: European banks wrestle with costs, customers, and competition. European banks face technology and cross border challenges
• Abstracts: Option B: education reform may cross off multiple- choice tests. Underground lifeline
• Abstracts: Asian invasion; Hong Kong retailers lead the charge into Japan. Shaken up
• Abstracts: Thailand's defense minister strengthens position with picks for military posts. Note auction in Thailand is a step toward establishing rate benchmarks
• Abstracts: Assessing priority weights from subsets of pairwise comparisons in multiple criteria optimization problems. An extended DEA model: appending an additional input to make all DMUs at least weakly efficient

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