文件名称:class_code
介绍说明－－下载内容均来自于网络，请自行研究使用
求解线性规划问题,即在一组线性不等式或等式组的约束条件下求某个线性函数的最值问题。-solving linear programming problems in a linear equation group inequalities or the condition of a linear function for the most value problem.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
About.cpp
About.dfm
About.h
Classmate.bpr
Classmate.cpp
Classmate.dsk
config.ini
data
....\classmate_code.db
....\classmate_code.PX
....\classmate_main.DB
....\classmate_main.PX
....\classmate_main.VAL
....\Direct.ini
DataM.cpp
DataM.dfm
DataM.h
help.txt
logo.cpp
logo.dfm
logo.h
Main.cpp
Main.dfm
Main.h
Print.cpp
Print.dfm
Print.h
Print_Detail.cpp
Print_Detail.dfm
Print_Detail.h
Print_Set.cpp
Print_Set.dfm
Print_Set.h
Public.cpp
Public.h
Query.cpp
Query.dfm
Query.h
readme.txt
Set.cpp
Set.dfm
Set.h
About.dfm
About.h
Classmate.bpr
Classmate.cpp
Classmate.dsk
config.ini
data
....\classmate_code.db
....\classmate_code.PX
....\classmate_main.DB
....\classmate_main.PX
....\classmate_main.VAL
....\Direct.ini
DataM.cpp
DataM.dfm
DataM.h
help.txt
logo.cpp
logo.dfm
logo.h
Main.cpp
Main.dfm
Main.h
Print.cpp
Print.dfm
Print.h
Print_Detail.cpp
Print_Detail.dfm
Print_Detail.h
Print_Set.cpp
Print_Set.dfm
Print_Set.h
Public.cpp
Public.h
Query.cpp
Query.dfm
Query.h
readme.txt
Set.cpp
Set.dfm
Set.h