If a maximization linear programming problem consists of all less-than-or-equal-to constraints with all positive coefficients and the objective function consists of all positive objective function coefficients, then rounding down the linear programming optimal solution values of the decision variables will result in a feasible solution to the integer linear programming problem.

The correct answer to the following question is always.

Explanation:

Linear programming is the programming in which selecting the best possible choice from those available alternatives whose constraint function and the objective function can be referred to as the linear mathematical function.

Linear programming is used for the optimization of linear objective.

It is used as constrained optimization, from where the objective functions and constraints all are linear.

how does that happen,where u steel points

the correct answer is economics is a game without winners or losers.

unlike sports or games economic is a game without losers or winner rather it is a game where everyone wins. parties of business doing businesses exchange money with each other and hence exchange is done on the basis of goods. one party takes the goods and other sales it so there is winner on both sides. each party values more highly the good it gets than the good it gives up. both sides exchange only because both intend to increase their value. so there is no concept of lose or win.