|
BACK TO 100 examples in Business, Operations and
Engineering. |
|
Do it once, do it right, and do it now.
|
|
Back to Lawson Computing Homepage
|
Apply as needed,
when needed. |
Management Science Projects (Intense Models) Terms and Methods.
LINEAR PROGRAMMING
Requirements of a linear programming model.
assumptions of linear programming.
Linear programming beginnings.
Formulating linear programming
Graphical solution to above.
ISO PROFIT LINE solution method.
THE CORNER POINT SOLUTION METHOD.
Solving Minimization problems.
Using the corner point for a solution.
Using the ISO COST APPROACH.
Summary of the graphical solution method.
Special issues in linear programming.
INFEASIBILITY.
UNBOUNDEDNESS.
REDUNDANCY.
ALTERNATIVE OPTIMAL SOLUTIONS.
TERMS.
LINEAR PROGRAMMING.
MATHEMATICAL PROGRAMMING.
OBJECTIVE FUNCTION.
CONSTRAINT.
INEQUALITY.
PRODUCT MIX PROBLEM.
NON NEGATIVITY CONSTRAINTS.
FEASIBLE REGION.
FEASIBLE SOLUTION.
INFEASIBLE SOLUTION.
ISO-PROFIT LINE.
CORNER POINT OR EXTREME POINT.
CORNER POINT METHOD.
SIMULTANEOUS EQUATION METHOD.
ISO COST LINE.
INFEASIBILITY.
UNBOUNDEDNESS.
REDUNDANCY.
ALTERNATIVE OPTIMAL SOLUTION.
LINEAR PROGRAMMING APPLICATIONS.
MARKETING SELECTION.
MARKETING RESEARCH.
MANUFACTURING APPLICATIONS.
PRODUCTION SCHEDULING.
DOUBLE SUB SCRIPTED VARIABLES.
INVENTORY CONSTRAINTS.
EMPLOYEE SCHEDULING APPLICATIONS.
ASSIGNMENT PROBLEMS.
LABOR PLANNING.
CREW OPTIMIZING.
FINANCIAL APPLICATIONS.
TRANSPORTATION APPLICATIONS.
INGREDIENT BLENDING APPLICATIONS.
INGREDIENT MIX AND BLENDING PROBLEMS.
SIMPLEX METHOD
INTERESTING NOTES
LINEAR PROGRAMMING: SENSITIVITY ANALYSIS AND DUALITY.
SENSITIVITY ANALYSIS.
CHANGES IN THE OBJECTIVE FUNCTION COEFFICIENT.
CHANGES IN THE TECHNOLOGICAL COEFFICIENT.
CHANGES IN THE RESOURCES OR RIGHT SIDE VALUES.
RIGHT HAND SIDE RANGING.
THE DUAL IN LINEAR PROGRAMMING.
DUAL FORMULATION PROCEDURES.
COMPUTATIONAL ADVANTAGE OF THE DUAL.
TERMS.
SENSITIVITY ANALYSIS.
RANGE OF INSIGNIFICANCE.
RANGE OF OPTIMALITY.
TECHNOLOGICAL COEFFICIENTS.
SHADOW PRICES.
RIGHT HAND SIDE RANGES.
PRIMARY DUAL RELATIONSHIP.
TRANSPORTATION ASSIGNMENT PROBLEMS.
INTRODUCTION.
TRANSPORTATION MODEL.
ASSIGNMENT MODEL.
SPECIAL PURPOSE ALGORITHMS.
SETTING UP TRANSPORTATION PROBLEM.
INITIAL SOLUTION.
STEPPING STONE METHOD..
TESTING THE SOLUTION
KEY IDEA.
IMPROVED SOLUTION.
KEY IDEAS.
MODI METHODS.
MODI METHOD.~APPROACH.
SOLVING WITH MODI.
KEY NOTE.
VOGEL’S APPROXIMATION METHOD.
UNBALANCED TRANSPORTATION PROBLEMS.
DEMAND LESS THAN SUPPLY.
DEMAND GREATER THAN SUPPLY.
TRANSPORTATION PROBLEMS.
INITIAL SOLUTION.
MORE THAN ONE OPTIMAL SOLUTION.
COMPUTER SOLUTIONS.
FACILITY LOCATION ANALYSIS.
APPROACH OF THE ASSIGNMENT MODEL.
THE HUNGARIAN METHOD.
STEPS.
MAXIMIZING ASSIGNMENT PROBLEMS.
KEY IDEA.
TERMS
INTEGER AND GOAL PROGRAMMING.
INTEGER PROGRAMMING.
THE CUTTING PLANE METHOD.
TYPES OF INTEGER PROBLEMS.
MIXED INTEGER PROGRAMMING PROBLEM.
0 DASH 1 INTEGER PROBLEM
BRANCH AND BOUND METHOD.
DECISION SUPPORT SYSTEMS. ASSIGNING CLASSES.
GOAL PROGRAMMING.
AN EXTENSION TO EQUALLY IMPORTANT MULTIPLE GOALS.
RANKING GOALS.
GOAL PROGRAMMING GRAPHICALLY.
USING AB-QM TO SOLVE.
NONLINEAR PROGRAMMING.
A NONLINEAR OBJECTIVE FUNCTION.
TERMS.
INTEGER PROGRAMMING.
CUTTING PLANE METHOD.
ZERO ONE INTEGER PROGRAMMING.
BRANCH AND BOUND METHOD.
GOAL PROGRAMMING.
SATISFICING.
DEVIATIONAL VARIABLES.
NONLINEAR PROGRAMMING.
NETWORK MODELS.
MINIMAL SPANNING TREE TECHNIQUE.
MAXIMAL FLOW TECHNIQUE.
KEY IDEA.
SHORTEST ROUTE
TECHNIQUE.
COMPUTER TO SOLVE NETWORK PROBLEMS.
USING STORM’S DISTANCE NETWORK MODEL.
SUMMARY.
TERMS.
MINIMAL SPANNING TREE TECHNIQUE.
MAXIMAL FLOW TECHNIQUE.
SHORTEST ROUTE TECHNIQUE.
PROJECT MANAGEMENT
FRAMEWORK OF PERT AND CPM.
PERT.
DRAWING THE PERT NETWORK.
ACTIVITY TIMES.
OPTIMISTIC.
PESSIMISTIC.
MOST LIKELY.
CRITICAL PATH.
KEY IDEA.
SLACK IN CRITICAL PATH COMPUTATIONS.
KEY IDEA.
PROBABILITY OF PROJECT COMPLETION.
DUMMY ACTIVITIES IN PERT.
PERT / COST.
PLANNING AND SCHEDULING PROJECT COST:
DEVELOPING WEEKLY BUDGET.
BUDGETING WITH LATEST START TIMES.
MONITORING AND CONTROLLING PROJECT COSTS.
CRITICAL PATH METHOD.
PROJECT CRASHING WITH CPM.
KEY IDEA.
PROJECTING WITH LINEAR PROGRAMMING.
OBJECTIVE FUNCTION.
CRASH TIME CONSTRAINTS.
PROJECT COMPLETION CONSTRAINT.
CONSTRAINTS DESCRIBING THE NETWORK.
USING THE COMPUTER TO SOLVE NETWORK PROBLEMS.
USING STORM FOR PROJECT MANAGEMENT.
SUMMARY.
TERMS
PERT.
ACTIVITY.
EVENT.
IMMEDIATE PREDECESSOR.
NETWORK.
ACTIVITY TIME ESTIMATES.
OPTIMISTIC TIME.
PESSIMISTIC TIME.
MOST LIKELY TIME.
BETA PROBABILITY DISTRIBUTION.
EXPECTED ACTIVITY TIME.
VARIANCE OF ACTIVITY COMPLETION TIME.
EARLIEST START TIME.
EARLIEST FINISH TIME.
LATEST START TIME.
LATEST FINISH TIME.
FORWARD PASS.
BACKWARD PASS.
SLACK TIME.
CRITICAL PATH.
CRITICAL PATH ANALYSIS.
DUMMY PATH ACTIVITY.
PERT/COST.
CPM.
CRASHING.
INVENTORY MODELS. INTRODUCTION.
INVENTORY CONTROL.
DECOUPLING FUNCTION.
IRREGULAR SUPPLY AND DEMAND.
QUANTITY DISCOUNTS.
STOCKOUTS AND SHORTAGES.
THE INVENTORY DECISION.
KEY IDEA.
EOQ.
INVENTORY COST.
ECONOMIC ORDER QUANTITY.
PURCHASING COST OF INVENTORY ITEMS.
REORDER POINT. ROP.
KEY IDEA.
FIXED PERIOD INVENTORY CONTROL SYSTEM.
DETERMINING THE OPTIMAL NUMBER OF ORDERS PER YEAR.
DAYS BETWEEN ORDERS.
SENSITIVITY ANALYSIS.
SUMMARY.
TERMS.
EOQ.
AVERAGE INVENTORY.
REORDER POINT.
LEAD TIME.
SENSITIVITY ANALYSIS.
SOLVED PROBLEM.
INVENTORY CONTROL MODELS
EOQ WITHOUT THE INSTANTANEOUS RECEIPT ASSUMPTION.
ANNUAL CARRYING COST.
ANNUAL ORDERING COST.
OPTIMAL ORDER QUANTITY
QUANTITY DISCOUNT MODELS.
PLANNED SHORTAGES.
OPTIMAL ORDER AND BACK ORDER LEVELS.
SAFETY STOCK.
SAFETY STOCK WITH KNOWN
SAFETY STOCK WITH UNKNOWN
ABC ANALYSIS AND JOINT ORDERING.
ABC ANALYSIS.
JOINT ORDERING.
DEPENDENT DEMAND..
MRP.
THE MATERIAL STRUCTURE TREE.
GROSS AND NET REQUIREMENTS PLAN.
TWO OR MORE END PRODUCTS.
THE KANBAN SYSTEM.
USING JUST IN TIME INVENTORY.
COMPUTER , INVENTORY CONTROL PROBLEMS.
AB-QM IN INVENTORY CONTROL.
AB-QM IN QUANTITY DISCOUNT.
AB-QM IN ABC ANALYSIS.
USE OF STORM
SUMMARY.
TERMS.
INSTANTANEOUS INVENTORY RECEIPT.
PRODUCTION MODEL RUN.
ANNUAL SETUP COST ~ ORDER COST YEARLY.
QUANTITY DISCOUNT.
PLANNED SHORTAGES.
BACK ORDERING COST PER UNIT PER YEAR.
SAFETY STOCK.
STOCKOUT.
SAFETY STOCK WITH KNOWN STOCKOUT COSTS.
SAFETY STOCK WITH UNKNOWN STOCKOUT COSTS.
SERVICE LEVEL.
ABC ANALYSIS.
JOINT ORDERING.
MATERIAL REQUIREMENTS PLANNING.
JUST IN TIME INVENTORY. JIT.
KANBAN.
SOLVED PROBLEMS.
QUEUING THEORY.
WAITING LINE COSTS.
CHARACTERISTICS
ARRIVAL CHARACTERISTICS.
SIZE OF THE CALLING POPULATION.
PATTERN ARRIVALS AT THE SYSTEM.
BEHAVIOR OF THE ARRIVALS.
WAITING LINE CHARACTERISTICS.
SERVICE FACILITY CHARACTERISTICS.
BASIC QUEUING SYSTEM CONFIGURATIONS.
SERVICE TIME DISTRIBUTION.
STYLES OF QUEUING CONFIGURATIONS.
SINGLE CHANNEL QUEUING MODEL
ASSUMPTIONS OF THE MODEL.
QUEUING EQUATIONS.
MULTIPLE CHANNEL QUEUING MODEL
MULTI CHANNEL QUEUING MODEL.
USE OF WAITING LINE TABLES.
CONSTANT SERVICE TIME MODULE
SUMMARY.
TERMS.
WAITING LINE.
QUEUING THEORY.
SERVICE COST.
WAITING COST.
OPERATING CHARACTERICS.
CALLING POPULATION.
UNLIMITED OR INFINITE POPULATION.
LIMITED OR FINITE POPULATION.
POISSON DISTRIBUTION.
BALKING.
RENEGING.
LIMITED QUEUE LENGTH.
UNLIMITED QUEUE LENGTH.
QUEUE DISCIPLINE.
FIFO.
SINGLE CHANNEL QUEUING MODEL.
MULTIPLE QUEUING CHANNEL SYSTEM.
SINGLE PHASE SYSTEM.
MULTIPHASE SYSTEM.
NEGATIVE EXPONENTIAL PROBABILITY DISTRIBUTION.
M/M/1.
UTILIZATION FACTOR.
M/M/m.
WAITING LINE TABLES.
M/D/1.
COMPUTER SIMULATION.
SIMULATION.
ADVANTAGES AND DISADVANTAGES
MONTE CARLO SIMULATION.
ESTABLISHING DISTRIBUTIONS.
BUILDING A CUMULATIVE PROBABILITY DISTRIBUTION FOR EACH VARIABLE.
SETTING RANDOM NUMBER INTERVALS.
GENERATING RANDOM NUMBERS.
SIMULATION THE EXPERIMENT.
SIMULATION AND INVENTORY ANALYSIS.
ANALYZING THE HARDWARE’S COSTS.
A COMPUTER SIMULATION
SIMULATION OF QUEUING PROBLEM.
COST ANALYSIS OF THE SIMULATION.
OTHER TYPES OF SIMULATION MODELS.
OPERATIONAL GAMING.
SYSTEM SIMULATION.
SUMMARY.
TERMS.
SIMULATION.
MONTE CARLO SIMULATION.
RANDOM NUMBER.
RANDOM NUMBER INTERVAL.
FLOW DIAGRAM OR FLOWCHART.
OPERATION GAMING.
SYSTEM SIMULATION.
GENERAL PURPOSE LANGUAGE.
SPECIAL PURPOSE SIMULATION LANGUAGES.
FUNDAMENTALS OF DECISION ANALYSIS.
SIX STEPS IN DECISION ANALYSIS.
DECISION MAKING UNDER RISK.
EXPECTED MONETARY VALUE.
KEY IDEA.
EXPECTED VALUE OF PERFECT INFORMATION.
OPPORTUNITY LOSS.
UNCERTAINTY.
MAXIMAX.
MAXIMIN.
EXAMPLE
EQUALLY LIKELY (LAPLACE)
CRITERION OR REALISM (HURWICZ CRITERION)
MINIMAX
USING THE COMPUTER
SUMMARY.
TERMS.
ALTERNATIVE.
CONDITIONAL VALUE
CERTAINTY.
MONETARY VALUE.
VALUE OF PERFECT INFORMATION.
VALUE WITH PERFECT INFORMATION.
OPPORTUNITY LOSS.
MAXIMAX.
EQUALLY LIKELY.
COEFFICIENT OF REALISM.
MINIMAX.
DECISION TREES,
UTILITY THEORY
MULTI FACTOR DECISION MAKING
DECISION TREES.
SAMPLE INFORMATION.
PROBABILITY VALUES
CALCULATING REVISED PROBABILITIES.
PROBLEM IN USING SURVEY RESULTS.
UTILITY THEORY.
MEASURING UTILITY
KEY IDEA.
DECISION MAKING CRITERION.
MULTI-FACTOR DECISION MAKING.
MULTIFACTOR EVALUATION PROCESS.
ANALYTIC HIERARCHY PROCESS.
COMPARISON OF MFEP AND AHP.
USE OF MICROCOMPUTERS
USE OF EXPERT
SUPER TREE FOR DECISION TREE ANALYSIS.
SUMMARY.
TERMS.
SEQUENTIAL DECISIONS.
UTILITY THEORY.
UTILITY ASSESSMENT.
UTILITY CURVE.
RISK AVOIDER.
RISK SEEKER.
MULTIFACTOR DECISION MAKING.
MULTIFACTOR EVALUATION PROCESS (MFEP).
ANALYTIC HIERARCHY PROCESS. (AHP).
FACTOR EVALUATIONS.
FACTOR WEIGHTS.
KEY EQUATIONS.
FORECASTING
TIME SERIES MODELS.
CASUAL MODELS.
JUDGMENTAL MODELS.
SCATTER MODELS.
TIME SERIES FORECASTING MODELS.
DECOMPOSITION OF A TIME SERIES.
MOVING AVERAGES.
EXPONENTIAL SMOOTHING.
SELECTING THE SMOOTHING CONSTANT.
EXPONENTIAL SMOOTHING
TREND PROJECTIONS.
CASUAL FORECASTING METHODS.
REGRESSION ANALYSIS
STANDARD ERROR
CORRELATION COEFFICIENTS
MULTIPLE REGRESSION ANALYSIS.
MONITORING
ADAPTING SMOOTHING.
DELPHI TECHNIQUE.
USING THE COMPUTER
SUMMARY.
TERMS.
TIME SERIES MODELS.
CASUAL MODELS.
JUDGMENTAL MODELS.
SCATTER DIAGRAMS.
MOVING AVERAGE.
WEIGHTED MOVING AVERAGE.
EXPONENTIAL SMOOTHING.
SMOOTHING CONSTANT.
MEAN ABSOLUTE DEVIATION. (MAD)
MEAN SQUARED ERROR. (MSE)
MEAN ABSOLUTE PERCENT ERROR. (MAPE).
BIAS.
LEAST SQUARES.
REGRESSION ANALYSIS.
ERROR OF THE ESTIMATE.
CORRELATION COEFFICIENT.
TRACKING SIGNAL.
KEY EQUATIONS.
MARKOV ANALYSIS
STATES AND STATE PROBABILITIES
TRANSITION PROBABILITIES.
PREDICTING FUTURE MARKET SHARES.
MARKOV ANALYSIS OF MACHINE OPERATIONS.
EQUILIBRIUM CONDITIONS.
COMPUTER FOR MARKOV ANALYSIS.
SUMMARY.
TERMS.
MARKOV ANALYSIS.
STATE PROBABILITY.
VECTOR OF STATE PROBABILITIES.
MARKET SHARE.
KEY EQUATIONS.
DYNAMIC PROGRAMMING
DYNAMIC PROGRAMMING NOTATION.
KNAPSACK PROBLEM.
TRANSFORMATION AND RETURN FUNCTIONS.
STAGE BY STAGE SOLUTION.
THE PRODUCTION PROBLEM.
OVERVIEW OF THE PRODUCTION PROBLEM.
USING THE COMPUTER
SUMMARY.
TERMS.
DYNAMIC PROGRAMMING.
STAGE.
STATE VARIABLE.
DECISION VARIABLE.
OPTIMAL POLICY.
TRANSFORMATION.
|
BACK TO 100 examples in Business, Operations and
Engineering. |
|
Do it once, do it right, and do it now.
|
|
Back to Lawson Computing Homepage
|
Apply as needed,
when needed. |
