$8.00

	Digital PC System Software
	Digital PC System Solutions
	Digital Warranty and Service information
	Digital PC 3500/5510 System Reference

	Windows 95
	Windows NT

$8.00

two Diskettes

ASMP - This program solves assignment problems with up to many objects and many tasks.  The size of problems solved by this program depends on the memory in"
your computer.  Tasks may represent jobs while the objects may indicate workers.  The problem criteria can be minimized or maximized, depending on"
the cost/profit coefficients corresponding to each object and task assignment. 

ILP -   This program solves mixed integer linear programming problems with up to many variables (not including slack/artificial variables) and constraints (not including bounds) by using the branch-and-bound method.  

LP - This program solves linear programming problems with up to many variables (not including slack/artificial variables) and constraints.  The size of the problems solved by this program depends on the memory in your computer.

NET This program contains three well-known pure network algorithms: the shortest route, the maximal flow, and the minimal spanning tree algorithms. NET requires a network which contains linked nodes to represent the problem."
The shortest route algorithm finds the shortest route from a start node to any other node on the network; the maximal flow algorithm finds the maximum flow from a source node to a sink node; and the minimal spanning tree"
algorithm finds the minimum total length of branches that link all nodes.

TRP -  This program solves transportation/transshipment problems.  A source or supply point is defined to have only outgoing flows; a destination or sink point is defined to have only incoming flows; while a transshipment point is"
defined to have both.  The size of problems solved by this program depends on the memory in your computer.  The capacities or demands are assumed to be integer valued; the cost or profit coefficients are assumed to be real valued.

CPM - This program analyzes projects with hundreds of activities using the Critical Path Method (CPM).  Each activity is assumed to have a deterministic duration and cost.  You can perform `crash' analysis by entering crash times and costs.  

DP - This program contains three well-known dynamic programming algorithms: the stagecoach problem, the knapsack problem, and a production and inventory control problem.  DP can solve these problems with up to tens of stages and tens of states for each stage. 
The solution procedure uses backward recursion from the last stage- that is, the stage closest to the destination -to the first stage.

PERT - This program analyzes project networks with hundreds of activities using the Program Evaluation and Review Technique (PERT).  The activity durations are assumed to be beta distributed with three time estimates---optimistic, most likely, and pessimistic.			

Item Specifics - Textbooks, Education 
Publisher: Microsoft Pr
ISBN: 0735605556
Publication Year: 1999

Category: 
Computers & Internet

Good condition book for those who really want to exploit MS Office. 
Includes a CD (CD package is unopened). Original price $59.99. 
I used this in support of some development activities. The back of the book says:

"Roll out, support and optimize Microsoft's next-generation Office 
suite with expertise from those who know the technology best - 
the Microsoft office 2000 product team. This powerhouse reference packs 800+ pages 
of detailed technical drill-down plus exclusive tools and utilities on CD - all designed to 
help you save time, reduce support costs, and lower total cost of ownership (TCO).

Great gift or stocking stuffer for someone interested in snow skiing. 

Also, have same product on 5.25 inch disks (two disks).