Skip to main content

Formulating Adjacency Constraints in Linear Optimization Models for Scheduling Projects in Tactical Planning

Buy Article:

$29.50 plus tax (Refund Policy)


Models for scheduling projects in tactical planning often must contain relationships that restrict activities on adjacent lands. Conventional formulations of these relationships require large numbers of constraints. Minimizing the number of constraints permits modeling larger areas when faced with software and hardware limitations on number of constraints. This paper presents an approach for efficiently formulating adjacency relationships in mixed-integer programming models. The approach typically results in one-half to one-quarter of the number of equations required by formulations used in the past. For. Sci. 37(5):1283-1297.

Keywords: Dispersion constraints; linear programming; site-specific optimization; site-specific planning

Document Type: Journal Article

Affiliations: Operations Research Analyst, Pacific Southwest Research Station, Forest Service, U.S. Department of Agriculture, 1960 Addison St., Berkeley, CA 94704

Publication date: November 1, 1991

More about this publication?
  • Membership Information
  • ingentaconnect is not responsible for the content or availability of external websites

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more
Real Time Web Analytics