Grade 11 and 12 Mathematics (Moderator: geoffrey)

If the dual is unbounded then the primal is: a.unknown. b.feasible. c.unbounded. ...

Started by kshipps

In the dual simplex method dual feasibility (primal is a maximization problem) is maintained by: ...

Started by BrownTown3

A balanced transportation problem has what constraint? a. b. c. ...

Started by deesands

In the northwest corner method if x11 = d1 s1, then you cross out: a.column 1. b.row 1. c.both ...

Started by KWilfred

Which is NOT part of sensitivity analysis for the transportation problem? a.changing the objective ...

Started by mpobi80

In an assignment problem how many basic variables will be 0? a.m-1 b.n c.n-1 ...

Started by Davideckstein7

Transshipment problems can be converted to transportation problems by: a.adding transshipment ...

Started by torybrooks

In Dijkstra's algorithm, a temporary label is made permanent if: a.it is smaller than 5. b.it is ...

Started by mia

The terminal point in a maximum flow problem is called the: a.source. b.start. c.sink. ...

Started by cagreen833

Which is NOT a use for CPM and PERT? a.building a ship b.installing a new computer system ...

Started by jhjkgdfhk

Which is NOT a MCNFP? a.assignment b.shortest path c.CPM-PERT d.maximum ...

Started by panfilo

The MST for the network below is: a.(1,2) (2,3) (3,4) (4,5). b.(1,2) (2,3) (3,4) (1,5). ...

Started by jake

Which is NOT an IP? a.knapsack b.transshipment c.Fixed Charge ...

Started by leo leo

If you solve the IP as an LP then what condition must be met to insure an optimal solution to the ...

Started by a0266361136

Which situation will NOT result in a subproblem being fathomed? a.The optimal z-value for the ...

Started by tuffie

To convert an IP to a 0-1 IP variables must be created using powers of: a.4. b.2. c.5. ...

Started by ec501234

Pricing out the nonbasic variable refers to: a.determining which nonbasic variable should enter the ...

Started by joe

The cutting stock problem can be reformulated to the: a.knapsack problem. b.CPM-PERT problem. ...

Started by WhattoUnderstand

Any point x in the LP's feasible region may be written as: a.the sum of some bfs. b.a ...

Started by jjjetplane

To solve an LP with upper-bound constraints allow xi=0 or xi= ...

Started by bcretired

Which is NOT a concept in Karmarkar's method? a.project of a vector onto the set of x satisfying ...

Started by Mr.Thesaxman

Var(kXi) = ________. a.var(Xi). b.k2var(Xi) c.k var(Xi) ...

Started by kamilo84

is a stationary point of f(x) if: a.for all i. b.for at least 2 values of i = 1, 2, ..., n. c. ...

Started by TVarnum

Which function is concave? a.f(x) = ln x b.f(x) = e-x c.f(x) = 2x2 - x d.f(x) = ...

Started by dakota nelson

The interval (a,b means: a.all x satisfying a

Started by jon_i