A framework for demand point and solution space aggregation analysis for location models

Article Abstract:

By minimizing some location objective function subject to upper bounds on other location constraints many location problems can be formulated. A method to solve a relaxation and a restriction of the aggregated problem to obtain lower and upper bounds on the optimal value of the actual problem is explained.

Research and Development in the Social Sciences and Humanities, Management & Information Science, Management Science, Industrial locations, Industrial location

---

Simple probability models for project contracting

Article Abstract:

Price setting process through sealed bids mechanism for subcontracts of project activities is analyzed. A parsimonious stochastic model is used to compare expected price bids for three types of subcontracts, fixed price, cost plus, and menu contracts.

United States, Management dynamics, Management consulting services, Pricing Policy, Contract Administration, Management, Usage, Pricing, Contracts, Company business management, Subcontracting, Stochastic processes, Contract management, Product price

---

Similar abstracts:

• Abstracts: Scheduling with monotonous earliness and tardiness penalties. Earliness-tardiness production planning for just-in-time manufacturing: a unifying approach by goal programming
• Abstracts: An iterative algorithm for scheduling UET tasks with due dates and release times. Insertion techniques for static and dynamic resource-constrained project scheduling
• Abstracts: Single machine scheduling subject to deadlines and resource dependent processing times. Single machine batch scheduling with jointly compressible setup and processing times
• Abstracts: Two-machine flow shop scheduling with two criteria: maximum earliness and makespan. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
• Abstracts: State realization with exogenous variables - a test on blast furnace data. A multipurpose parallel genetic hybrid algorithm for non-linear non-convex programming problem

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