A feasible solution to the linear programming problem should

Home / Mechanical Engineering / Industrial Engineering And Production Management / Question

Examveda

A feasible solution to the linear programming problem should

A. Satisfy the problem constraints

B. Optimise the objective function

C. Satisfy the problem constraints and non-negativity restrictions

D. Satisfy the non-negativity restrictions

Answer: Option C

Solution (By Examveda Team)

A feasible solution to the linear programming problem should Satisfy the problem constraints and non-negativity restrictions

This Question Belongs to Mechanical Engineering >> Industrial Engineering And Production Management

Join The Discussion

Related Questions on Industrial Engineering and Production Management

Actual performance of a task is called

A. An event

B. An activity

C. A duration

D. None of these

View Answer

View Answer

The essential condition for the decompression of an activity is that

A. The project time should change due to decompression

B. After decompression the time of an activity invariably exceeds its normal time

C. An activity could be decompressed to the maximum extent of its normal time

D. None of the above

View Answer

View Answer

According to MAPI formula, the old machine should be replaced by new one when
(Here, CAM = Challenger's Adverse minimum, DAM = Defender's Adverse minimum)

A. CAM < DAM

B. CAM > DAM

C. CAM = DAM

D. There is no such criterion

View Answer

View Answer

Bar charts are suitable for

A. Minor works

B. Major works

C. Large projects

D. All of the above

View Answer

View Answer

More Related Questions on Industrial Engineering and Production Management