عرض سجل المادة البسيط

dc.contributor.authorHamza, Abdel-Kader
dc.date.accessioned2018-08-13T12:31:25Z
dc.date.available2018-08-13T12:31:25Z
dc.date.issued1983-12
dc.identifier.urihttp://repository.inp.edu.eg/xmlui/handle/123456789/4093
dc.description.abstractInteger programming is an extension of linear programming, that is to say we begin by forgetting the integer requirement and solving the problem. If the solution has all variables of the integer form, we have found an Optimum, integer solution. If it dog not we continue by adding new constraint, which is called a cut.en_US
dc.language.isootheren_US
dc.publisherThe Institute Of National Planning.en_US
dc.relation.ispartofseriesExternal Notes.;1373
dc.subjectPlanning.en_US
dc.subjectProgramming.en_US
dc.subjectinvestments.en_US
dc.titlesolution methods for integer programming problemsen_US
dc.typeOtheren_US


الملفات في هذه المادة

Thumbnail

هذه المادة تظهر في الحاويات التالية

عرض سجل المادة البسيط