Practice by Category & Subject

In linear programming, a surplus specifically represents the amount by which the left-hand side of a greater-than-or-equal-to constraint exceeds the right-hand side value. This concept applies exclusively to constraints where the optimal solution lies beyond the minimum requirement, creating an excess. Unlike slack variables used for less-than-or-equal constraints, surplus quantifies this positive difference directly. Therefore, it is the precise term for measuring how much the actual value surpasses the limit in these specific scenarios.

Question 2 Easy Mcq

✓ Correct ✗ Incorrect

Range of feasibility is the limited range over which the shadow price ______

Remains constant

Large

Small

Both a & c

Explanation:

The range of feasibility, also known as the range of optimality, defines the specific interval within which the shadow price of a constraint remains unchanged. This concept is crucial in sensitivity analysis because it indicates how much a resource's availability can vary before the marginal value of that resource shifts. As long as the right-hand side of the constraint stays within this calculated range, the dual price associated with that constraint does not fluctuate. Consequently, decision-makers can confidently use the current shadow price for optimization calculations without needing to resolve the entire linear programming model.

Question 3 Easy Mcq

✓ Correct ✗ Incorrect

Corner point solution method an approach in ________

Procedural Programming

Functional Programming

Scripting Programming

Linear programming

Explanation:

The corner point solution method is a fundamental technique used specifically within Linear Programming to find optimal solutions. It operates on the principle that the maximum or minimum value of a linear objective function over a feasible region defined by linear constraints must occur at one of the vertices, or corner points, of that region. By evaluating the objective function at each corner point, one can systematically identify the best possible outcome without needing to check every single point inside the feasible area. This approach relies entirely on the geometric properties of linear inequalities and the convex nature of the feasible region in linear optimization problems. Consequently, it is an intrinsic part of Linear Programming rather than general procedural, functional, or scripting programming paradigms.

Question 4 Easy Mcq

✓ Correct ✗ Incorrect

Which is the correct statement of Objective function ?

The objective of an LP problem expressed mathematically

The limited range over which the shadow price remains constant

The range of values of the objective function within which the optimal values of the decision variables will not change

None of these

Explanation:

The objective function in Linear Programming is the mathematical expression that defines the goal of the problem, such as maximizing profit or minimizing cost. It serves as the primary target that the optimization algorithm seeks to improve by adjusting the decision variables. This function is distinct from constraints, which limit the feasible region, and it directly quantifies the performance metric the model aims to optimize. Therefore, it accurately represents the core objective expressed mathematically within the LP framework.

Question 5 Easy Mcq

✓ Correct ✗ Incorrect

______ is the effect of changing a decision variable that is proportional to its magnitude.

Corner point

Linear relationship

Iso-profit line

Range of optimality

Explanation:

When a decision variable changes by a specific amount, the resulting change in the objective function value is directly proportional to that magnitude, which is the defining characteristic of a linear relationship. This proportionality means the rate of change remains constant regardless of the variable's current value, forming a straight line on a graph. In linear programming, this fundamental property ensures that the objective function behaves predictably across the feasible region. Consequently, any proportional effect of altering a decision variable is inherently described as a linear relationship.

Question 6 Easy Mcq

✓ Correct ✗ Incorrect

A method by which parallel cost lines are plotted in the LP graphical solution approach to determine the least cost solution to LP problems with cost minimization objective is known as

Iso-cost line method

Iso-profit line method

Linear relationship

None of these

Explanation:

The correct term is the iso-cost line method because it specifically refers to plotting lines representing constant total costs on a graph. In cost minimization problems, these parallel lines are shifted inward toward the origin until the last point of contact with the feasible region is found. This specific point identifies the combination of decision variables that yields the lowest possible cost while satisfying all constraints. The method relies on the geometric property that the optimal solution always occurs at a corner point where an iso-cost line is tangent to the feasible area. By analyzing the slope of these lines relative to the constraint boundaries, one can visually and mathematically determine the least cost solution.

Question 7 Easy Mcq

✓ Correct ✗ Incorrect

The range of values of the objective function within which the best values of the decision variables will not change is known as the ______.

Range of optimality

Range of feasibility

Linear relationship

Iso-profit line

Explanation:

The range of optimality defines the specific interval where the current optimal solution remains valid despite changes in the objective function coefficients. Within this range, the best values for the decision variables stay constant because the relative slopes of the objective function and constraint boundaries do not shift enough to alter the optimal corner point. This concept is fundamental in sensitivity analysis to determine how robust a solution is to parameter variations without needing to resolve the entire model. It essentially identifies the stability limits for the optimal decision variables before a new set of variables becomes preferable. Understanding this range allows analysts to predict solution behavior under uncertainty in profit or cost estimates.

Question 8 Easy Mcq

✓ Correct ✗ Incorrect

The range of values of the objective function within which the optimal values of the decision variables will not change is known as

Range of optimality

Range of feasibility

Redundant constraints

Shadow price or dual price

Explanation:

The range of optimality defines the specific interval where the coefficients of the objective function can vary without altering the current optimal solution's composition. Within this calculated range, the decision variables remain constant even if the profit or cost values shift slightly. This concept is fundamental in sensitivity analysis to determine how robust an optimal plan is against changes in economic parameters. It ensures that the same set of decision variables continues to yield the best possible outcome as long as the objective function coefficients stay within these bounds.

Question 9 Easy Mcq

✓ Correct ✗ Incorrect

If there were no ______ on the availability of resources, linear programming would not be needed as a decision-making tool.

Restrictions

Visibility

Decisions

Slack

Explanation:

Linear programming is fundamentally designed to optimize an objective function while adhering to specific constraints, which are known as restrictions. Without these limitations on resource availability, such as limited raw materials or production time, the mathematical model would simply yield an unconstrained maximum or minimum. The entire purpose of the tool is to find the best possible solution within a bounded feasible region defined by these restrictions. Therefore, if resources were unlimited and unrestricted, the complex optimization process provided by linear programming would become unnecessary.

Question 10 Easy Mcq

✓ Correct ✗ Incorrect

______ has been applied in a variety of industries to address a variety of problems.

Linear programming

Iso-profit line

Range of feasibility

Corner point

Explanation:

Linear programming is a powerful mathematical technique used to optimize outcomes like profit or cost within complex systems. It functions by defining linear relationships between variables and constraints to find the best possible solution. This versatile method has successfully been applied across diverse sectors such as manufacturing, logistics, and finance to solve resource allocation challenges. Its ability to model real-world scenarios makes it a fundamental tool for addressing a wide variety of operational problems efficiently.

Question 11 Easy Mcq

✓ Correct ✗ Incorrect

______ is the determination of how subtle the current optimal solution is to changes in the input parameter values.

Iso-profit line

Range of feasibility

Linear relationship

A feasible solution is defined as any set of decision variables that strictly adheres to every single constraint within the mathematical model. Unlike optimal or extreme points, which require additional criteria, a feasible solution simply represents a valid operating point where no rule is violated. This concept is fundamental in optimization because the search for the best outcome begins by identifying the entire region of feasible solutions. Without satisfying all constraints simultaneously, a solution is considered invalid for the specific problem at hand. Therefore, the term feasible directly describes the state of meeting all requirements.

Question 17 Easy Mcq

✓ Correct ✗ Incorrect

Multiple optimum solutions every combination of values of the decision variables that falls on that segment of the constraint line

True

False

Explanation:

In linear programming, when the objective function's slope matches the slope of a binding constraint, every point along that constraint segment between its intersection points becomes an optimal solution. This scenario is known as having multiple or alternative optima, meaning the model does not yield a single unique best value but rather an entire line of equally optimal outcomes. Consequently, any combination of decision variables falling on this specific segment satisfies the optimality condition perfectly. Therefore, the statement accurately describes this fundamental property of linear optimization problems where the objective function is parallel to a constraint boundary.

Question 18 Easy Mcq

✓ Correct ✗ Incorrect

The constraints that form the corner points at the boundaries of the feasible solution region are known as ______.

Redundant constraints

Surplus constraints

Binding constraints

Infinite constraints

Explanation:

Binding constraints are the specific restrictions that are fully utilized at the optimal solution, effectively forming the boundaries of the feasible region. These constraints intersect to create the corner points, or vertices, which are critical for determining the optimal value in linear programming. When a constraint is binding, the solution lies exactly on the line defined by that constraint rather than inside the feasible area. This means any slight change to a binding constraint would alter the feasible region and potentially the optimal solution. In contrast, non-binding constraints do not touch the optimal point and leave some slack. Therefore, identifying binding constraints is essential for understanding the geometry of the solution space.

Question 19 Easy Mcq

✓ Correct ✗ Incorrect

______ are constraints in a linear programming problem that do not affect the boundaries of the feasible solution region.

Corner point

Iso-profit line

Redundant constraints

Range of optimality

Explanation:

Redundant constraints are inequalities in a linear programming model that do not actually limit the feasible region because the solution is already restricted by other, tighter constraints. Geometrically, these constraints define boundary lines that lie completely outside the final feasible area, making them unnecessary for determining the optimal solution. While they are part of the mathematical formulation, they have no impact on the shape or size of the feasible region where valid solutions exist. Consequently, removing a redundant constraint does not change the set of possible solutions or the location of the optimal point. This distinguishes them from essential constraints that actively shape the boundaries of the feasible region.

Question 20 Easy Mcq

✓ Correct ✗ Incorrect

Which of correct statement about Constraints

An approach in linear programming

A method by which parallel cost lines are plotted in the LP graphical solution

The limited availability of resources

Both b & c

Explanation:

In linear programming, constraints represent the specific limitations or restrictions that define the feasible region for a solution. These restrictions typically arise from the limited availability of essential resources such as raw materials, labor hours, or machine capacity. By mathematically modeling these boundaries, the optimization process ensures that any proposed solution adheres to real-world operational limits. Therefore, defining constraints as the limited availability of resources is the most accurate description of their fundamental role in the model.

Question 21 Easy Mcq

✓ Correct ✗ Incorrect

Every linear programming problem will have an ______ that needs to be either maximized or minimized.

Objective

Decision

Variable

Function

Explanation:

In linear programming, the specific mathematical expression that represents the goal of the problem is known as the objective function. This component is crucial because the entire optimization process is designed to either maximize its value, such as profit, or minimize it, such as cost. Without this defined target, the algorithm would lack direction and could not determine the optimal solution. Therefore, every linear programming problem must include an objective to guide the search for the best possible outcome.

Question 22 Easy Mcq

✓ Correct ✗ Incorrect

Which Statement is correct about Shadow price or dual price

Determine the optimal value of the objective function

It is the price one would be willing to pay for acquiring an additional unit of that resource

The amount by which the left-hand-side values are less than the right-hand-side values in LP constraints

All are related to Shadow price or dual price

Explanation:

The shadow price, also known as the dual price, represents the marginal value of relaxing a constraint in a linear programming problem. Specifically, it quantifies the increase in the optimal objective function value resulting from acquiring one additional unit of a scarce resource. Therefore, it is interpreted as the maximum price a decision-maker should be willing to pay to obtain that extra unit, as it directly reflects the resource's contribution to the total profit or efficiency. This concept is fundamental in sensitivity analysis to determine the economic worth of resources beyond their market cost.

Question 23 Easy Mcq

✓ Correct ✗ Incorrect

The amount by which the left-hand-side values are less than the right-hand-side values in LP constraints is known as

Slack

Surplus

Both a & b

None of these

Explanation:

In linear programming, slack represents the unused resources or the difference between the left-hand side and the right-hand side when the constraint is an inequality of the less-than-or-equal type. This value indicates how much capacity remains available without violating the constraint, making it the precise term for the amount by which the left side is less than the right side. Unlike surplus, which applies to greater-than-or-equal constraints, slack specifically quantifies this gap in standard resource limitation scenarios. Therefore, it is the correct terminology for measuring the unused portion of a constraint boundary.

Question 24 Easy Mcq

✓ Correct ✗ Incorrect

The ______ in linear programming are alternative courses of action.

Redundant constraints

Sensitivity

Range of feasibility

Decision variables

Explanation:

In linear programming, decision variables represent the specific quantities or choices that a manager must determine to optimize an objective function. These variables directly correspond to the alternative courses of action available within a given business scenario, such as the number of units to produce or the amount of resources to allocate. By defining these variables, the model mathematically captures the different strategies or paths an organization can take to achieve its goals. Consequently, they serve as the fundamental building blocks that allow the solver to evaluate various possibilities and select the optimal solution.

Question 25 Easy Mcq

✓ Correct ✗ Incorrect

_______ determination in the LP technique of how sensitive the current optimal solution is to changes in the input parameter values

Sensitivity or post-optimality analysis

Shadow price or dual price

Simplex method

BOTH A & B

Explanation:

Sensitivity or post-optimality analysis is the specific process used to evaluate how robust an optimal solution remains when input parameters fluctuate. This technique systematically investigates the range of values for coefficients and constraints without resolving the entire model from scratch. It provides critical insights into the stability of the current solution and guides decision-makers on potential risks associated with data uncertainty. By quantifying these effects, it ensures that the optimal plan remains valid even under slight variations in the real-world environment.

Question 26 Easy Mcq

✓ Correct ✗ Incorrect

Each october the oig releases a ____ outlining its priorities for the fiscal year ahead.

Compliance Plan

Work Plan

Self-referral laws

CIA yearly review

Explanation:

The Office of Inspector General (OIG) issues an annual Work Plan each October to publicly define its strategic priorities for the upcoming fiscal year. This document outlines specific audit and investigative projects intended to address high-risk areas within the healthcare system. By releasing this plan, the OIG ensures transparency and allows stakeholders to understand the agency's focus on preventing fraud, waste, and abuse. It serves as a formal roadmap that guides the agency's operational resources and efforts throughout the year. Consequently, the term "Work Plan" accurately describes this essential annual publication.

Question 27 Easy Mcq

✓ Correct ✗ Incorrect

______ arise because resources are scarce and decisions have to be made within the limitations imposed by this scarcity.

Slack

Surplus

Constraints

Objective function

Explanation:

Constraints naturally emerge when available resources are limited, forcing organizations to make strategic choices within those boundaries. This scarcity prevents unlimited production or expansion, creating restrictions that must be managed carefully. By recognizing these limitations, decision-makers can prioritize activities that align with their goals despite the lack of abundant inputs. Understanding this fundamental economic principle helps in formulating realistic plans and optimizing resource allocation effectively. Therefore, the term that accurately describes these limitations is constraints.

Question 28 Easy Mcq

✓ Correct ✗ Incorrect

______ is a method by which parallel profit lines are plotted in the LP graphical solution approach to determine the maximum profit solution to LP problems with profit maximization objective.

Corner point solution method

Iso-cost line method

Iso-profit line method

Multiple optimum solutions

Explanation:

The iso-profit line method involves drawing a straight line representing a specific profit level on the graph. By shifting this line parallel to itself in the direction of increasing profit, one can identify the last point where the line still touches the feasible region. This specific point of tangency represents the optimal solution that yields the maximum possible profit for the given linear programming problem.

Question 29 Easy Mcq

✓ Correct ✗ Incorrect

In Linear relationship the effect of changing a decision variable is proportional to its ______

Time

Value

Quality

Magnitude

Explanation:

In a linear relationship, the change in the outcome variable is directly proportional to the change in the decision variable, meaning the impact scales strictly with the magnitude of that change. This fundamental property implies that doubling the magnitude of the input results in exactly double the effect on the output, maintaining a constant ratio between them. Consequently, the size or extent of the adjustment, rather than time, value, or quality, determines the proportional response in such systems. This direct scaling behavior is the defining characteristic that makes magnitude the correct factor in this context. Understanding this proportionality is essential for accurately modeling and predicting outcomes in linear systems.

Question 30 Easy Mcq

✓ Correct ✗ Incorrect

Simplex method provides a systematic way of examining the corner or extreme points of the feasible region of more complex LP problems

True

False

Explanation:

The Simplex method is a fundamental algorithm in linear programming designed to optimize linear objective functions by systematically traversing the vertices, or corner points, of the feasible region. Instead of checking every possible solution within the region, it efficiently moves from one extreme point to an adjacent one, improving the objective value at each step until an optimal solution is found. This geometric approach ensures that the global optimum for a linear problem is located at one of these boundary corners, making the statement accurate. The method effectively handles complex problems with many variables and constraints by focusing solely on these critical points. Therefore, the assertion that it examines corner points is the core principle of how the algorithm functions. This confirms the validity of the provided statement.

Filter by Difficulty

easy

medium

hard

Track Progress

Difficulty Filter

easy Easy

medium

hard

Other Subjects

Business Finance & Management

Industrial Engineering & Manufacturing

IT & Programming

Design & Multimedia

Content Writing & Translation

Administrative Support

Quick Navigation

Other Business Finance & Management Subjects

Linear Programming

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Explanation:

Filter by Difficulty

Track Progress

Difficulty Filter

Other Subjects

Other Business Finance & Management Subjects

Quick Navigation

Similar Practices